/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_normal_file-30.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 02:38:37,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 02:38:37,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 02:38:37,292 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 02:38:37,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 02:38:37,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 02:38:37,323 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 02:38:37,324 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 02:38:37,324 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 02:38:37,328 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 02:38:37,328 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 02:38:37,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 02:38:37,329 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 02:38:37,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 02:38:37,330 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 02:38:37,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 02:38:37,331 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 02:38:37,331 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 02:38:37,331 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 02:38:37,332 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 02:38:37,332 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 02:38:37,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 02:38:37,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 02:38:37,333 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 02:38:37,333 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 02:38:37,334 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 02:38:37,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 02:38:37,334 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 02:38:37,335 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 02:38:37,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 02:38:37,336 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 02:38:37,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 02:38:37,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 02:38:37,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 02:38:37,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 02:38:37,336 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 02:38:37,336 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 02:38:37,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 02:38:37,337 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 02:38:37,337 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 02:38:37,337 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 02:38:37,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 02:38:37,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 02:38:37,338 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 02:38:37,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 02:38:37,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 02:38:37,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 02:38:37,591 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 02:38:37,592 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 02:38:37,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_normal_file-30.i [2023-12-16 02:38:38,733 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 02:38:38,951 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 02:38:38,952 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_normal_file-30.i [2023-12-16 02:38:38,963 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/243278f22/81c8c7734f7c479596e3f9b2eaa359f8/FLAGf3a61a14b [2023-12-16 02:38:38,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/243278f22/81c8c7734f7c479596e3f9b2eaa359f8 [2023-12-16 02:38:38,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 02:38:38,985 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 02:38:38,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 02:38:38,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 02:38:38,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 02:38:38,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:38:38" (1/1) ... [2023-12-16 02:38:38,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ec37eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:38, skipping insertion in model container [2023-12-16 02:38:38,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:38:38" (1/1) ... [2023-12-16 02:38:39,034 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 02:38:39,179 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_normal_file-30.i[913,926] [2023-12-16 02:38:39,229 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 02:38:39,241 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 02:38:39,249 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_normal_file-30.i[913,926] [2023-12-16 02:38:39,268 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 02:38:39,281 INFO L206 MainTranslator]: Completed translation [2023-12-16 02:38:39,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:39 WrapperNode [2023-12-16 02:38:39,282 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 02:38:39,283 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 02:38:39,283 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 02:38:39,283 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 02:38:39,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:39" (1/1) ... [2023-12-16 02:38:39,307 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:39" (1/1) ... [2023-12-16 02:38:39,332 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2023-12-16 02:38:39,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 02:38:39,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 02:38:39,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 02:38:39,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 02:38:39,341 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:39" (1/1) ... [2023-12-16 02:38:39,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:39" (1/1) ... [2023-12-16 02:38:39,343 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:39" (1/1) ... [2023-12-16 02:38:39,356 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 02:38:39,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:39" (1/1) ... [2023-12-16 02:38:39,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:39" (1/1) ... [2023-12-16 02:38:39,371 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:39" (1/1) ... [2023-12-16 02:38:39,374 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:39" (1/1) ... [2023-12-16 02:38:39,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:39" (1/1) ... [2023-12-16 02:38:39,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:39" (1/1) ... [2023-12-16 02:38:39,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 02:38:39,379 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 02:38:39,379 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 02:38:39,379 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 02:38:39,380 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:39" (1/1) ... [2023-12-16 02:38:39,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 02:38:39,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 02:38:39,440 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 02:38:39,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 02:38:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 02:38:39,480 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 02:38:39,481 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 02:38:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 02:38:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 02:38:39,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 02:38:39,579 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 02:38:39,583 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 02:38:39,798 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 02:38:39,846 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 02:38:39,846 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 02:38:39,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:38:39 BoogieIcfgContainer [2023-12-16 02:38:39,846 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 02:38:39,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 02:38:39,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 02:38:39,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 02:38:39,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 02:38:38" (1/3) ... [2023-12-16 02:38:39,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8567d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:38:39, skipping insertion in model container [2023-12-16 02:38:39,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:39" (2/3) ... [2023-12-16 02:38:39,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8567d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:38:39, skipping insertion in model container [2023-12-16 02:38:39,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:38:39" (3/3) ... [2023-12-16 02:38:39,872 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-30.i [2023-12-16 02:38:39,888 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 02:38:39,889 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 02:38:39,947 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 02:38:39,952 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@41ed52c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 02:38:39,952 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 02:38:39,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 38 states have (on average 1.5) internal successors, (57), 39 states have internal predecessors, (57), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 02:38:39,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-16 02:38:39,968 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 02:38:39,969 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 02:38:39,973 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 02:38:39,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 02:38:39,978 INFO L85 PathProgramCache]: Analyzing trace with hash -422343162, now seen corresponding path program 1 times [2023-12-16 02:38:39,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 02:38:39,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280762183] [2023-12-16 02:38:39,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 02:38:39,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 02:38:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:40,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 02:38:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:40,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 02:38:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:40,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 02:38:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:40,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 02:38:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:40,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 02:38:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:40,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 02:38:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:40,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 02:38:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:40,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 02:38:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:40,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 02:38:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:40,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-16 02:38:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:40,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 02:38:40,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:40,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-16 02:38:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:40,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-16 02:38:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:40,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 02:38:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:40,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-16 02:38:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:40,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 02:38:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:40,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 02:38:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:40,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 02:38:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 02:38:40,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 02:38:40,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280762183] [2023-12-16 02:38:40,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280762183] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 02:38:40,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 02:38:40,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 02:38:40,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048149359] [2023-12-16 02:38:40,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 02:38:40,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 02:38:40,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 02:38:40,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 02:38:40,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 02:38:40,478 INFO L87 Difference]: Start difference. First operand has 59 states, 38 states have (on average 1.5) internal successors, (57), 39 states have internal predecessors, (57), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-16 02:38:40,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 02:38:40,533 INFO L93 Difference]: Finished difference Result 115 states and 202 transitions. [2023-12-16 02:38:40,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 02:38:40,537 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 117 [2023-12-16 02:38:40,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 02:38:40,547 INFO L225 Difference]: With dead ends: 115 [2023-12-16 02:38:40,547 INFO L226 Difference]: Without dead ends: 57 [2023-12-16 02:38:40,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 02:38:40,558 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 02:38:40,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 02:38:40,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-16 02:38:40,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-12-16 02:38:40,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 37 states have internal predecessors, (52), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 02:38:40,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 88 transitions. [2023-12-16 02:38:40,610 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 88 transitions. Word has length 117 [2023-12-16 02:38:40,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 02:38:40,610 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 88 transitions. [2023-12-16 02:38:40,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-16 02:38:40,610 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 88 transitions. [2023-12-16 02:38:40,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-16 02:38:40,617 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 02:38:40,617 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 02:38:40,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 02:38:40,618 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 02:38:40,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 02:38:40,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2059200110, now seen corresponding path program 1 times [2023-12-16 02:38:40,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 02:38:40,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814933613] [2023-12-16 02:38:40,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 02:38:40,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 02:38:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:41,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 02:38:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:41,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 02:38:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:41,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 02:38:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:41,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 02:38:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:41,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 02:38:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:41,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 02:38:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:41,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 02:38:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:41,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 02:38:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:41,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 02:38:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:41,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-16 02:38:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:41,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 02:38:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:41,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-16 02:38:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:41,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-16 02:38:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:41,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 02:38:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:41,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-16 02:38:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:41,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 02:38:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:41,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 02:38:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:41,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 02:38:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:41,475 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-16 02:38:41,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 02:38:41,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814933613] [2023-12-16 02:38:41,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814933613] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 02:38:41,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421141196] [2023-12-16 02:38:41,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 02:38:41,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 02:38:41,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 02:38:41,488 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 02:38:41,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 02:38:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:41,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 02:38:41,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 02:38:44,157 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 233 proven. 39 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2023-12-16 02:38:44,158 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 02:38:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-16 02:38:45,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421141196] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 02:38:45,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 02:38:45,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2023-12-16 02:38:45,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754597162] [2023-12-16 02:38:45,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 02:38:45,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 02:38:45,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 02:38:45,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 02:38:45,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-12-16 02:38:45,531 INFO L87 Difference]: Start difference. First operand 57 states and 88 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-16 02:38:46,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 02:38:46,072 INFO L93 Difference]: Finished difference Result 166 states and 253 transitions. [2023-12-16 02:38:46,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 02:38:46,072 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 117 [2023-12-16 02:38:46,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 02:38:46,074 INFO L225 Difference]: With dead ends: 166 [2023-12-16 02:38:46,074 INFO L226 Difference]: Without dead ends: 110 [2023-12-16 02:38:46,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 261 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2023-12-16 02:38:46,076 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 170 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 02:38:46,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 359 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 02:38:46,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-12-16 02:38:46,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 90. [2023-12-16 02:38:46,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 65 states have (on average 1.4923076923076923) internal successors, (97), 66 states have internal predecessors, (97), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-16 02:38:46,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 141 transitions. [2023-12-16 02:38:46,092 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 141 transitions. Word has length 117 [2023-12-16 02:38:46,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 02:38:46,092 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 141 transitions. [2023-12-16 02:38:46,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-16 02:38:46,093 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 141 transitions. [2023-12-16 02:38:46,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-16 02:38:46,094 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 02:38:46,095 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 02:38:46,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 02:38:46,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 02:38:46,302 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 02:38:46,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 02:38:46,302 INFO L85 PathProgramCache]: Analyzing trace with hash -2059140528, now seen corresponding path program 1 times [2023-12-16 02:38:46,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 02:38:46,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194051170] [2023-12-16 02:38:46,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 02:38:46,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 02:38:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:46,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 02:38:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:46,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 02:38:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:46,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 02:38:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:46,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 02:38:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:46,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 02:38:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:46,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 02:38:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:46,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 02:38:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:46,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 02:38:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:46,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 02:38:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:46,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-16 02:38:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:46,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 02:38:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:46,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-16 02:38:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:46,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-16 02:38:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:46,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 02:38:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:46,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-16 02:38:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:46,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 02:38:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:46,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 02:38:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:46,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 02:38:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-16 02:38:46,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 02:38:46,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194051170] [2023-12-16 02:38:46,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194051170] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 02:38:46,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196235493] [2023-12-16 02:38:46,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 02:38:46,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 02:38:46,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 02:38:46,578 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 02:38:46,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 02:38:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 02:38:46,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 02:38:46,680 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 02:38:46,811 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 233 proven. 39 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2023-12-16 02:38:46,811 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 02:38:46,968 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-16 02:38:46,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196235493] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 02:38:46,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 02:38:46,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2023-12-16 02:38:46,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041421490] [2023-12-16 02:38:46,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 02:38:46,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 02:38:46,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 02:38:46,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 02:38:46,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-16 02:38:46,971 INFO L87 Difference]: Start difference. First operand 90 states and 141 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-16 02:38:47,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 02:38:47,324 INFO L93 Difference]: Finished difference Result 188 states and 284 transitions. [2023-12-16 02:38:47,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 02:38:47,325 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 117 [2023-12-16 02:38:47,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 02:38:47,331 INFO L225 Difference]: With dead ends: 188 [2023-12-16 02:38:47,334 INFO L226 Difference]: Without dead ends: 105 [2023-12-16 02:38:47,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 266 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2023-12-16 02:38:47,340 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 194 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 02:38:47,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 191 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 02:38:47,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-16 02:38:47,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 89. [2023-12-16 02:38:47,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 64 states have internal predecessors, (86), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-16 02:38:47,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 130 transitions. [2023-12-16 02:38:47,357 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 130 transitions. Word has length 117 [2023-12-16 02:38:47,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 02:38:47,358 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 130 transitions. [2023-12-16 02:38:47,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-16 02:38:47,358 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 130 transitions. [2023-12-16 02:38:47,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-16 02:38:47,366 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 02:38:47,366 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 02:38:47,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 02:38:47,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-12-16 02:38:47,572 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 02:38:47,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 02:38:47,573 INFO L85 PathProgramCache]: Analyzing trace with hash 57048681, now seen corresponding path program 1 times [2023-12-16 02:38:47,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 02:38:47,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528475887] [2023-12-16 02:38:47,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 02:38:47,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 02:38:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 02:38:47,619 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 02:38:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 02:38:47,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 02:38:47,672 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 02:38:47,673 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 02:38:47,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 02:38:47,677 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-16 02:38:47,680 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 02:38:47,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 02:38:47 BoogieIcfgContainer [2023-12-16 02:38:47,767 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 02:38:47,768 INFO L158 Benchmark]: Toolchain (without parser) took 8782.88ms. Allocated memory was 185.6MB in the beginning and 370.1MB in the end (delta: 184.5MB). Free memory was 137.0MB in the beginning and 257.2MB in the end (delta: -120.3MB). Peak memory consumption was 65.4MB. Max. memory is 8.0GB. [2023-12-16 02:38:47,768 INFO L158 Benchmark]: CDTParser took 0.59ms. Allocated memory is still 185.6MB. Free memory was 140.2MB in the beginning and 140.1MB in the end (delta: 77.1kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 02:38:47,768 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.91ms. Allocated memory is still 185.6MB. Free memory was 137.0MB in the beginning and 123.5MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 02:38:47,769 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.25ms. Allocated memory is still 185.6MB. Free memory was 123.5MB in the beginning and 121.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 02:38:47,769 INFO L158 Benchmark]: Boogie Preprocessor took 45.75ms. Allocated memory is still 185.6MB. Free memory was 121.2MB in the beginning and 118.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 02:38:47,769 INFO L158 Benchmark]: RCFGBuilder took 467.25ms. Allocated memory is still 185.6MB. Free memory was 118.8MB in the beginning and 101.0MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-16 02:38:47,769 INFO L158 Benchmark]: TraceAbstraction took 7900.85ms. Allocated memory was 185.6MB in the beginning and 370.1MB in the end (delta: 184.5MB). Free memory was 157.8MB in the beginning and 257.2MB in the end (delta: -99.5MB). Peak memory consumption was 85.5MB. Max. memory is 8.0GB. [2023-12-16 02:38:47,771 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.59ms. Allocated memory is still 185.6MB. Free memory was 140.2MB in the beginning and 140.1MB in the end (delta: 77.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 294.91ms. Allocated memory is still 185.6MB. Free memory was 137.0MB in the beginning and 123.5MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.25ms. Allocated memory is still 185.6MB. Free memory was 123.5MB in the beginning and 121.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.75ms. Allocated memory is still 185.6MB. Free memory was 121.2MB in the beginning and 118.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 467.25ms. Allocated memory is still 185.6MB. Free memory was 118.8MB in the beginning and 101.0MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 7900.85ms. Allocated memory was 185.6MB in the beginning and 370.1MB in the end (delta: 184.5MB). Free memory was 157.8MB in the beginning and 257.2MB in the end (delta: -99.5MB). Peak memory consumption was 85.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of bitwise operation at line 73, overapproximation of someBinaryArithmeticDOUBLEoperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed short int var_1_2 = -256; [L24] signed long int var_1_3 = 256; [L25] unsigned char var_1_4 = 0; [L26] double var_1_5 = 127.5; [L27] unsigned char var_1_6 = 0; [L28] double var_1_7 = 10000000000000.125; [L29] double var_1_8 = 1.25; [L30] double var_1_9 = 4.125; [L31] double var_1_10 = 25.7; [L32] signed long int var_1_11 = -2; [L33] double var_1_12 = 49.75; [L34] signed long int var_1_13 = 5; [L35] signed long int var_1_14 = 128; [L36] signed long int var_1_15 = 1000; [L37] double var_1_16 = 0.2; [L38] double var_1_17 = 0.25; [L39] double var_1_18 = 99999999999999.5; [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] FCALL updateLastVariables() [L135] CALL updateVariables() [L93] var_1_2 = __VERIFIER_nondet_short() [L94] CALL assume_abort_if_not(var_1_2 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L94] RET assume_abort_if_not(var_1_2 >= -32768) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L95] CALL assume_abort_if_not(var_1_2 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L95] RET assume_abort_if_not(var_1_2 <= 32767) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L96] var_1_3 = __VERIFIER_nondet_long() [L97] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L97] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L98] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L98] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L99] var_1_4 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L100] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L101] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L101] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L102] var_1_6 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L103] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L104] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L104] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L105] var_1_7 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4, var_1_9=33/8] [L106] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4, var_1_9=33/8] [L107] var_1_9 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L108] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L109] var_1_10 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L110] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L111] var_1_12 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L112] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L113] var_1_13 = __VERIFIER_nondet_long() [L114] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L114] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L115] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L115] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L116] var_1_14 = __VERIFIER_nondet_long() [L117] CALL assume_abort_if_not(var_1_14 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-5, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-5, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L117] RET assume_abort_if_not(var_1_14 >= -2147483647) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-5, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L118] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-5, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-5, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L118] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-5, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L119] var_1_17 = __VERIFIER_nondet_double() [L120] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-5, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-5, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L120] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-5, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L121] var_1_18 = __VERIFIER_nondet_double() [L122] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-5, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-5, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L122] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-5, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L135] RET updateVariables() [L136] CALL step() [L43] COND TRUE (var_1_2 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= var_1_3 [L44] var_1_1 = var_1_4 VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-5, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L46] COND TRUE \read(var_1_1) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-5, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L47] COND FALSE !(var_1_2 >= var_1_3) [L52] var_1_5 = var_1_7 VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-5, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=100000000000005, var_1_6=0, var_1_7=100000000000005, var_1_8=5/4] [L55] COND FALSE !(10.55f < var_1_5) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-5, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=100000000000005, var_1_6=0, var_1_7=100000000000005, var_1_8=5/4] [L60] COND TRUE var_1_5 > var_1_7 [L61] var_1_8 = var_1_10 VAL [isInitial=1, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-5, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=100000000000005, var_1_6=0, var_1_7=100000000000005, var_1_8=100000000000004] [L66] COND TRUE \read(var_1_1) VAL [isInitial=1, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-5, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=100000000000005, var_1_6=0, var_1_7=100000000000005, var_1_8=100000000000004] [L67] COND TRUE ((((var_1_9) > (49.75)) ? (var_1_9) : (49.75))) > var_1_12 [L68] var_1_11 = ((((var_1_2) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (var_1_2) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))) VAL [isInitial=1, var_1_10=100000000000004, var_1_11=-5, var_1_13=0, var_1_14=-5, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=100000000000005, var_1_6=0, var_1_7=100000000000005, var_1_8=100000000000004] [L73] EXPR var_1_3 & var_1_13 VAL [isInitial=1, var_1_10=100000000000004, var_1_11=-5, var_1_13=0, var_1_14=-5, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=100000000000005, var_1_6=0, var_1_7=100000000000005, var_1_8=100000000000004] [L73] COND FALSE !((- var_1_2) > (var_1_3 & var_1_13)) [L84] var_1_15 = var_1_13 VAL [isInitial=1, var_1_10=100000000000004, var_1_11=-5, var_1_13=0, var_1_14=-5, var_1_15=0, var_1_16=1/5, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=100000000000005, var_1_6=0, var_1_7=100000000000005, var_1_8=100000000000004] [L86] COND TRUE ((((var_1_12) < (var_1_5)) ? (var_1_12) : (var_1_5))) >= var_1_7 [L87] var_1_16 = (var_1_17 + (var_1_18 + 16.75)) VAL [isInitial=1, var_1_10=100000000000004, var_1_11=-5, var_1_13=0, var_1_14=-5, var_1_15=0, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=100000000000005, var_1_6=0, var_1_7=100000000000005, var_1_8=100000000000004] [L136] RET step() [L137] CALL, EXPR property() [L127] EXPR ((((((var_1_2 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= var_1_3) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_2 >= var_1_3) ? ((var_1_6 || (var_1_2 < var_1_3)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_5) ? ((var_1_5 > (var_1_7 * var_1_9)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_5 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (var_1_1 ? ((((((var_1_9) > (49.75)) ? (var_1_9) : (49.75))) > var_1_12) ? (var_1_11 == ((signed long int) ((((var_1_2) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (var_1_2) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) var_1_2)))) && (((- var_1_2) > (var_1_3 & var_1_13)) ? ((var_1_2 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13))) [L127] EXPR var_1_3 & var_1_13 [L127] EXPR ((((((var_1_2 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= var_1_3) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_2 >= var_1_3) ? ((var_1_6 || (var_1_2 < var_1_3)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_5) ? ((var_1_5 > (var_1_7 * var_1_9)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_5 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (var_1_1 ? ((((((var_1_9) > (49.75)) ? (var_1_9) : (49.75))) > var_1_12) ? (var_1_11 == ((signed long int) ((((var_1_2) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (var_1_2) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) var_1_2)))) && (((- var_1_2) > (var_1_3 & var_1_13)) ? ((var_1_2 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13))) VAL [isInitial=1, var_1_10=100000000000004, var_1_11=-5, var_1_13=0, var_1_14=-5, var_1_15=0, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=100000000000005, var_1_6=0, var_1_7=100000000000005, var_1_8=100000000000004] [L127-L128] return (((((((var_1_2 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= var_1_3) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_2 >= var_1_3) ? ((var_1_6 || (var_1_2 < var_1_3)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_5) ? ((var_1_5 > (var_1_7 * var_1_9)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_5 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (var_1_1 ? ((((((var_1_9) > (49.75)) ? (var_1_9) : (49.75))) > var_1_12) ? (var_1_11 == ((signed long int) ((((var_1_2) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (var_1_2) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) var_1_2)))) && (((- var_1_2) > (var_1_3 & var_1_13)) ? ((var_1_2 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13)))) && ((((((var_1_12) < (var_1_5)) ? (var_1_12) : (var_1_5))) >= var_1_7) ? (var_1_16 == ((double) (var_1_17 + (var_1_18 + 16.75)))) : (var_1_16 == ((double) var_1_17))) ; [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=100000000000004, var_1_11=-5, var_1_13=0, var_1_14=-5, var_1_15=0, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=100000000000005, var_1_6=0, var_1_7=100000000000005, var_1_8=100000000000004] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=100000000000004, var_1_11=-5, var_1_13=0, var_1_14=-5, var_1_15=0, var_1_1=1, var_1_2=-5, var_1_3=-4, var_1_4=1, var_1_5=100000000000005, var_1_6=0, var_1_7=100000000000005, var_1_8=100000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 373 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 364 mSDsluCounter, 635 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 418 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 722 IncrementalHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 217 mSDtfsCounter, 722 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 625 GetRequests, 583 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=2, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 36 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 704 NumberOfCodeBlocks, 704 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 812 ConstructedInterpolants, 0 QuantifiedInterpolants, 3954 SizeOfPredicates, 21 NumberOfNonLiveVariables, 547 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 4050/4284 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-16 02:38:47,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...