./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-ps-ci_file-94.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-ps-ci_file-94.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 2fbe3d649f1d95336e9444f5c0690a9489945b39910476a2f8bbd47796cd371b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:07:46,331 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:07:46,411 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:07:46,415 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:07:46,416 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:07:46,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:07:46,437 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:07:46,437 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:07:46,438 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:07:46,439 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:07:46,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:07:46,440 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:07:46,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:07:46,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:07:46,444 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:07:46,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:07:46,445 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:07:46,445 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:07:46,445 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:07:46,445 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:07:46,445 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:07:46,446 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:07:46,446 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:07:46,446 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:07:46,446 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:07:46,446 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:07:46,447 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:07:46,447 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:07:46,447 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:07:46,447 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:07:46,447 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:07:46,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:07:46,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:07:46,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:07:46,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:07:46,448 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:07:46,450 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:07:46,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:07:46,451 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:07:46,451 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:07:46,451 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:07:46,451 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:07:46,451 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 -> 2fbe3d649f1d95336e9444f5c0690a9489945b39910476a2f8bbd47796cd371b [2024-10-11 10:07:46,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:07:46,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:07:46,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:07:46,734 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:07:46,735 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:07:46,736 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-94.i [2024-10-11 10:07:48,204 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:07:48,438 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:07:48,440 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-94.i [2024-10-11 10:07:48,454 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/39c763732/17690ca529ae4e92b42db6f4b7d9e981/FLAG40d2603e0 [2024-10-11 10:07:48,784 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/39c763732/17690ca529ae4e92b42db6f4b7d9e981 [2024-10-11 10:07:48,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:07:48,789 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:07:48,790 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:07:48,790 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:07:48,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:07:48,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:07:48" (1/1) ... [2024-10-11 10:07:48,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eae0ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:07:48, skipping insertion in model container [2024-10-11 10:07:48,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:07:48" (1/1) ... [2024-10-11 10:07:48,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:07:49,009 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-ps-ci_file-94.i[919,932] [2024-10-11 10:07:49,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:07:49,180 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:07:49,195 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-ps-ci_file-94.i[919,932] [2024-10-11 10:07:49,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:07:49,281 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:07:49,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:07:49 WrapperNode [2024-10-11 10:07:49,282 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:07:49,283 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:07:49,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:07:49,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:07:49,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:07:49" (1/1) ... [2024-10-11 10:07:49,308 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:07:49" (1/1) ... [2024-10-11 10:07:49,367 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-10-11 10:07:49,367 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:07:49,368 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:07:49,368 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:07:49,368 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:07:49,382 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:07:49" (1/1) ... [2024-10-11 10:07:49,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:07:49" (1/1) ... [2024-10-11 10:07:49,386 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:07:49" (1/1) ... [2024-10-11 10:07:49,421 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 10:07:49,421 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:07:49" (1/1) ... [2024-10-11 10:07:49,421 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:07:49" (1/1) ... [2024-10-11 10:07:49,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:07:49" (1/1) ... [2024-10-11 10:07:49,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:07:49" (1/1) ... [2024-10-11 10:07:49,454 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:07:49" (1/1) ... [2024-10-11 10:07:49,456 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:07:49" (1/1) ... [2024-10-11 10:07:49,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:07:49,463 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:07:49,464 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:07:49,465 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:07:49,466 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:07:49" (1/1) ... [2024-10-11 10:07:49,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:07:49,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:07:49,499 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 10:07:49,502 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 10:07:49,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:07:49,551 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:07:49,552 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:07:49,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:07:49,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:07:49,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:07:49,650 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:07:49,652 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:07:50,057 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 10:07:50,058 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:07:50,120 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:07:50,120 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:07:50,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:07:50 BoogieIcfgContainer [2024-10-11 10:07:50,121 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:07:50,124 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:07:50,126 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:07:50,130 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:07:50,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:07:48" (1/3) ... [2024-10-11 10:07:50,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@349a583e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:07:50, skipping insertion in model container [2024-10-11 10:07:50,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:07:49" (2/3) ... [2024-10-11 10:07:50,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@349a583e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:07:50, skipping insertion in model container [2024-10-11 10:07:50,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:07:50" (3/3) ... [2024-10-11 10:07:50,134 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-94.i [2024-10-11 10:07:50,152 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:07:50,153 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:07:50,230 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:07:50,237 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;@411dbd3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:07:50,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:07:50,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 10:07:50,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-11 10:07:50,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:07:50,263 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:07:50,263 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:07:50,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:07:50,271 INFO L85 PathProgramCache]: Analyzing trace with hash 692332556, now seen corresponding path program 1 times [2024-10-11 10:07:50,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:07:50,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047322039] [2024-10-11 10:07:50,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:07:50,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:07:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:07:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:07:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 10:07:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:07:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 10:07:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:07:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:07:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:07:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:07:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:07:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:07:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:07:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:07:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:07:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:07:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:07:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:07:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:07:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:07:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:07:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:07:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:07:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:07:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:07:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:07:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:07:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 10:07:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:07:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 10:07:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:50,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 10:07:50,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:07:50,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047322039] [2024-10-11 10:07:50,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047322039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:07:50,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:07:50,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:07:50,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406374363] [2024-10-11 10:07:50,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:07:50,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:07:50,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:07:50,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:07:50,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:07:50,982 INFO L87 Difference]: Start difference. First operand has 85 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 10:07:51,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:07:51,051 INFO L93 Difference]: Finished difference Result 167 states and 299 transitions. [2024-10-11 10:07:51,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:07:51,057 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 183 [2024-10-11 10:07:51,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:07:51,067 INFO L225 Difference]: With dead ends: 167 [2024-10-11 10:07:51,068 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 10:07:51,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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 10:07:51,080 INFO L432 NwaCegarLoop]: 127 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, 127 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 10:07:51,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:07:51,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 10:07:51,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-11 10:07:51,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 52 states have internal predecessors, (72), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 10:07:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 130 transitions. [2024-10-11 10:07:51,141 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 130 transitions. Word has length 183 [2024-10-11 10:07:51,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:07:51,141 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 130 transitions. [2024-10-11 10:07:51,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 10:07:51,142 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 130 transitions. [2024-10-11 10:07:51,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-11 10:07:51,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:07:51,149 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:07:51,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:07:51,151 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:07:51,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:07:51,152 INFO L85 PathProgramCache]: Analyzing trace with hash -344366630, now seen corresponding path program 1 times [2024-10-11 10:07:51,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:07:51,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427295896] [2024-10-11 10:07:51,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:07:51,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:07:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:07:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:07:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 10:07:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:07:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 10:07:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:07:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:07:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:07:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:07:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:07:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:07:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:07:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:07:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:07:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:07:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:07:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:07:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:07:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:07:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:07:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:07:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:07:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:07:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:07:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:07:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:07:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 10:07:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:07:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 10:07:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:51,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 10:07:51,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:07:51,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427295896] [2024-10-11 10:07:51,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427295896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:07:51,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:07:51,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:07:51,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096998114] [2024-10-11 10:07:51,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:07:51,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:07:51,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:07:51,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:07:51,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:07:51,899 INFO L87 Difference]: Start difference. First operand 83 states and 130 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 10:07:51,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:07:51,983 INFO L93 Difference]: Finished difference Result 247 states and 388 transitions. [2024-10-11 10:07:51,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:07:51,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 183 [2024-10-11 10:07:51,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:07:51,988 INFO L225 Difference]: With dead ends: 247 [2024-10-11 10:07:51,988 INFO L226 Difference]: Without dead ends: 165 [2024-10-11 10:07:51,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:07:51,990 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 67 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:07:51,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 254 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:07:51,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-11 10:07:52,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2024-10-11 10:07:52,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 101 states have (on average 1.3663366336633664) internal successors, (138), 101 states have internal predecessors, (138), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 10:07:52,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 254 transitions. [2024-10-11 10:07:52,040 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 254 transitions. Word has length 183 [2024-10-11 10:07:52,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:07:52,041 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 254 transitions. [2024-10-11 10:07:52,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 10:07:52,042 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 254 transitions. [2024-10-11 10:07:52,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-11 10:07:52,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:07:52,045 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:07:52,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:07:52,045 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:07:52,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:07:52,046 INFO L85 PathProgramCache]: Analyzing trace with hash -530862231, now seen corresponding path program 1 times [2024-10-11 10:07:52,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:07:52,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586432061] [2024-10-11 10:07:52,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:07:52,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:07:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:07:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:07:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 10:07:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:07:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 10:07:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:07:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:07:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:07:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:07:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:07:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:07:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:07:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:07:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:07:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:07:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:07:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:07:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:07:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:07:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:07:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:07:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:07:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:07:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:07:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:07:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:07:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 10:07:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:07:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 10:07:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:52,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 10:07:52,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:07:52,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586432061] [2024-10-11 10:07:52,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586432061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:07:52,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:07:52,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:07:52,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009940762] [2024-10-11 10:07:52,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:07:52,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:07:52,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:07:52,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:07:52,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:07:52,700 INFO L87 Difference]: Start difference. First operand 162 states and 254 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 10:07:52,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:07:52,894 INFO L93 Difference]: Finished difference Result 424 states and 647 transitions. [2024-10-11 10:07:52,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:07:52,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 184 [2024-10-11 10:07:52,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:07:52,901 INFO L225 Difference]: With dead ends: 424 [2024-10-11 10:07:52,903 INFO L226 Difference]: Without dead ends: 263 [2024-10-11 10:07:52,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:07:52,906 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 67 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:07:52,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 361 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:07:52,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-11 10:07:52,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 231. [2024-10-11 10:07:52,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 162 states have (on average 1.382716049382716) internal successors, (224), 164 states have internal predecessors, (224), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 10:07:52,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 352 transitions. [2024-10-11 10:07:52,968 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 352 transitions. Word has length 184 [2024-10-11 10:07:52,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:07:52,969 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 352 transitions. [2024-10-11 10:07:52,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 10:07:52,969 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 352 transitions. [2024-10-11 10:07:52,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-11 10:07:52,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:07:52,976 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:07:52,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:07:52,977 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:07:52,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:07:52,977 INFO L85 PathProgramCache]: Analyzing trace with hash -272696793, now seen corresponding path program 1 times [2024-10-11 10:07:52,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:07:52,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812486038] [2024-10-11 10:07:52,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:07:52,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:07:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:07:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:07:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 10:07:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:07:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 10:07:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:07:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:07:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:07:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:07:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:07:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:07:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:07:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:07:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:07:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:07:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:07:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:07:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:07:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:07:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:07:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:07:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:07:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:07:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:07:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:07:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:07:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 10:07:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:07:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 10:07:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:53,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 10:07:53,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:07:53,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812486038] [2024-10-11 10:07:53,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812486038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:07:53,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:07:53,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:07:53,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636308161] [2024-10-11 10:07:53,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:07:53,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:07:53,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:07:53,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:07:53,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:07:53,601 INFO L87 Difference]: Start difference. First operand 231 states and 352 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 10:07:53,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:07:53,860 INFO L93 Difference]: Finished difference Result 765 states and 1161 transitions. [2024-10-11 10:07:53,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:07:53,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 184 [2024-10-11 10:07:53,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:07:53,867 INFO L225 Difference]: With dead ends: 765 [2024-10-11 10:07:53,868 INFO L226 Difference]: Without dead ends: 535 [2024-10-11 10:07:53,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:07:53,875 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 134 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:07:53,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 386 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:07:53,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-11 10:07:53,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 515. [2024-10-11 10:07:53,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 378 states have (on average 1.3756613756613756) internal successors, (520), 382 states have internal predecessors, (520), 128 states have call successors, (128), 8 states have call predecessors, (128), 8 states have return successors, (128), 124 states have call predecessors, (128), 128 states have call successors, (128) [2024-10-11 10:07:53,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 776 transitions. [2024-10-11 10:07:53,992 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 776 transitions. Word has length 184 [2024-10-11 10:07:53,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:07:53,993 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 776 transitions. [2024-10-11 10:07:53,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 10:07:53,994 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 776 transitions. [2024-10-11 10:07:53,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-11 10:07:53,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:07:53,998 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:07:53,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 10:07:53,999 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:07:53,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:07:53,999 INFO L85 PathProgramCache]: Analyzing trace with hash -2020913669, now seen corresponding path program 1 times [2024-10-11 10:07:53,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:07:54,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55162694] [2024-10-11 10:07:54,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:07:54,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:07:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 10:07:54,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1881443094] [2024-10-11 10:07:54,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:07:54,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:07:54,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:07:54,194 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 10:07:54,196 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 10:07:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:07:54,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:07:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:07:54,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:07:54,644 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:07:54,645 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:07:54,662 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 10:07:54,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:07:54,852 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 10:07:55,001 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:07:55,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:07:55 BoogieIcfgContainer [2024-10-11 10:07:55,004 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:07:55,005 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:07:55,005 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:07:55,005 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:07:55,006 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:07:50" (3/4) ... [2024-10-11 10:07:55,008 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:07:55,009 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:07:55,010 INFO L158 Benchmark]: Toolchain (without parser) took 6221.36ms. Allocated memory was 180.4MB in the beginning and 239.1MB in the end (delta: 58.7MB). Free memory was 122.9MB in the beginning and 99.6MB in the end (delta: 23.3MB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB. [2024-10-11 10:07:55,010 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 96.5MB. Free memory was 50.5MB in the beginning and 50.4MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:07:55,011 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.16ms. Allocated memory is still 180.4MB. Free memory was 122.9MB in the beginning and 147.2MB in the end (delta: -24.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 10:07:55,011 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.56ms. Allocated memory is still 180.4MB. Free memory was 146.3MB in the beginning and 142.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:07:55,011 INFO L158 Benchmark]: Boogie Preprocessor took 94.07ms. Allocated memory is still 180.4MB. Free memory was 142.1MB in the beginning and 133.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 10:07:55,011 INFO L158 Benchmark]: RCFGBuilder took 657.90ms. Allocated memory is still 180.4MB. Free memory was 133.7MB in the beginning and 102.3MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 10:07:55,012 INFO L158 Benchmark]: TraceAbstraction took 4880.06ms. Allocated memory was 180.4MB in the beginning and 239.1MB in the end (delta: 58.7MB). Free memory was 102.3MB in the beginning and 100.6MB in the end (delta: 1.6MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB. [2024-10-11 10:07:55,012 INFO L158 Benchmark]: Witness Printer took 4.29ms. Allocated memory is still 239.1MB. Free memory was 100.6MB in the beginning and 99.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:07:55,013 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.21ms. Allocated memory is still 96.5MB. Free memory was 50.5MB in the beginning and 50.4MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 492.16ms. Allocated memory is still 180.4MB. Free memory was 122.9MB in the beginning and 147.2MB in the end (delta: -24.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.56ms. Allocated memory is still 180.4MB. Free memory was 146.3MB in the beginning and 142.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.07ms. Allocated memory is still 180.4MB. Free memory was 142.1MB in the beginning and 133.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 657.90ms. Allocated memory is still 180.4MB. Free memory was 133.7MB in the beginning and 102.3MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4880.06ms. Allocated memory was 180.4MB in the beginning and 239.1MB in the end (delta: 58.7MB). Free memory was 102.3MB in the beginning and 100.6MB in the end (delta: 1.6MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB. * Witness Printer took 4.29ms. Allocated memory is still 239.1MB. Free memory was 100.6MB in the beginning and 99.6MB in the end (delta: 1.0MB). There was no memory consumed. 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 180, overapproximation of shiftLeft at line 188, overapproximation of someBinaryArithmeticDOUBLEoperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 188. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed char var_1_3 = 1; [L24] unsigned char var_1_6 = 1; [L25] unsigned char var_1_7 = 0; [L26] signed long int var_1_8 = 50; [L27] double var_1_9 = 32.7; [L28] double var_1_10 = 64.25; [L29] double var_1_11 = 10.3; [L30] double var_1_12 = 3.3; [L31] double var_1_13 = 16.5; [L32] double var_1_14 = 7.125; [L33] unsigned short int var_1_15 = 50; [L34] unsigned short int var_1_16 = 16; [L35] unsigned short int var_1_17 = 8; [L36] unsigned short int var_1_18 = 64; [L37] unsigned long int var_1_19 = 16; [L38] signed short int var_1_20 = 100; [L39] signed short int var_1_21 = 2; [L40] signed short int var_1_22 = 8; [L41] signed long int var_1_23 = -4; [L42] unsigned short int var_1_24 = 128; [L43] signed long int var_1_25 = 2; [L44] unsigned short int var_1_26 = 256; [L45] unsigned char var_1_27 = 0; [L46] unsigned char var_1_28 = 1; [L47] float var_1_34 = 999999999.85; [L48] signed short int var_1_37 = -256; [L49] double var_1_40 = 31.25; [L50] double var_1_42 = 128.5; [L51] unsigned char var_1_43 = 0; [L52] unsigned long int var_1_45 = 50; [L53] signed long int last_1_var_1_8 = 50; [L54] unsigned long int last_1_var_1_19 = 16; [L55] unsigned char last_1_var_1_27 = 0; [L192] isInitial = 1 [L193] FCALL initially() [L194] COND TRUE 1 [L195] CALL updateLastVariables() [L183] last_1_var_1_8 = var_1_8 [L184] last_1_var_1_19 = var_1_19 [L185] last_1_var_1_27 = var_1_27 [L195] RET updateLastVariables() [L196] CALL updateVariables() [L136] var_1_3 = __VERIFIER_nondet_char() [L137] CALL assume_abort_if_not(var_1_3 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L137] RET assume_abort_if_not(var_1_3 >= -128) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L138] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L138] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L139] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L139] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L140] var_1_6 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L141] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L142] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L142] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L143] var_1_7 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_8=50, var_1_9=327/10] [L144] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_8=50, var_1_9=327/10] [L145] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L145] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L146] var_1_10 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L147] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L148] var_1_11 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L149] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L150] var_1_12 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_12 >= -230584.3009213691390e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 2305843.009213691390e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L151] RET assume_abort_if_not((var_1_12 >= -230584.3009213691390e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 2305843.009213691390e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L152] var_1_13 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L153] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L154] var_1_14 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L155] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L156] var_1_16 = __VERIFIER_nondet_ushort() [L157] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L157] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L158] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L158] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L159] var_1_17 = __VERIFIER_nondet_ushort() [L160] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L160] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L161] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L161] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L162] var_1_18 = __VERIFIER_nondet_ushort() [L163] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L163] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L164] CALL assume_abort_if_not(var_1_18 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L164] RET assume_abort_if_not(var_1_18 <= 65534) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L165] var_1_20 = __VERIFIER_nondet_short() [L166] CALL assume_abort_if_not(var_1_20 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L166] RET assume_abort_if_not(var_1_20 >= -1) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L167] CALL assume_abort_if_not(var_1_20 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L167] RET assume_abort_if_not(var_1_20 <= 32767) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L168] var_1_21 = __VERIFIER_nondet_short() [L169] CALL assume_abort_if_not(var_1_21 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L169] RET assume_abort_if_not(var_1_21 >= -1) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L170] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L170] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L171] var_1_22 = __VERIFIER_nondet_short() [L172] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L172] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L173] CALL assume_abort_if_not(var_1_22 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L173] RET assume_abort_if_not(var_1_22 <= 32767) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L174] var_1_24 = __VERIFIER_nondet_ushort() [L175] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L175] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L176] CALL assume_abort_if_not(var_1_24 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L176] RET assume_abort_if_not(var_1_24 <= 65535) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L177] CALL assume_abort_if_not(var_1_24 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L177] RET assume_abort_if_not(var_1_24 != 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_34=19999999997/20, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L178] var_1_34 = __VERIFIER_nondet_float() [L179] CALL assume_abort_if_not((var_1_34 >= -922337.2036854776000e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854776000e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L179] RET assume_abort_if_not((var_1_34 >= -922337.2036854776000e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854776000e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L180] CALL assume_abort_if_not(var_1_34 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L180] RET assume_abort_if_not(var_1_34 != 0.0F) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L196] RET updateVariables() [L197] CALL step() [L59] COND TRUE (var_1_22 * var_1_26) == var_1_17 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=1, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L60] COND TRUE var_1_17 > var_1_22 [L61] var_1_28 = (((var_1_12 * var_1_11) > (16.6f / var_1_34)) && var_1_7) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_37=-256, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L68] COND TRUE \read(var_1_6) [L69] var_1_37 = (((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) < 0 ) ? -((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) : ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_37=50, var_1_3=17, var_1_40=125/4, var_1_42=257/2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L81] var_1_40 = var_1_14 [L82] var_1_42 = var_1_14 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=2, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_37=50, var_1_3=17, var_1_40=2, var_1_42=2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L83] COND FALSE !(var_1_34 <= var_1_14) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=2, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_37=50, var_1_3=17, var_1_40=2, var_1_42=2, var_1_43=0, var_1_45=50, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L90] COND FALSE !((var_1_14 - var_1_14) > var_1_13) [L97] var_1_45 = var_1_22 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=2, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_37=50, var_1_3=17, var_1_40=2, var_1_42=2, var_1_43=0, var_1_45=1, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L99] EXPR -1 << last_1_var_1_19 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=2, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_37=50, var_1_3=17, var_1_40=2, var_1_42=2, var_1_43=0, var_1_45=1, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L99] signed long int stepLocal_1 = -1 << last_1_var_1_19; [L100] unsigned long int stepLocal_0 = -1000000000 + last_1_var_1_19; VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, stepLocal_0=-999999984, stepLocal_1=0, var_1_14=2, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_37=50, var_1_3=17, var_1_40=2, var_1_42=2, var_1_43=0, var_1_45=1, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L101] COND TRUE stepLocal_1 < var_1_3 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, stepLocal_0=-999999984, var_1_14=2, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_37=50, var_1_3=17, var_1_40=2, var_1_42=2, var_1_43=0, var_1_45=1, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L102] COND FALSE !((last_1_var_1_19 / var_1_3) > stepLocal_0) [L105] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=2, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_37=50, var_1_3=17, var_1_40=2, var_1_42=2, var_1_43=0, var_1_45=1, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L108] var_1_9 = (((((var_1_10) < (var_1_11)) ? (var_1_10) : (var_1_11))) + (var_1_12 + (var_1_13 - var_1_14))) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=2, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_37=50, var_1_3=17, var_1_40=2, var_1_42=2, var_1_43=0, var_1_45=1, var_1_6=1, var_1_7=0, var_1_8=50] [L109] COND FALSE !(var_1_10 >= var_1_11) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=2, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_37=50, var_1_3=17, var_1_40=2, var_1_42=2, var_1_43=0, var_1_45=1, var_1_6=1, var_1_7=0, var_1_8=50] [L112] var_1_25 = -256 [L113] var_1_26 = var_1_17 [L114] var_1_27 = var_1_6 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=2, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=-256, var_1_26=256, var_1_27=1, var_1_28=0, var_1_37=50, var_1_3=17, var_1_40=2, var_1_42=2, var_1_43=0, var_1_45=1, var_1_6=1, var_1_7=0, var_1_8=50] [L115] COND FALSE !(var_1_7 || var_1_1) [L126] var_1_8 = last_1_var_1_8 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=2, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=-256, var_1_26=256, var_1_27=1, var_1_28=0, var_1_37=50, var_1_3=17, var_1_40=2, var_1_42=2, var_1_43=0, var_1_45=1, var_1_6=1, var_1_7=0, var_1_8=50] [L128] COND TRUE var_1_6 || (var_1_16 <= (var_1_22 / var_1_24)) [L129] var_1_23 = (((((var_1_8 + (var_1_21 + var_1_24))) < (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) ? ((var_1_8 + (var_1_21 + var_1_24))) : (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))))) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=2, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=50, var_1_24=2, var_1_25=-256, var_1_26=256, var_1_27=1, var_1_28=0, var_1_37=50, var_1_3=17, var_1_40=2, var_1_42=2, var_1_43=0, var_1_45=1, var_1_6=1, var_1_7=0, var_1_8=50] [L131] COND TRUE (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))) - var_1_22) >= var_1_23 [L132] var_1_19 = ((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=2, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=257, var_1_1=0, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=50, var_1_24=2, var_1_25=-256, var_1_26=256, var_1_27=1, var_1_28=0, var_1_37=50, var_1_3=17, var_1_40=2, var_1_42=2, var_1_43=0, var_1_45=1, var_1_6=1, var_1_7=0, var_1_8=50] [L197] RET step() [L198] CALL, EXPR property() [L188] EXPR -1 << last_1_var_1_19 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=2, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=257, var_1_1=0, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=50, var_1_24=2, var_1_25=-256, var_1_26=256, var_1_27=1, var_1_28=0, var_1_37=50, var_1_3=17, var_1_40=2, var_1_42=2, var_1_43=0, var_1_45=1, var_1_6=1, var_1_7=0, var_1_8=50] [L188-L189] return ((((((((((-1 << last_1_var_1_19) < var_1_3) ? (((last_1_var_1_19 / var_1_3) > (-1000000000 + last_1_var_1_19)) ? (var_1_1 == ((unsigned char) (last_1_var_1_27 || var_1_6))) : (var_1_1 == ((unsigned char) var_1_7))) : 1) && ((var_1_7 || var_1_1) ? (((var_1_26 >= var_1_3) && var_1_1) ? (var_1_8 == ((signed long int) ((((var_1_3) < (var_1_26)) ? (var_1_3) : (var_1_26))))) : (var_1_1 ? (var_1_8 == ((signed long int) last_1_var_1_8)) : (var_1_8 == ((signed long int) last_1_var_1_8)))) : (var_1_8 == ((signed long int) last_1_var_1_8)))) && (var_1_9 == ((double) (((((var_1_10) < (var_1_11)) ? (var_1_10) : (var_1_11))) + (var_1_12 + (var_1_13 - var_1_14)))))) && ((var_1_10 >= var_1_11) ? (var_1_15 == ((unsigned short int) ((((((((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) > (var_1_17)) ? (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) : (var_1_17)))) > (var_1_18)) ? (((((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) > (var_1_17)) ? (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) : (var_1_17)))) : (var_1_18))))) : 1)) && (((((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))) - var_1_22) >= var_1_23) ? (var_1_19 == ((unsigned long int) ((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))))) : 1)) && ((var_1_6 || (var_1_16 <= (var_1_22 / var_1_24))) ? (var_1_23 == ((signed long int) (((((var_1_8 + (var_1_21 + var_1_24))) < (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) ? ((var_1_8 + (var_1_21 + var_1_24))) : (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))))))) : 1)) && (var_1_25 == ((signed long int) -256))) && (var_1_26 == ((unsigned short int) var_1_17))) && (var_1_27 == ((unsigned char) var_1_6)) ; [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=2, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=257, var_1_1=0, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=50, var_1_24=2, var_1_25=-256, var_1_26=256, var_1_27=1, var_1_28=0, var_1_37=50, var_1_3=17, var_1_40=2, var_1_42=2, var_1_43=0, var_1_45=1, var_1_6=1, var_1_7=0, var_1_8=50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=2, var_1_15=50, var_1_16=0, var_1_17=256, var_1_18=-196351, var_1_19=257, var_1_1=0, var_1_20=-1, var_1_21=51, var_1_22=1, var_1_23=50, var_1_24=2, var_1_25=-256, var_1_26=256, var_1_27=1, var_1_28=0, var_1_37=50, var_1_3=17, var_1_40=2, var_1_42=2, var_1_43=0, var_1_45=1, var_1_6=1, var_1_7=0, var_1_8=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 5, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 268 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 268 mSDsluCounter, 1128 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 601 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 94 IncrementalHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 527 mSDtfsCounter, 94 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=515occurred in iteration=4, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 4 MinimizatonAttempts, 55 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1106 NumberOfCodeBlocks, 1106 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 730 ConstructedInterpolants, 0 QuantifiedInterpolants, 1697 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 6496/6496 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 10:07:55,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-ps-ci_file-94.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 2fbe3d649f1d95336e9444f5c0690a9489945b39910476a2f8bbd47796cd371b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:07:57,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:07:57,405 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 10:07:57,411 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:07:57,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:07:57,441 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:07:57,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:07:57,443 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:07:57,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:07:57,447 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:07:57,447 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:07:57,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:07:57,448 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:07:57,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:07:57,449 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:07:57,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:07:57,449 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:07:57,450 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:07:57,450 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:07:57,450 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:07:57,450 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:07:57,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:07:57,452 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:07:57,452 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:07:57,453 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:07:57,453 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:07:57,453 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:07:57,453 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:07:57,453 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:07:57,454 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:07:57,454 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:07:57,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:07:57,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:07:57,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:07:57,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:07:57,457 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:07:57,458 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:07:57,458 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:07:57,458 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:07:57,459 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:07:57,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:07:57,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:07:57,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:07:57,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:07:57,460 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:07:57,460 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 -> 2fbe3d649f1d95336e9444f5c0690a9489945b39910476a2f8bbd47796cd371b [2024-10-11 10:07:57,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:07:57,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:07:57,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:07:57,833 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:07:57,834 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:07:57,835 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-94.i [2024-10-11 10:07:59,347 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:07:59,597 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:07:59,598 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-94.i [2024-10-11 10:07:59,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8b3a1361c/202fc76995244ba1abe7ff46fc9a799e/FLAG62a5fc5c7 [2024-10-11 10:07:59,632 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8b3a1361c/202fc76995244ba1abe7ff46fc9a799e [2024-10-11 10:07:59,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:07:59,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:07:59,640 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:07:59,640 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:07:59,645 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:07:59,646 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:07:59" (1/1) ... [2024-10-11 10:07:59,647 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@707d49bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:07:59, skipping insertion in model container [2024-10-11 10:07:59,647 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:07:59" (1/1) ... [2024-10-11 10:07:59,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:07:59,867 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-ps-ci_file-94.i[919,932] [2024-10-11 10:07:59,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:07:59,987 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:07:59,999 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-ps-ci_file-94.i[919,932] [2024-10-11 10:08:00,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:08:00,085 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:08:00,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:08:00 WrapperNode [2024-10-11 10:08:00,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:08:00,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:08:00,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:08:00,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:08:00,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:08:00" (1/1) ... [2024-10-11 10:08:00,110 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:08:00" (1/1) ... [2024-10-11 10:08:00,147 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2024-10-11 10:08:00,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:08:00,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:08:00,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:08:00,152 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:08:00,164 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:08:00" (1/1) ... [2024-10-11 10:08:00,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:08:00" (1/1) ... [2024-10-11 10:08:00,169 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:08:00" (1/1) ... [2024-10-11 10:08:00,190 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 10:08:00,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:08:00" (1/1) ... [2024-10-11 10:08:00,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:08:00" (1/1) ... [2024-10-11 10:08:00,211 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:08:00" (1/1) ... [2024-10-11 10:08:00,221 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:08:00" (1/1) ... [2024-10-11 10:08:00,224 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:08:00" (1/1) ... [2024-10-11 10:08:00,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:08:00" (1/1) ... [2024-10-11 10:08:00,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:08:00,243 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:08:00,243 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:08:00,243 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:08:00,244 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:08:00" (1/1) ... [2024-10-11 10:08:00,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:08:00,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:08:00,280 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 10:08:00,287 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 10:08:00,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:08:00,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:08:00,333 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:08:00,333 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:08:00,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:08:00,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:08:00,430 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:08:00,434 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:08:10,438 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 10:08:10,438 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:08:10,498 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:08:10,499 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:08:10,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:08:10 BoogieIcfgContainer [2024-10-11 10:08:10,499 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:08:10,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:08:10,503 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:08:10,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:08:10,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:07:59" (1/3) ... [2024-10-11 10:08:10,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@470c6c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:08:10, skipping insertion in model container [2024-10-11 10:08:10,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:08:00" (2/3) ... [2024-10-11 10:08:10,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@470c6c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:08:10, skipping insertion in model container [2024-10-11 10:08:10,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:08:10" (3/3) ... [2024-10-11 10:08:10,511 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-94.i [2024-10-11 10:08:10,526 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:08:10,526 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:08:10,582 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:08:10,588 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;@aaf80ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:08:10,588 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:08:10,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 10:08:10,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-11 10:08:10,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:08:10,603 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:08:10,604 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:08:10,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:08:10,608 INFO L85 PathProgramCache]: Analyzing trace with hash -578675821, now seen corresponding path program 1 times [2024-10-11 10:08:10,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:08:10,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526329517] [2024-10-11 10:08:10,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:08:10,621 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 10:08:10,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:08:10,623 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 10:08:10,645 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 10:08:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:08:11,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:08:11,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:08:11,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 776 proven. 0 refuted. 0 times theorem prover too weak. 848 trivial. 0 not checked. [2024-10-11 10:08:11,519 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:08:11,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:08:11,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526329517] [2024-10-11 10:08:11,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526329517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:08:11,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:08:11,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:08:11,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319350468] [2024-10-11 10:08:11,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:08:11,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:08:11,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:08:11,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:08:11,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:08:11,561 INFO L87 Difference]: Start difference. First operand has 80 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 10:08:13,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:08:13,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:08:13,652 INFO L93 Difference]: Finished difference Result 157 states and 285 transitions. [2024-10-11 10:08:13,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:08:13,687 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 180 [2024-10-11 10:08:13,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:08:13,693 INFO L225 Difference]: With dead ends: 157 [2024-10-11 10:08:13,693 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 10:08:13,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 179 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 10:08:13,699 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:08:13,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 10:08:13,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 10:08:13,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-11 10:08:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 10:08:13,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 123 transitions. [2024-10-11 10:08:13,741 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 123 transitions. Word has length 180 [2024-10-11 10:08:13,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:08:13,742 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 123 transitions. [2024-10-11 10:08:13,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 10:08:13,743 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 123 transitions. [2024-10-11 10:08:13,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-11 10:08:13,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:08:13,747 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:08:13,774 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 10:08:13,947 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 10:08:13,948 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:08:13,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:08:13,949 INFO L85 PathProgramCache]: Analyzing trace with hash 734389381, now seen corresponding path program 1 times [2024-10-11 10:08:13,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:08:13,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409727389] [2024-10-11 10:08:13,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:08:13,950 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 10:08:13,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:08:13,954 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 10:08:13,955 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 10:08:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:08:14,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 10:08:14,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:08:17,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 10:08:17,483 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:08:17,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:08:17,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409727389] [2024-10-11 10:08:17,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409727389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:08:17,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:08:17,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:08:17,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156294143] [2024-10-11 10:08:17,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:08:17,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:08:17,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:08:17,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:08:17,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:08:17,488 INFO L87 Difference]: Start difference. First operand 78 states and 123 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 10:08:19,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:08:22,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:08:22,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:08:22,478 INFO L93 Difference]: Finished difference Result 238 states and 373 transitions. [2024-10-11 10:08:22,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:08:22,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 180 [2024-10-11 10:08:22,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:08:22,518 INFO L225 Difference]: With dead ends: 238 [2024-10-11 10:08:22,518 INFO L226 Difference]: Without dead ends: 161 [2024-10-11 10:08:22,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:08:22,520 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 99 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-10-11 10:08:22,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 474 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-10-11 10:08:22,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-11 10:08:22,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2024-10-11 10:08:22,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 92 states have (on average 1.3804347826086956) internal successors, (127), 92 states have internal predecessors, (127), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 10:08:22,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 243 transitions. [2024-10-11 10:08:22,578 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 243 transitions. Word has length 180 [2024-10-11 10:08:22,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:08:22,579 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 243 transitions. [2024-10-11 10:08:22,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 10:08:22,582 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 243 transitions. [2024-10-11 10:08:22,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-11 10:08:22,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:08:22,588 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:08:22,622 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 10:08:22,789 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 10:08:22,789 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:08:22,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:08:22,790 INFO L85 PathProgramCache]: Analyzing trace with hash 777670767, now seen corresponding path program 1 times [2024-10-11 10:08:22,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:08:22,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1025808071] [2024-10-11 10:08:22,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:08:22,791 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 10:08:22,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:08:22,795 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 10:08:22,796 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 [2024-10-11 10:08:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:08:25,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-11 10:08:25,197 INFO L278 TraceCheckSpWp]: Computing forward predicates...