./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-46.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5098132933ca883ef364a77e95c51d3cf42bb9b570e45543a498fd4c246df361 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:56:02,476 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:56:02,544 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 08:56:02,550 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:56:02,552 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:56:02,600 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:56:02,601 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:56:02,601 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:56:02,602 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:56:02,602 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:56:02,602 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:56:02,603 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:56:02,603 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:56:02,604 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:56:02,604 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:56:02,604 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:56:02,605 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:56:02,605 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:56:02,605 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 08:56:02,606 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:56:02,606 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:56:02,610 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:56:02,610 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:56:02,610 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:56:02,610 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:56:02,611 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:56:02,611 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:56:02,611 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:56:02,612 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:56:02,612 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:56:02,612 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:56:02,612 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:56:02,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:56:02,613 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:56:02,613 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:56:02,613 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:56:02,613 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 08:56:02,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 08:56:02,614 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:56:02,614 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:56:02,614 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:56:02,615 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:56:02,616 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-clean/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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5098132933ca883ef364a77e95c51d3cf42bb9b570e45543a498fd4c246df361 [2024-10-11 08:56:02,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:56:02,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:56:02,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:56:02,876 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:56:02,876 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:56:02,878 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-46.i [2024-10-11 08:56:04,322 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:56:04,517 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:56:04,518 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-46.i [2024-10-11 08:56:04,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cf71eff28/6fb77d96dbb74ad3a273fe04c2524ff3/FLAG018374090 [2024-10-11 08:56:04,908 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cf71eff28/6fb77d96dbb74ad3a273fe04c2524ff3 [2024-10-11 08:56:04,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:56:04,912 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:56:04,913 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:56:04,913 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:56:04,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:56:04,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:56:04" (1/1) ... [2024-10-11 08:56:04,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43f82e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:04, skipping insertion in model container [2024-10-11 08:56:04,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:56:04" (1/1) ... [2024-10-11 08:56:04,954 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:56:05,129 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-46.i[919,932] [2024-10-11 08:56:05,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:56:05,216 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:56:05,228 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-46.i[919,932] [2024-10-11 08:56:05,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:56:05,280 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:56:05,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:05 WrapperNode [2024-10-11 08:56:05,282 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:56:05,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:56:05,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:56:05,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:56:05,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:05" (1/1) ... [2024-10-11 08:56:05,303 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:05" (1/1) ... [2024-10-11 08:56:05,356 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 221 [2024-10-11 08:56:05,357 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:56:05,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:56:05,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:56:05,358 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:56:05,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:05" (1/1) ... [2024-10-11 08:56:05,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:05" (1/1) ... [2024-10-11 08:56:05,379 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:05" (1/1) ... [2024-10-11 08:56:05,407 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]. [2024-10-11 08:56:05,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:05" (1/1) ... [2024-10-11 08:56:05,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:05" (1/1) ... [2024-10-11 08:56:05,422 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:05" (1/1) ... [2024-10-11 08:56:05,428 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:05" (1/1) ... [2024-10-11 08:56:05,431 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:05" (1/1) ... [2024-10-11 08:56:05,438 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:05" (1/1) ... [2024-10-11 08:56:05,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:56:05,451 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:56:05,451 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:56:05,451 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:56:05,452 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:05" (1/1) ... [2024-10-11 08:56:05,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:56:05,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:56:05,485 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:56:05,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:56:05,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:56:05,528 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:56:05,528 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:56:05,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 08:56:05,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:56:05,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:56:05,612 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:56:05,614 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:56:06,116 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-11 08:56:06,116 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:56:06,145 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:56:06,145 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:56:06,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:56:06 BoogieIcfgContainer [2024-10-11 08:56:06,146 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:56:06,148 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:56:06,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:56:06,151 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:56:06,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:56:04" (1/3) ... [2024-10-11 08:56:06,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35927245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:56:06, skipping insertion in model container [2024-10-11 08:56:06,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:05" (2/3) ... [2024-10-11 08:56:06,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35927245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:56:06, skipping insertion in model container [2024-10-11 08:56:06,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:56:06" (3/3) ... [2024-10-11 08:56:06,156 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-46.i [2024-10-11 08:56:06,172 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:56:06,173 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:56:06,281 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:56:06,290 INFO L333 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, 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;@68002867, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:56:06,291 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:56:06,296 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 61 states have internal predecessors, (91), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 08:56:06,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 08:56:06,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:56:06,316 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:56:06,317 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:56:06,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:56:06,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1613772996, now seen corresponding path program 1 times [2024-10-11 08:56:06,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:56:06,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601663525] [2024-10-11 08:56:06,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:56:06,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:56:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:06,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:56:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:06,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:56:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:06,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:56:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:06,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:56:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:06,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:56:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:06,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:56:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:06,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:56:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:06,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:56:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:06,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:56:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:06,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:56:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:06,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:56:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:06,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:56:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:06,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:56:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:06,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:56:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:06,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:56:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:06,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:56:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:06,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:56:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:06,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:56:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:06,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:56:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:06,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:56:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:06,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:56:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:06,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:56:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:06,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:56:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 08:56:06,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:56:06,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601663525] [2024-10-11 08:56:06,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601663525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:56:06,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:56:06,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:56:06,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793243565] [2024-10-11 08:56:06,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:56:06,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:56:06,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:56:06,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:56:06,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:56:06,856 INFO L87 Difference]: Start difference. First operand has 86 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 61 states have internal predecessors, (91), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 08:56:06,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:56:06,906 INFO L93 Difference]: Finished difference Result 169 states and 295 transitions. [2024-10-11 08:56:06,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:56:06,910 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2024-10-11 08:56:06,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:56:06,918 INFO L225 Difference]: With dead ends: 169 [2024-10-11 08:56:06,918 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 08:56:06,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:56:06,926 INFO L432 NwaCegarLoop]: 128 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, 128 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 [2024-10-11 08:56:06,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:56:06,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 08:56:06,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-11 08:56:06,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 59 states have internal predecessors, (85), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 08:56:06,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 131 transitions. [2024-10-11 08:56:06,984 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 131 transitions. Word has length 150 [2024-10-11 08:56:06,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:56:06,985 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 131 transitions. [2024-10-11 08:56:06,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 08:56:06,986 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 131 transitions. [2024-10-11 08:56:06,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 08:56:06,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:56:06,991 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:56:06,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 08:56:06,993 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:56:06,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:56:06,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1902181267, now seen corresponding path program 1 times [2024-10-11 08:56:06,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:56:06,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203658498] [2024-10-11 08:56:06,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:56:06,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:56:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:07,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:56:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:07,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:56:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:07,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:56:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:07,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:56:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:07,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:56:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:07,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:56:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:07,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:56:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:07,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:56:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:07,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:56:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:07,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:56:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:07,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:56:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:07,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:56:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:07,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:56:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:07,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:56:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:07,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:56:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:07,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:56:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:07,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:56:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:07,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:56:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:07,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:56:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:07,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:56:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:07,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:56:07,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:07,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:56:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:07,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:56:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:07,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 08:56:07,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:56:07,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203658498] [2024-10-11 08:56:07,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203658498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:56:07,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:56:07,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:56:07,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571118934] [2024-10-11 08:56:07,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:56:07,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:56:07,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:56:07,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:56:07,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:56:07,811 INFO L87 Difference]: Start difference. First operand 84 states and 131 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 08:56:07,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:56:07,925 INFO L93 Difference]: Finished difference Result 213 states and 330 transitions. [2024-10-11 08:56:07,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:56:07,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 151 [2024-10-11 08:56:07,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:56:07,929 INFO L225 Difference]: With dead ends: 213 [2024-10-11 08:56:07,929 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 08:56:07,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:56:07,932 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 55 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:56:07,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 368 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:56:07,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 08:56:07,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2024-10-11 08:56:07,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 99 states have (on average 1.4747474747474747) internal successors, (146), 100 states have internal predecessors, (146), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 08:56:07,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 196 transitions. [2024-10-11 08:56:07,957 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 196 transitions. Word has length 151 [2024-10-11 08:56:07,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:56:07,958 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 196 transitions. [2024-10-11 08:56:07,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 08:56:07,958 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 196 transitions. [2024-10-11 08:56:07,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 08:56:07,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:56:07,961 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:56:07,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 08:56:07,961 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:56:07,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:56:07,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1131914093, now seen corresponding path program 1 times [2024-10-11 08:56:07,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:56:07,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21001486] [2024-10-11 08:56:07,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:56:07,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:56:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:34,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:56:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:34,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:56:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:34,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:56:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:34,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:56:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:34,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:56:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:34,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:56:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:34,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:56:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:34,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:56:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:34,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:56:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:34,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:56:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:34,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:56:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:34,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:56:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:34,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:56:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:34,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:56:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:34,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:56:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:34,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:56:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:34,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:56:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:34,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:56:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:34,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:56:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:34,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:56:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:34,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:56:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:34,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:56:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:34,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:56:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:34,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 08:56:34,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:56:34,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21001486] [2024-10-11 08:56:34,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21001486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:56:34,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:56:34,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 08:56:34,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928472526] [2024-10-11 08:56:34,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:56:34,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 08:56:34,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:56:34,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 08:56:34,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:56:34,359 INFO L87 Difference]: Start difference. First operand 127 states and 196 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 08:56:39,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:56:39,481 INFO L93 Difference]: Finished difference Result 498 states and 764 transitions. [2024-10-11 08:56:39,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 08:56:39,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 151 [2024-10-11 08:56:39,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:56:39,490 INFO L225 Difference]: With dead ends: 498 [2024-10-11 08:56:39,493 INFO L226 Difference]: Without dead ends: 372 [2024-10-11 08:56:39,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-11 08:56:39,495 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 401 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-11 08:56:39,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 378 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-11 08:56:39,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-10-11 08:56:39,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 280. [2024-10-11 08:56:39,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 239 states have (on average 1.5188284518828452) internal successors, (363), 242 states have internal predecessors, (363), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 08:56:39,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 433 transitions. [2024-10-11 08:56:39,535 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 433 transitions. Word has length 151 [2024-10-11 08:56:39,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:56:39,536 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 433 transitions. [2024-10-11 08:56:39,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 08:56:39,537 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 433 transitions. [2024-10-11 08:56:39,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 08:56:39,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:56:39,540 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:56:39,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 08:56:39,541 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:56:39,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:56:39,541 INFO L85 PathProgramCache]: Analyzing trace with hash -709212267, now seen corresponding path program 1 times [2024-10-11 08:56:39,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:56:39,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191177030] [2024-10-11 08:56:39,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:56:39,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:56:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:39,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:56:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:39,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:56:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:39,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:56:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:39,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:56:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:39,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:56:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:39,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:56:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:39,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:56:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:39,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:56:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:39,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:56:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:39,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:56:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:39,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:56:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:39,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:56:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:39,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:56:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:39,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:56:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:39,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:56:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:39,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:56:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:39,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:56:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:39,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:56:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:39,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:56:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:39,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:56:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:40,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:56:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:40,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:56:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:40,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:56:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:40,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-11 08:56:40,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:56:40,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191177030] [2024-10-11 08:56:40,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191177030] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:56:40,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118750517] [2024-10-11 08:56:40,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:56:40,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:56:40,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:56:40,023 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:56:40,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 08:56:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:56:40,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 08:56:40,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:56:40,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 602 proven. 66 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2024-10-11 08:56:40,596 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:56:40,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 60 proven. 69 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2024-10-11 08:56:40,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118750517] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:56:40,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 08:56:40,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2024-10-11 08:56:40,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123659483] [2024-10-11 08:56:40,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 08:56:40,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 08:56:40,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:56:40,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 08:56:40,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 08:56:40,955 INFO L87 Difference]: Start difference. First operand 280 states and 433 transitions. Second operand has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 7 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 7 states have call predecessors, (65), 7 states have call successors, (65) [2024-10-11 08:56:41,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:56:41,918 INFO L93 Difference]: Finished difference Result 727 states and 1097 transitions. [2024-10-11 08:56:41,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-11 08:56:41,919 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 7 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 7 states have call predecessors, (65), 7 states have call successors, (65) Word has length 151 [2024-10-11 08:56:41,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:56:41,927 INFO L225 Difference]: With dead ends: 727 [2024-10-11 08:56:41,927 INFO L226 Difference]: Without dead ends: 448 [2024-10-11 08:56:41,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=368, Invalid=892, Unknown=0, NotChecked=0, Total=1260 [2024-10-11 08:56:41,932 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 508 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 08:56:41,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 405 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 08:56:41,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-10-11 08:56:41,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 292. [2024-10-11 08:56:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 248 states have (on average 1.4758064516129032) internal successors, (366), 251 states have internal predecessors, (366), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 08:56:41,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 436 transitions. [2024-10-11 08:56:41,991 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 436 transitions. Word has length 151 [2024-10-11 08:56:41,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:56:41,992 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 436 transitions. [2024-10-11 08:56:41,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 7 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 7 states have call predecessors, (65), 7 states have call successors, (65) [2024-10-11 08:56:41,992 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 436 transitions. [2024-10-11 08:56:41,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 08:56:41,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:56:41,995 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:56:42,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 08:56:42,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:56:42,196 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:56:42,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:56:42,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1389270637, now seen corresponding path program 1 times [2024-10-11 08:56:42,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:56:42,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691589372] [2024-10-11 08:56:42,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:56:42,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:56:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:56:42,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1851922582] [2024-10-11 08:56:42,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:56:42,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:56:42,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:56:42,273 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:56:42,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 08:56:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:56:42,730 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 08:56:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:56:42,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 08:56:42,866 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 08:56:42,867 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 08:56:42,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 08:56:43,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:56:43,072 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 08:56:43,181 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 08:56:43,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:56:43 BoogieIcfgContainer [2024-10-11 08:56:43,184 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 08:56:43,185 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 08:56:43,185 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 08:56:43,185 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 08:56:43,185 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:56:06" (3/4) ... [2024-10-11 08:56:43,187 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 08:56:43,188 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 08:56:43,189 INFO L158 Benchmark]: Toolchain (without parser) took 38277.05ms. Allocated memory was 178.3MB in the beginning and 648.0MB in the end (delta: 469.8MB). Free memory was 149.2MB in the beginning and 245.4MB in the end (delta: -96.3MB). Peak memory consumption was 372.7MB. Max. memory is 16.1GB. [2024-10-11 08:56:43,189 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 134.2MB. Free memory was 97.7MB in the beginning and 97.7MB in the end (delta: 19.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:56:43,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.74ms. Allocated memory is still 178.3MB. Free memory was 148.9MB in the beginning and 135.0MB in the end (delta: 13.9MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-10-11 08:56:43,190 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.74ms. Allocated memory is still 178.3MB. Free memory was 135.0MB in the beginning and 129.5MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 08:56:43,190 INFO L158 Benchmark]: Boogie Preprocessor took 91.30ms. Allocated memory is still 178.3MB. Free memory was 129.5MB in the beginning and 122.4MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 08:56:43,191 INFO L158 Benchmark]: RCFGBuilder took 695.28ms. Allocated memory is still 178.3MB. Free memory was 122.4MB in the beginning and 86.8MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-11 08:56:43,191 INFO L158 Benchmark]: TraceAbstraction took 37036.25ms. Allocated memory was 178.3MB in the beginning and 648.0MB in the end (delta: 469.8MB). Free memory was 86.3MB in the beginning and 246.5MB in the end (delta: -160.2MB). Peak memory consumption was 309.5MB. Max. memory is 16.1GB. [2024-10-11 08:56:43,191 INFO L158 Benchmark]: Witness Printer took 3.81ms. Allocated memory is still 648.0MB. Free memory was 246.5MB in the beginning and 245.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 08:56:43,193 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.17ms. Allocated memory is still 134.2MB. Free memory was 97.7MB in the beginning and 97.7MB in the end (delta: 19.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.74ms. Allocated memory is still 178.3MB. Free memory was 148.9MB in the beginning and 135.0MB in the end (delta: 13.9MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.74ms. Allocated memory is still 178.3MB. Free memory was 135.0MB in the beginning and 129.5MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.30ms. Allocated memory is still 178.3MB. Free memory was 129.5MB in the beginning and 122.4MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 695.28ms. Allocated memory is still 178.3MB. Free memory was 122.4MB in the beginning and 86.8MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 37036.25ms. Allocated memory was 178.3MB in the beginning and 648.0MB in the end (delta: 469.8MB). Free memory was 86.3MB in the beginning and 246.5MB in the end (delta: -160.2MB). Peak memory consumption was 309.5MB. Max. memory is 16.1GB. * Witness Printer took 3.81ms. Allocated memory is still 648.0MB. Free memory was 246.5MB in the beginning and 245.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * 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 someBinaryFLOATComparisonOperation at line 150, overapproximation of someBinaryDOUBLEComparisonOperation at line 171. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 16; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 128; [L26] unsigned char var_1_5 = 10; [L27] unsigned short int var_1_6 = 10; [L28] unsigned short int var_1_7 = 52077; [L29] unsigned short int var_1_8 = 47248; [L30] unsigned short int var_1_9 = 50; [L31] float var_1_11 = 63.75; [L32] signed long int var_1_12 = 100000; [L33] unsigned short int var_1_13 = 8; [L34] signed long int var_1_14 = 2; [L35] signed long int var_1_15 = 32; [L36] double var_1_17 = 127.5; [L37] double var_1_18 = 32.75; [L38] signed char var_1_19 = 0; [L39] unsigned long int var_1_20 = 128; [L40] unsigned long int var_1_21 = 32; [L41] unsigned char var_1_23 = 0; [L42] unsigned char var_1_25 = 0; [L43] unsigned char var_1_26 = 1; [L44] unsigned char var_1_27 = 16; [L45] signed long int var_1_29 = 5; [L46] unsigned char var_1_31 = 128; [L47] signed char var_1_33 = 50; [L48] unsigned short int last_1_var_1_13 = 8; [L49] double last_1_var_1_17 = 127.5; [L175] isInitial = 1 [L176] FCALL initially() [L177] COND TRUE 1 [L178] CALL updateLastVariables() [L167] last_1_var_1_13 = var_1_13 [L168] last_1_var_1_17 = var_1_17 [L178] RET updateLastVariables() [L179] CALL updateVariables() [L130] var_1_2 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L131] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L132] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L132] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L133] var_1_3 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L134] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L135] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L135] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L136] var_1_4 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_4 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L137] RET assume_abort_if_not(var_1_4 >= 127) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L138] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L138] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L139] var_1_5 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L140] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L141] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L141] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L142] var_1_7 = __VERIFIER_nondet_ushort() [L143] CALL assume_abort_if_not(var_1_7 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=47248, var_1_9=50] [L143] RET assume_abort_if_not(var_1_7 >= 32767) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=47248, var_1_9=50] [L144] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=47248, var_1_9=50] [L144] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=47248, var_1_9=50] [L145] var_1_8 = __VERIFIER_nondet_ushort() [L146] CALL assume_abort_if_not(var_1_8 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L146] RET assume_abort_if_not(var_1_8 >= 32767) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L147] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L147] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L148] var_1_11 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L149] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L150] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L150] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L151] var_1_14 = __VERIFIER_nondet_long() [L152] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L152] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L153] CALL assume_abort_if_not(var_1_14 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L153] RET assume_abort_if_not(var_1_14 <= 32) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L154] var_1_15 = __VERIFIER_nondet_long() [L155] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L155] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L156] CALL assume_abort_if_not(var_1_15 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L156] RET assume_abort_if_not(var_1_15 <= 32) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L157] var_1_18 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L158] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L159] var_1_25 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L160] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L161] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L161] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L162] var_1_26 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_26 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L163] RET assume_abort_if_not(var_1_26 >= 1) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L164] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L164] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L179] RET updateVariables() [L180] CALL step() [L53] COND FALSE !(-100000 >= last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L56] COND FALSE !((last_1_var_1_17 / var_1_11) == 999999.6f) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L60] unsigned char stepLocal_0 = var_1_3; VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, stepLocal_0=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L61] COND TRUE var_1_2 && stepLocal_0 [L62] var_1_1 = (var_1_4 - var_1_5) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L66] COND FALSE !(var_1_1 <= (var_1_5 * var_1_4)) [L73] var_1_6 = var_1_5 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L75] var_1_17 = var_1_18 [L76] var_1_19 = 5 [L77] var_1_20 = var_1_15 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L78] COND FALSE !(var_1_1 < var_1_20) [L85] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L87] EXPR -4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L87] EXPR var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L87] COND FALSE !((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) [L94] var_1_13 = var_1_1 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L96] var_1_21 = ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=254, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L97] COND FALSE !(var_1_15 > var_1_9) [L102] var_1_23 = (! var_1_26) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=254, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L104] var_1_27 = var_1_5 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=254, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L105] COND TRUE var_1_15 != (var_1_4 + var_1_4) [L106] var_1_29 = ((((var_1_4) > (((((((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))) < (var_1_6)) ? (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))) : (var_1_6))))) ? (var_1_4) : (((((((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))) < (var_1_6)) ? (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))) : (var_1_6)))))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=254, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=254, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L110] COND FALSE !((-25 + (var_1_7 + var_1_1)) <= var_1_5) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=254, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=254, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L117] COND TRUE var_1_3 || (var_1_25 && var_1_2) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=254, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=254, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L118] COND TRUE var_1_6 >= var_1_14 [L119] var_1_33 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=254, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=254, var_1_2=1, var_1_31=128, var_1_33=0, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L180] RET step() [L181] CALL, EXPR property() [L171] EXPR (((((var_1_2 && var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (var_1_4 - var_1_5)))) && ((var_1_1 <= (var_1_5 * var_1_4)) ? (var_1_2 ? (var_1_6 == ((unsigned short int) (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5)))) && ((-100000 >= last_1_var_1_13) ? (var_1_9 == ((unsigned short int) (((((last_1_var_1_13 + var_1_5)) > (64)) ? ((last_1_var_1_13 + var_1_5)) : (64))))) : (((last_1_var_1_17 / var_1_11) == 999999.6f) ? (var_1_9 == ((unsigned short int) var_1_7)) : 1))) && ((var_1_1 < var_1_20) ? ((var_1_5 == (~ (var_1_1 + var_1_20))) ? (var_1_12 == ((signed long int) (((((var_1_5) > (((((-1) < (var_1_1)) ? (-1) : (var_1_1))))) ? (var_1_5) : (((((-1) < (var_1_1)) ? (-1) : (var_1_1)))))) - 1000))) : (var_1_12 == ((signed long int) ((((var_1_20) < (var_1_8)) ? (var_1_20) : (var_1_8)))))) : (var_1_12 == ((signed long int) var_1_6)))) && (((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) ? (var_1_3 ? (var_1_13 == ((unsigned short int) var_1_6)) : (var_1_13 == ((unsigned short int) var_1_4))) : (var_1_13 == ((unsigned short int) var_1_1))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=254, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=254, var_1_2=1, var_1_31=128, var_1_33=0, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L171-L172] return ((((((((var_1_2 && var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (var_1_4 - var_1_5)))) && ((var_1_1 <= (var_1_5 * var_1_4)) ? (var_1_2 ? (var_1_6 == ((unsigned short int) (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5)))) && ((-100000 >= last_1_var_1_13) ? (var_1_9 == ((unsigned short int) (((((last_1_var_1_13 + var_1_5)) > (64)) ? ((last_1_var_1_13 + var_1_5)) : (64))))) : (((last_1_var_1_17 / var_1_11) == 999999.6f) ? (var_1_9 == ((unsigned short int) var_1_7)) : 1))) && ((var_1_1 < var_1_20) ? ((var_1_5 == (~ (var_1_1 + var_1_20))) ? (var_1_12 == ((signed long int) (((((var_1_5) > (((((-1) < (var_1_1)) ? (-1) : (var_1_1))))) ? (var_1_5) : (((((-1) < (var_1_1)) ? (-1) : (var_1_1)))))) - 1000))) : (var_1_12 == ((signed long int) ((((var_1_20) < (var_1_8)) ? (var_1_20) : (var_1_8)))))) : (var_1_12 == ((signed long int) var_1_6)))) && (((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) ? (var_1_3 ? (var_1_13 == ((unsigned short int) var_1_6)) : (var_1_13 == ((unsigned short int) var_1_4))) : (var_1_13 == ((unsigned short int) var_1_1)))) && (var_1_17 == ((double) var_1_18))) && (var_1_19 == ((signed char) 5))) && (var_1_20 == ((unsigned long int) var_1_15)) ; [L181] RET, EXPR property() [L181] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=254, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=254, var_1_2=1, var_1_31=128, var_1_33=0, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=254, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=254, var_1_2=1, var_1_31=128, var_1_33=0, var_1_3=1, var_1_4=510, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.8s, OverallIterations: 5, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 969 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 964 mSDsluCounter, 1279 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 803 mSDsCounter, 201 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 885 IncrementalHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 201 mSolverCounterUnsat, 476 mSDtfsCounter, 885 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 555 GetRequests, 512 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=292occurred in iteration=4, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 251 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 28.5s InterpolantComputationTime, 1056 NumberOfCodeBlocks, 1056 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 899 ConstructedInterpolants, 0 QuantifiedInterpolants, 8812 SizeOfPredicates, 3 NumberOfNonLiveVariables, 359 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 5883/6072 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 [2024-10-11 08:56:43,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-46.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5098132933ca883ef364a77e95c51d3cf42bb9b570e45543a498fd4c246df361 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:56:45,341 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:56:45,426 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 08:56:45,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:56:45,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:56:45,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:56:45,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:56:45,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:56:45,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:56:45,466 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:56:45,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:56:45,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:56:45,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:56:45,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:56:45,469 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:56:45,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:56:45,470 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:56:45,470 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:56:45,471 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:56:45,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:56:45,471 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:56:45,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:56:45,475 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:56:45,475 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 08:56:45,476 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 08:56:45,476 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:56:45,476 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 08:56:45,476 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:56:45,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:56:45,477 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:56:45,477 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:56:45,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:56:45,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:56:45,478 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:56:45,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:56:45,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:56:45,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:56:45,480 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:56:45,480 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 08:56:45,481 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 08:56:45,481 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:56:45,481 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:56:45,482 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:56:45,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:56:45,482 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 08:56:45,483 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-clean/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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5098132933ca883ef364a77e95c51d3cf42bb9b570e45543a498fd4c246df361 [2024-10-11 08:56:45,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:56:45,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:56:45,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:56:45,848 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:56:45,848 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:56:45,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-46.i [2024-10-11 08:56:47,436 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:56:47,664 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:56:47,665 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-46.i [2024-10-11 08:56:47,678 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bf57681d2/3859bdb99b964f1b9797917b7320b3a1/FLAG2b2d11660 [2024-10-11 08:56:47,689 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bf57681d2/3859bdb99b964f1b9797917b7320b3a1 [2024-10-11 08:56:47,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:56:47,692 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:56:47,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:56:47,694 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:56:47,699 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:56:47,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:56:47" (1/1) ... [2024-10-11 08:56:47,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10f34545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:47, skipping insertion in model container [2024-10-11 08:56:47,700 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:56:47" (1/1) ... [2024-10-11 08:56:47,733 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:56:47,915 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-46.i[919,932] [2024-10-11 08:56:47,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:56:48,016 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:56:48,031 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-46.i[919,932] [2024-10-11 08:56:48,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:56:48,096 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:56:48,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:48 WrapperNode [2024-10-11 08:56:48,097 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:56:48,098 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:56:48,098 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:56:48,098 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:56:48,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:48" (1/1) ... [2024-10-11 08:56:48,124 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:48" (1/1) ... [2024-10-11 08:56:48,159 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2024-10-11 08:56:48,162 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:56:48,163 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:56:48,163 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:56:48,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:56:48,176 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:48" (1/1) ... [2024-10-11 08:56:48,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:48" (1/1) ... [2024-10-11 08:56:48,181 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:48" (1/1) ... [2024-10-11 08:56:48,202 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]. [2024-10-11 08:56:48,203 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:48" (1/1) ... [2024-10-11 08:56:48,203 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:48" (1/1) ... [2024-10-11 08:56:48,210 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:48" (1/1) ... [2024-10-11 08:56:48,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:48" (1/1) ... [2024-10-11 08:56:48,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:48" (1/1) ... [2024-10-11 08:56:48,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:48" (1/1) ... [2024-10-11 08:56:48,231 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:56:48,232 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:56:48,235 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:56:48,236 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:56:48,236 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:48" (1/1) ... [2024-10-11 08:56:48,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:56:48,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:56:48,268 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:56:48,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:56:48,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:56:48,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 08:56:48,318 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:56:48,319 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:56:48,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:56:48,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:56:48,411 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:56:48,414 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:57:01,575 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 08:57:01,576 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:57:01,641 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:57:01,642 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:57:01,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:57:01 BoogieIcfgContainer [2024-10-11 08:57:01,646 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:57:01,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:57:01,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:57:01,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:57:01,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:56:47" (1/3) ... [2024-10-11 08:57:01,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4676b28f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:57:01, skipping insertion in model container [2024-10-11 08:57:01,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:56:48" (2/3) ... [2024-10-11 08:57:01,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4676b28f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:57:01, skipping insertion in model container [2024-10-11 08:57:01,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:57:01" (3/3) ... [2024-10-11 08:57:01,655 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-46.i [2024-10-11 08:57:01,671 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:57:01,672 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:57:01,739 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:57:01,745 INFO L333 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, 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;@72359525, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:57:01,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:57:01,751 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 44 states have internal predecessors, (65), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 08:57:01,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-11 08:57:01,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:57:01,767 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:57:01,769 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:57:01,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:57:01,775 INFO L85 PathProgramCache]: Analyzing trace with hash -98597261, now seen corresponding path program 1 times [2024-10-11 08:57:01,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:57:01,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621382654] [2024-10-11 08:57:01,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:57:01,787 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:57:01,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:57:01,791 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:57:01,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 08:57:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:57:02,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 08:57:02,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:57:02,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2024-10-11 08:57:02,583 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:57:02,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:57:02,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621382654] [2024-10-11 08:57:02,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621382654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:57:02,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:57:02,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:57:02,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261127259] [2024-10-11 08:57:02,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:57:02,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:57:02,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:57:02,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:57:02,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:57:02,627 INFO L87 Difference]: Start difference. First operand has 69 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 44 states have internal predecessors, (65), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 08:57:06,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:57:06,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:57:06,919 INFO L93 Difference]: Finished difference Result 134 states and 241 transitions. [2024-10-11 08:57:06,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:57:06,989 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 146 [2024-10-11 08:57:06,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:57:06,995 INFO L225 Difference]: With dead ends: 134 [2024-10-11 08:57:06,996 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 08:57:06,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:57:07,001 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-11 08:57:07,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 08:57:07,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 08:57:07,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-11 08:57:07,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 41 states have internal predecessors, (56), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 08:57:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2024-10-11 08:57:07,045 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 146 [2024-10-11 08:57:07,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:57:07,046 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2024-10-11 08:57:07,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 08:57:07,047 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2024-10-11 08:57:07,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 08:57:07,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:57:07,050 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:57:07,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 08:57:07,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:57:07,251 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:57:07,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:57:07,252 INFO L85 PathProgramCache]: Analyzing trace with hash -65537214, now seen corresponding path program 1 times [2024-10-11 08:57:07,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:57:07,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952354167] [2024-10-11 08:57:07,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:57:07,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:57:07,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:57:07,256 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:57:07,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 08:57:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:57:08,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 08:57:08,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:57:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 256 proven. 57 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2024-10-11 08:57:11,495 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:57:13,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 08:57:13,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:57:13,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952354167] [2024-10-11 08:57:13,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952354167] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 08:57:13,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 08:57:13,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-11 08:57:13,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541314620] [2024-10-11 08:57:13,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:57:13,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:57:13,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:57:13,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:57:13,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 08:57:13,099 INFO L87 Difference]: Start difference. First operand 66 states and 102 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 08:57:17,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:57:19,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:57:19,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:57:19,773 INFO L93 Difference]: Finished difference Result 159 states and 243 transitions. [2024-10-11 08:57:19,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:57:19,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 147 [2024-10-11 08:57:19,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:57:19,776 INFO L225 Difference]: With dead ends: 159 [2024-10-11 08:57:19,776 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 08:57:19,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 08:57:19,779 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 29 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-10-11 08:57:19,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 285 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2024-10-11 08:57:19,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 08:57:19,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2024-10-11 08:57:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 64 states have internal predecessors, (89), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 08:57:19,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 139 transitions. [2024-10-11 08:57:19,804 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 139 transitions. Word has length 147 [2024-10-11 08:57:19,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:57:19,805 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 139 transitions. [2024-10-11 08:57:19,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 08:57:19,808 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 139 transitions. [2024-10-11 08:57:19,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 08:57:19,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:57:19,811 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:57:19,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 08:57:20,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:57:20,012 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:57:20,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:57:20,014 INFO L85 PathProgramCache]: Analyzing trace with hash -73163710, now seen corresponding path program 1 times [2024-10-11 08:57:20,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:57:20,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1395952099] [2024-10-11 08:57:20,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:57:20,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:57:20,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:57:20,019 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:57:20,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process