./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_fillercodesize_ps-cn-10_file-80.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-80.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 4bb7209f06eb90a60dcbe2d649d5deab37b76f9df595c124e6bf4c05ffd58895 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:09:17,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:09:18,005 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 06:09:18,013 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:09:18,013 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:09:18,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:09:18,045 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:09:18,046 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:09:18,046 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:09:18,048 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:09:18,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:09:18,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:09:18,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:09:18,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:09:18,052 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:09:18,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:09:18,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:09:18,053 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:09:18,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 06:09:18,053 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:09:18,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:09:18,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:09:18,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:09:18,057 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:09:18,058 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:09:18,058 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:09:18,058 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:09:18,059 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:09:18,059 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:09:18,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:09:18,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:09:18,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:09:18,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:09:18,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:09:18,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:09:18,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:09:18,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 06:09:18,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 06:09:18,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:09:18,062 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:09:18,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:09:18,064 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:09:18,064 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> 4bb7209f06eb90a60dcbe2d649d5deab37b76f9df595c124e6bf4c05ffd58895 [2024-10-24 06:09:18,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:09:18,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:09:18,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:09:18,340 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:09:18,340 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:09:18,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-80.i [2024-10-24 06:09:19,823 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:09:20,057 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:09:20,061 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-80.i [2024-10-24 06:09:20,075 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3272346e9/1f97020bb59e4a4bb336fbfbee808026/FLAG0ab458e3a [2024-10-24 06:09:20,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3272346e9/1f97020bb59e4a4bb336fbfbee808026 [2024-10-24 06:09:20,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:09:20,096 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:09:20,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:09:20,099 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:09:20,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:09:20,105 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:09:20" (1/1) ... [2024-10-24 06:09:20,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6181e354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:20, skipping insertion in model container [2024-10-24 06:09:20,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:09:20" (1/1) ... [2024-10-24 06:09:20,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:09:20,314 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_fillercodesize_ps-cn-10_file-80.i[915,928] [2024-10-24 06:09:20,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:09:20,388 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:09:20,399 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_fillercodesize_ps-cn-10_file-80.i[915,928] [2024-10-24 06:09:20,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:09:20,465 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:09:20,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:20 WrapperNode [2024-10-24 06:09:20,466 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:09:20,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:09:20,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:09:20,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:09:20,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:20" (1/1) ... [2024-10-24 06:09:20,492 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:20" (1/1) ... [2024-10-24 06:09:20,532 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2024-10-24 06:09:20,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:09:20,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:09:20,534 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:09:20,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:09:20,545 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:20" (1/1) ... [2024-10-24 06:09:20,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:20" (1/1) ... [2024-10-24 06:09:20,554 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:20" (1/1) ... [2024-10-24 06:09:20,582 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-24 06:09:20,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:20" (1/1) ... [2024-10-24 06:09:20,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:20" (1/1) ... [2024-10-24 06:09:20,601 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:20" (1/1) ... [2024-10-24 06:09:20,607 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:20" (1/1) ... [2024-10-24 06:09:20,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:20" (1/1) ... [2024-10-24 06:09:20,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:20" (1/1) ... [2024-10-24 06:09:20,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:09:20,626 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:09:20,626 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:09:20,626 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:09:20,628 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:20" (1/1) ... [2024-10-24 06:09:20,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:09:20,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:09:20,667 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 06:09:20,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 06:09:20,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:09:20,719 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:09:20,719 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:09:20,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 06:09:20,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:09:20,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:09:20,826 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:09:20,827 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:09:21,381 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 06:09:21,382 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:09:21,443 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:09:21,444 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:09:21,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:09:21 BoogieIcfgContainer [2024-10-24 06:09:21,444 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:09:21,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:09:21,448 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:09:21,451 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:09:21,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:09:20" (1/3) ... [2024-10-24 06:09:21,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@599521c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:09:21, skipping insertion in model container [2024-10-24 06:09:21,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:20" (2/3) ... [2024-10-24 06:09:21,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@599521c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:09:21, skipping insertion in model container [2024-10-24 06:09:21,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:09:21" (3/3) ... [2024-10-24 06:09:21,455 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-80.i [2024-10-24 06:09:21,473 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:09:21,474 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:09:21,541 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:09:21,551 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;@289d116f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:09:21,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:09:21,555 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 45 states have internal predecessors, (61), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 06:09:21,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-24 06:09:21,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:09:21,570 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:09:21,570 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:09:21,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:09:21,575 INFO L85 PathProgramCache]: Analyzing trace with hash 313937276, now seen corresponding path program 1 times [2024-10-24 06:09:21,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:09:21,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911845741] [2024-10-24 06:09:21,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:09:21,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:09:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:21,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:09:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:21,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:09:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:21,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:09:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:21,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 06:09:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:21,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 06:09:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:21,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:09:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:21,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 06:09:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:21,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:09:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:21,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 06:09:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:21,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:09:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:21,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 06:09:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 06:09:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 06:09:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 06:09:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 06:09:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 06:09:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 06:09:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 06:09:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 06:09:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 06:09:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 06:09:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 06:09:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 06:09:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 06:09:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-24 06:09:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 06:09:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-24 06:09:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-24 06:09:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-24 06:09:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-24 06:09:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 06:09:22,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:09:22,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911845741] [2024-10-24 06:09:22,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911845741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:09:22,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:09:22,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:09:22,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360553385] [2024-10-24 06:09:22,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:09:22,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:09:22,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:09:22,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:09:22,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:09:22,183 INFO L87 Difference]: Start difference. First operand has 77 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 45 states have internal predecessors, (61), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 06:09:22,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:09:22,237 INFO L93 Difference]: Finished difference Result 151 states and 270 transitions. [2024-10-24 06:09:22,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:09:22,242 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 185 [2024-10-24 06:09:22,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:09:22,248 INFO L225 Difference]: With dead ends: 151 [2024-10-24 06:09:22,248 INFO L226 Difference]: Without dead ends: 75 [2024-10-24 06:09:22,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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-24 06:09:22,255 INFO L432 NwaCegarLoop]: 113 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, 113 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-24 06:09:22,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:09:22,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-24 06:09:22,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-24 06:09:22,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 06:09:22,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 116 transitions. [2024-10-24 06:09:22,320 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 116 transitions. Word has length 185 [2024-10-24 06:09:22,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:09:22,320 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 116 transitions. [2024-10-24 06:09:22,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 06:09:22,321 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 116 transitions. [2024-10-24 06:09:22,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-24 06:09:22,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:09:22,327 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:09:22,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 06:09:22,327 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:09:22,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:09:22,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1432292224, now seen corresponding path program 1 times [2024-10-24 06:09:22,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:09:22,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362298699] [2024-10-24 06:09:22,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:09:22,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:09:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:09:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:09:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:09:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 06:09:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 06:09:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:09:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 06:09:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:09:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 06:09:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:09:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:22,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 06:09:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 06:09:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 06:09:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 06:09:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 06:09:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 06:09:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 06:09:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 06:09:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 06:09:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 06:09:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 06:09:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 06:09:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 06:09:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 06:09:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-24 06:09:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 06:09:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-24 06:09:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-24 06:09:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-24 06:09:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-24 06:09:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 06:09:23,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:09:23,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362298699] [2024-10-24 06:09:23,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362298699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:09:23,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:09:23,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:09:23,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642660832] [2024-10-24 06:09:23,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:09:23,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:09:23,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:09:23,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:09:23,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:09:23,166 INFO L87 Difference]: Start difference. First operand 75 states and 116 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 06:09:23,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:09:23,238 INFO L93 Difference]: Finished difference Result 223 states and 346 transitions. [2024-10-24 06:09:23,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:09:23,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 185 [2024-10-24 06:09:23,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:09:23,243 INFO L225 Difference]: With dead ends: 223 [2024-10-24 06:09:23,243 INFO L226 Difference]: Without dead ends: 149 [2024-10-24 06:09:23,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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-24 06:09:23,245 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 54 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:09:23,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 224 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:09:23,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-24 06:09:23,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2024-10-24 06:09:23,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 84 states have (on average 1.2619047619047619) internal successors, (106), 84 states have internal predecessors, (106), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 06:09:23,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 226 transitions. [2024-10-24 06:09:23,276 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 226 transitions. Word has length 185 [2024-10-24 06:09:23,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:09:23,277 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 226 transitions. [2024-10-24 06:09:23,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 06:09:23,278 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 226 transitions. [2024-10-24 06:09:23,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-24 06:09:23,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:09:23,281 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:09:23,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 06:09:23,285 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:09:23,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:09:23,286 INFO L85 PathProgramCache]: Analyzing trace with hash -2112350594, now seen corresponding path program 1 times [2024-10-24 06:09:23,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:09:23,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517989546] [2024-10-24 06:09:23,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:09:23,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:09:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:09:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:09:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:09:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 06:09:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 06:09:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:09:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 06:09:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:09:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 06:09:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:09:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 06:09:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 06:09:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 06:09:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 06:09:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 06:09:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 06:09:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 06:09:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 06:09:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 06:09:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 06:09:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 06:09:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 06:09:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 06:09:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 06:09:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-24 06:09:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 06:09:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-24 06:09:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-24 06:09:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-24 06:09:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-24 06:09:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 06:09:23,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:09:23,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517989546] [2024-10-24 06:09:23,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517989546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:09:23,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:09:23,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:09:23,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486068721] [2024-10-24 06:09:23,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:09:23,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:09:23,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:09:23,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:09:23,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:09:23,600 INFO L87 Difference]: Start difference. First operand 147 states and 226 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 06:09:23,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:09:23,688 INFO L93 Difference]: Finished difference Result 367 states and 566 transitions. [2024-10-24 06:09:23,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:09:23,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 185 [2024-10-24 06:09:23,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:09:23,693 INFO L225 Difference]: With dead ends: 367 [2024-10-24 06:09:23,694 INFO L226 Difference]: Without dead ends: 293 [2024-10-24 06:09:23,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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-24 06:09:23,696 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 112 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:09:23,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 354 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:09:23,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-24 06:09:23,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 151. [2024-10-24 06:09:23,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 88 states have (on average 1.25) internal successors, (110), 88 states have internal predecessors, (110), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 06:09:23,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 230 transitions. [2024-10-24 06:09:23,753 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 230 transitions. Word has length 185 [2024-10-24 06:09:23,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:09:23,757 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 230 transitions. [2024-10-24 06:09:23,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 06:09:23,758 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 230 transitions. [2024-10-24 06:09:23,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-24 06:09:23,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:09:23,763 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:09:23,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 06:09:23,763 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:09:23,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:09:23,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1411286016, now seen corresponding path program 1 times [2024-10-24 06:09:23,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:09:23,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85121051] [2024-10-24 06:09:23,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:09:23,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:09:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:09:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:09:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:09:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 06:09:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 06:09:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:09:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 06:09:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:09:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 06:09:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:09:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 06:09:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 06:09:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 06:09:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 06:09:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 06:09:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 06:09:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 06:09:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 06:09:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 06:09:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 06:09:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 06:09:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 06:09:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 06:09:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 06:09:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-24 06:09:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 06:09:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-24 06:09:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-24 06:09:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-24 06:09:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-24 06:09:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 06:09:23,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:09:23,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85121051] [2024-10-24 06:09:23,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85121051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:09:23,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:09:23,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:09:23,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813982608] [2024-10-24 06:09:23,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:09:23,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:09:23,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:09:23,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:09:23,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:09:23,997 INFO L87 Difference]: Start difference. First operand 151 states and 230 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 06:09:24,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:09:24,037 INFO L93 Difference]: Finished difference Result 225 states and 340 transitions. [2024-10-24 06:09:24,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:09:24,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 185 [2024-10-24 06:09:24,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:09:24,040 INFO L225 Difference]: With dead ends: 225 [2024-10-24 06:09:24,040 INFO L226 Difference]: Without dead ends: 75 [2024-10-24 06:09:24,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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-24 06:09:24,046 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:09:24,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 210 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:09:24,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-24 06:09:24,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-24 06:09:24,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 06:09:24,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 110 transitions. [2024-10-24 06:09:24,064 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 110 transitions. Word has length 185 [2024-10-24 06:09:24,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:09:24,065 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 110 transitions. [2024-10-24 06:09:24,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 06:09:24,065 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 110 transitions. [2024-10-24 06:09:24,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-24 06:09:24,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:09:24,069 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:09:24,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 06:09:24,070 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:09:24,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:09:24,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1063117375, now seen corresponding path program 1 times [2024-10-24 06:09:24,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:09:24,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248487893] [2024-10-24 06:09:24,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:09:24,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:09:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:09:24,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 06:09:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:09:24,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 06:09:24,440 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 06:09:24,441 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 06:09:24,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 06:09:24,445 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-24 06:09:24,593 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 06:09:24,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 06:09:24 BoogieIcfgContainer [2024-10-24 06:09:24,597 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 06:09:24,598 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 06:09:24,598 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 06:09:24,598 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 06:09:24,598 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:09:21" (3/4) ... [2024-10-24 06:09:24,600 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 06:09:24,602 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 06:09:24,604 INFO L158 Benchmark]: Toolchain (without parser) took 4505.98ms. Allocated memory was 163.6MB in the beginning and 234.9MB in the end (delta: 71.3MB). Free memory was 106.9MB in the beginning and 176.8MB in the end (delta: -69.9MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. [2024-10-24 06:09:24,604 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 163.6MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:09:24,607 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.07ms. Allocated memory is still 163.6MB. Free memory was 106.9MB in the beginning and 90.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 06:09:24,607 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.76ms. Allocated memory is still 163.6MB. Free memory was 90.6MB in the beginning and 85.9MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 06:09:24,607 INFO L158 Benchmark]: Boogie Preprocessor took 92.07ms. Allocated memory is still 163.6MB. Free memory was 85.9MB in the beginning and 78.9MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 06:09:24,607 INFO L158 Benchmark]: RCFGBuilder took 818.29ms. Allocated memory is still 163.6MB. Free memory was 78.9MB in the beginning and 119.4MB in the end (delta: -40.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-24 06:09:24,608 INFO L158 Benchmark]: TraceAbstraction took 3149.72ms. Allocated memory was 163.6MB in the beginning and 234.9MB in the end (delta: 71.3MB). Free memory was 118.6MB in the beginning and 176.8MB in the end (delta: -58.2MB). Peak memory consumption was 126.3MB. Max. memory is 16.1GB. [2024-10-24 06:09:24,608 INFO L158 Benchmark]: Witness Printer took 4.15ms. Allocated memory is still 234.9MB. Free memory is still 176.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:09:24,610 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.15ms. Allocated memory is still 163.6MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.07ms. Allocated memory is still 163.6MB. Free memory was 106.9MB in the beginning and 90.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.76ms. Allocated memory is still 163.6MB. Free memory was 90.6MB in the beginning and 85.9MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.07ms. Allocated memory is still 163.6MB. Free memory was 85.9MB in the beginning and 78.9MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 818.29ms. Allocated memory is still 163.6MB. Free memory was 78.9MB in the beginning and 119.4MB in the end (delta: -40.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3149.72ms. Allocated memory was 163.6MB in the beginning and 234.9MB in the end (delta: 71.3MB). Free memory was 118.6MB in the beginning and 176.8MB in the end (delta: -58.2MB). Peak memory consumption was 126.3MB. Max. memory is 16.1GB. * Witness Printer took 4.15ms. Allocated memory is still 234.9MB. Free memory is still 176.8MB. 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 someBinaryDOUBLEComparisonOperation at line 161, overapproximation of someBinaryFLOATComparisonOperation at line 161. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 128; [L23] double var_1_2 = 24.25; [L24] double var_1_3 = 128.5; [L25] double var_1_4 = 4.5; [L26] double var_1_5 = 49.5; [L27] signed short int var_1_9 = -25; [L28] unsigned char var_1_10 = 200; [L29] unsigned char var_1_11 = 1; [L30] unsigned char var_1_12 = 1; [L31] double var_1_13 = 128.375; [L32] unsigned short int var_1_14 = 0; [L33] float var_1_15 = 0.0; [L34] float var_1_16 = 4.87; [L35] float var_1_17 = 8.875; [L36] signed short int var_1_18 = -128; [L37] unsigned char var_1_19 = 0; [L38] unsigned char var_1_20 = 1; [L39] unsigned char var_1_21 = 0; [L40] unsigned long int var_1_22 = 16; [L41] unsigned long int var_1_23 = 4200661734; [L42] float var_1_24 = 9999999999.375; [L43] unsigned short int var_1_25 = 0; [L44] unsigned short int var_1_26 = 10; [L45] float var_1_27 = 128.75; [L46] double var_1_28 = 9.25; [L47] signed short int var_1_29 = -2; [L48] signed short int var_1_30 = 2; [L49] float var_1_31 = 32.25; [L50] unsigned short int var_1_32 = 128; [L51] unsigned short int var_1_33 = 8; [L52] signed char var_1_34 = -64; [L53] signed char var_1_35 = 64; [L54] float var_1_36 = 256.5; [L55] unsigned char last_1_var_1_10 = 200; [L165] isInitial = 1 [L166] FCALL initially() [L167] COND TRUE 1 [L168] CALL updateLastVariables() [L158] last_1_var_1_10 = var_1_10 [L168] RET updateLastVariables() [L169] CALL updateVariables() [L107] var_1_2 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L108] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L109] var_1_3 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L110] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L111] var_1_4 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_5=99/2, var_1_9=-25] [L112] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_5=99/2, var_1_9=-25] [L113] var_1_5 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L114] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L115] var_1_11 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L116] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L117] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L117] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L118] var_1_12 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L119] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L120] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L120] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L121] var_1_13 = __VERIFIER_nondet_double() [L122] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L122] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L123] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L123] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L124] var_1_15 = __VERIFIER_nondet_float() [L125] CALL assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L125] RET assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L126] var_1_16 = __VERIFIER_nondet_float() [L127] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L127] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L128] var_1_17 = __VERIFIER_nondet_float() [L129] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L129] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L130] var_1_20 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L131] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L132] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L132] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L133] var_1_21 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L134] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L135] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L135] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L136] var_1_23 = __VERIFIER_nondet_ulong() [L137] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L137] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L138] CALL assume_abort_if_not(var_1_23 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L138] RET assume_abort_if_not(var_1_23 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L139] var_1_25 = __VERIFIER_nondet_ushort() [L140] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L140] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L141] CALL assume_abort_if_not(var_1_25 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L141] RET assume_abort_if_not(var_1_25 <= 65535) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L142] var_1_26 = __VERIFIER_nondet_ushort() [L143] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L143] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L144] CALL assume_abort_if_not(var_1_26 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L144] RET assume_abort_if_not(var_1_26 <= 65535) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L145] var_1_27 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L146] RET assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L147] var_1_30 = __VERIFIER_nondet_short() [L148] CALL assume_abort_if_not(var_1_30 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=0, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=0, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L148] RET assume_abort_if_not(var_1_30 >= -32767) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=0, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L149] CALL assume_abort_if_not(var_1_30 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=0, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=0, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L149] RET assume_abort_if_not(var_1_30 <= 32766) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=0, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L150] var_1_33 = __VERIFIER_nondet_ushort() [L151] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=0, var_1_31=129/4, var_1_32=128, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=0, var_1_31=129/4, var_1_32=128, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L151] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=0, var_1_31=129/4, var_1_32=128, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L152] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=0, var_1_31=129/4, var_1_32=128, var_1_33=-2, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=0, var_1_31=129/4, var_1_32=128, var_1_33=-2, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L152] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=0, var_1_31=129/4, var_1_32=128, var_1_33=-2, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L153] var_1_35 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_35 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=0, var_1_31=129/4, var_1_32=128, var_1_33=-2, var_1_34=-64, var_1_35=0, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=0, var_1_31=129/4, var_1_32=128, var_1_33=-2, var_1_34=-64, var_1_35=0, var_1_36=513/2, var_1_9=-25] [L154] RET assume_abort_if_not(var_1_35 >= -127) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=0, var_1_31=129/4, var_1_32=128, var_1_33=-2, var_1_34=-64, var_1_35=0, var_1_36=513/2, var_1_9=-25] [L155] CALL assume_abort_if_not(var_1_35 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=0, var_1_31=129/4, var_1_32=128, var_1_33=-2, var_1_34=-64, var_1_35=0, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=0, var_1_31=129/4, var_1_32=128, var_1_33=-2, var_1_34=-64, var_1_35=0, var_1_36=513/2, var_1_9=-25] [L155] RET assume_abort_if_not(var_1_35 <= 126) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=0, var_1_31=129/4, var_1_32=128, var_1_33=-2, var_1_34=-64, var_1_35=0, var_1_36=513/2, var_1_9=-25] [L169] RET updateVariables() [L170] CALL step() [L59] EXPR var_1_25 & var_1_26 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=79999999995/8, var_1_25=0, var_1_26=0, var_1_28=37/4, var_1_29=-2, var_1_30=0, var_1_31=129/4, var_1_32=128, var_1_33=-2, var_1_34=-64, var_1_35=0, var_1_36=513/2, var_1_9=-25] [L59] COND TRUE (var_1_25 & var_1_26) >= -2 [L60] var_1_24 = var_1_27 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=37/4, var_1_29=-2, var_1_30=0, var_1_31=129/4, var_1_32=128, var_1_33=-2, var_1_34=-64, var_1_35=0, var_1_36=513/2, var_1_9=-25] [L62] var_1_28 = var_1_27 [L63] var_1_29 = var_1_30 [L64] var_1_31 = var_1_27 [L65] var_1_32 = var_1_33 [L66] var_1_34 = var_1_35 [L67] var_1_36 = var_1_27 [L68] signed long int stepLocal_0 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_0=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=10000000004, var_1_29=0, var_1_30=0, var_1_31=10000000004, var_1_32=-2, var_1_33=-2, var_1_34=0, var_1_35=0, var_1_36=10000000004, var_1_9=-25] [L69] COND TRUE stepLocal_0 >= last_1_var_1_10 [L70] var_1_9 = (-256 + last_1_var_1_10) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=10000000004, var_1_29=0, var_1_30=0, var_1_31=10000000004, var_1_32=-2, var_1_33=-2, var_1_34=0, var_1_35=0, var_1_36=10000000004, var_1_9=-56] [L74] signed short int stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_1=-56, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=10000000004, var_1_29=0, var_1_30=0, var_1_31=10000000004, var_1_32=-2, var_1_33=-2, var_1_34=0, var_1_35=0, var_1_36=10000000004, var_1_9=-56] [L75] COND FALSE !(stepLocal_1 > 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=10000000004, var_1_29=0, var_1_30=0, var_1_31=10000000004, var_1_32=-2, var_1_33=-2, var_1_34=0, var_1_35=0, var_1_36=10000000004, var_1_9=-56] [L78] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=10000000004, var_1_29=0, var_1_30=0, var_1_31=10000000004, var_1_32=-2, var_1_33=-2, var_1_34=0, var_1_35=0, var_1_36=10000000004, var_1_9=-56] [L81] COND TRUE ! (var_1_5 > (255.9 / var_1_13)) [L82] var_1_10 = var_1_12 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=4, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=10000000004, var_1_29=0, var_1_30=0, var_1_31=10000000004, var_1_32=-2, var_1_33=-2, var_1_34=0, var_1_35=0, var_1_36=10000000004, var_1_9=-56] [L85] COND FALSE !(((var_1_2 - var_1_3) * var_1_4) < var_1_5) [L88] var_1_1 = var_1_10 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=4, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=4, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=10000000004, var_1_29=0, var_1_30=0, var_1_31=10000000004, var_1_32=-2, var_1_33=-2, var_1_34=0, var_1_35=0, var_1_36=10000000004, var_1_9=-56] [L90] COND FALSE !((var_1_17 <= (- var_1_16)) && var_1_19) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=4, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=4, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-52, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=10000000004, var_1_29=0, var_1_30=0, var_1_31=10000000004, var_1_32=-2, var_1_33=-2, var_1_34=0, var_1_35=0, var_1_36=10000000004, var_1_9=-56] [L93] COND FALSE !(\read(var_1_19)) [L96] var_1_22 = (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=4, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=4, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=-52, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=10000000004, var_1_29=0, var_1_30=0, var_1_31=10000000004, var_1_32=-2, var_1_33=-2, var_1_34=0, var_1_35=0, var_1_36=10000000004, var_1_9=-56] [L98] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=4, var_1_11=1, var_1_12=4, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=4, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=-52, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=10000000004, var_1_29=0, var_1_30=0, var_1_31=10000000004, var_1_32=-2, var_1_33=-2, var_1_34=0, var_1_35=0, var_1_36=10000000004, var_1_9=-56] [L99] COND TRUE ((var_1_15 - var_1_16) - var_1_17) <= var_1_13 [L100] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=4, var_1_11=1, var_1_12=4, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=4, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=-52, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=10000000004, var_1_29=0, var_1_30=0, var_1_31=10000000004, var_1_32=-2, var_1_33=-2, var_1_34=0, var_1_35=0, var_1_36=10000000004, var_1_9=-56] [L170] RET step() [L171] CALL, EXPR property() [L161-L162] return (((((((((var_1_2 - var_1_3) * var_1_4) < var_1_5) ? (var_1_1 == ((signed short int) ((((-8) < ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10)))))) ? (-8) : ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))))))) : (var_1_1 == ((signed short int) var_1_10))) && ((last_1_var_1_10 >= last_1_var_1_10) ? (var_1_9 == ((signed short int) (-256 + last_1_var_1_10))) : (var_1_9 == ((signed short int) (last_1_var_1_10 + last_1_var_1_10))))) && (var_1_19 ? (var_1_10 == ((unsigned char) ((((0) < (var_1_12)) ? (0) : (var_1_12))))) : ((! (var_1_5 > (255.9 / var_1_13))) ? (var_1_10 == ((unsigned char) var_1_12)) : 1))) && ((! var_1_19) ? ((((var_1_15 - var_1_16) - var_1_17) <= var_1_13) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (((var_1_17 <= (- var_1_16)) && var_1_19) ? (var_1_18 == ((signed short int) var_1_10)) : 1)) && ((var_1_9 > 0) ? (var_1_19 == ((unsigned char) ((var_1_5 >= (- var_1_15)) && (var_1_11 && (var_1_20 && var_1_21))))) : 1)) && (var_1_19 ? (var_1_22 == ((unsigned long int) (var_1_9 + var_1_10))) : (var_1_22 == ((unsigned long int) (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10)))))) ; [L171] RET, EXPR property() [L171] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=4, var_1_11=1, var_1_12=4, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=4, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=-52, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=10000000004, var_1_29=0, var_1_30=0, var_1_31=10000000004, var_1_32=-2, var_1_33=-2, var_1_34=0, var_1_35=0, var_1_36=10000000004, var_1_9=-56] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=200, var_1_10=4, var_1_11=1, var_1_12=4, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=4, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=-52, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=10000000004, var_1_29=0, var_1_30=0, var_1_31=10000000004, var_1_32=-2, var_1_33=-2, var_1_34=0, var_1_35=0, var_1_36=10000000004, var_1_9=-56] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 5, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 166 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 901 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 438 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 463 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151occurred in iteration=3, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 144 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 927 NumberOfCodeBlocks, 927 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 736 ConstructedInterpolants, 0 QuantifiedInterpolants, 862 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 6960/6960 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-24 06:09:24,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-80.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 4bb7209f06eb90a60dcbe2d649d5deab37b76f9df595c124e6bf4c05ffd58895 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:09:26,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:09:27,024 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 06:09:27,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:09:27,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:09:27,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:09:27,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:09:27,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:09:27,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:09:27,075 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:09:27,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:09:27,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:09:27,079 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:09:27,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:09:27,080 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:09:27,080 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:09:27,080 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:09:27,081 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:09:27,081 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:09:27,081 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:09:27,082 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:09:27,082 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:09:27,083 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:09:27,083 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 06:09:27,083 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 06:09:27,083 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:09:27,084 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 06:09:27,084 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:09:27,084 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:09:27,084 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:09:27,085 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:09:27,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:09:27,085 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:09:27,085 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:09:27,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:09:27,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:09:27,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:09:27,087 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:09:27,087 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 06:09:27,087 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 06:09:27,087 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:09:27,088 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:09:27,088 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:09:27,088 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:09:27,088 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 06:09:27,089 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> 4bb7209f06eb90a60dcbe2d649d5deab37b76f9df595c124e6bf4c05ffd58895 [2024-10-24 06:09:27,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:09:27,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:09:27,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:09:27,495 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:09:27,496 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:09:27,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-80.i [2024-10-24 06:09:29,194 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:09:29,463 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:09:29,463 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-80.i [2024-10-24 06:09:29,480 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/997a38800/e79f0707254a4d78af899784d6383aed/FLAGb20fbc101 [2024-10-24 06:09:29,497 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/997a38800/e79f0707254a4d78af899784d6383aed [2024-10-24 06:09:29,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:09:29,501 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:09:29,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:09:29,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:09:29,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:09:29,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:09:29" (1/1) ... [2024-10-24 06:09:29,510 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c1e8a32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:29, skipping insertion in model container [2024-10-24 06:09:29,510 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:09:29" (1/1) ... [2024-10-24 06:09:29,542 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:09:29,738 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_fillercodesize_ps-cn-10_file-80.i[915,928] [2024-10-24 06:09:29,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:09:29,848 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:09:29,862 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_fillercodesize_ps-cn-10_file-80.i[915,928] [2024-10-24 06:09:29,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:09:29,960 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:09:29,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:29 WrapperNode [2024-10-24 06:09:29,962 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:09:29,963 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:09:29,963 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:09:29,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:09:29,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:29" (1/1) ... [2024-10-24 06:09:29,986 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:29" (1/1) ... [2024-10-24 06:09:30,033 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2024-10-24 06:09:30,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:09:30,034 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:09:30,034 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:09:30,035 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:09:30,054 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:29" (1/1) ... [2024-10-24 06:09:30,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:29" (1/1) ... [2024-10-24 06:09:30,061 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:29" (1/1) ... [2024-10-24 06:09:30,083 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-24 06:09:30,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:29" (1/1) ... [2024-10-24 06:09:30,084 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:29" (1/1) ... [2024-10-24 06:09:30,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:29" (1/1) ... [2024-10-24 06:09:30,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:29" (1/1) ... [2024-10-24 06:09:30,112 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:29" (1/1) ... [2024-10-24 06:09:30,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:29" (1/1) ... [2024-10-24 06:09:30,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:09:30,128 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:09:30,128 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:09:30,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:09:30,129 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:29" (1/1) ... [2024-10-24 06:09:30,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:09:30,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:09:30,169 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 06:09:30,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 06:09:30,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:09:30,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 06:09:30,219 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:09:30,219 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:09:30,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:09:30,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:09:30,314 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:09:30,317 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:09:51,498 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 06:09:51,499 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:09:51,558 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:09:51,558 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:09:51,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:09:51 BoogieIcfgContainer [2024-10-24 06:09:51,559 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:09:51,562 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:09:51,562 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:09:51,568 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:09:51,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:09:29" (1/3) ... [2024-10-24 06:09:51,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b307ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:09:51, skipping insertion in model container [2024-10-24 06:09:51,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:09:29" (2/3) ... [2024-10-24 06:09:51,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b307ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:09:51, skipping insertion in model container [2024-10-24 06:09:51,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:09:51" (3/3) ... [2024-10-24 06:09:51,574 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-80.i [2024-10-24 06:09:51,594 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:09:51,595 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:09:51,679 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:09:51,685 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;@12ab684b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:09:51,686 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:09:51,691 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 06:09:51,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-24 06:09:51,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:09:51,706 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:09:51,707 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:09:51,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:09:51,713 INFO L85 PathProgramCache]: Analyzing trace with hash 53126306, now seen corresponding path program 1 times [2024-10-24 06:09:51,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:09:51,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989313623] [2024-10-24 06:09:51,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:09:51,732 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-24 06:09:51,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:09:51,736 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-24 06:09:51,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-24 06:09:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:53,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 06:09:53,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:09:53,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 778 proven. 0 refuted. 0 times theorem prover too weak. 962 trivial. 0 not checked. [2024-10-24 06:09:53,266 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:09:53,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:09:53,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989313623] [2024-10-24 06:09:53,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989313623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:09:53,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:09:53,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:09:53,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266311234] [2024-10-24 06:09:53,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:09:53,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:09:53,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:09:53,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:09:53,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:09:53,313 INFO L87 Difference]: Start difference. First operand has 74 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) 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, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 06:09:57,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:09:57,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:09:57,747 INFO L93 Difference]: Finished difference Result 145 states and 260 transitions. [2024-10-24 06:09:57,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:09:57,877 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, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 184 [2024-10-24 06:09:57,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:09:57,883 INFO L225 Difference]: With dead ends: 145 [2024-10-24 06:09:57,883 INFO L226 Difference]: Without dead ends: 72 [2024-10-24 06:09:57,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 183 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-24 06:09:57,890 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-24 06:09:57,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-10-24 06:09:57,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-24 06:09:57,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-24 06:09:57,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 06:09:57,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 110 transitions. [2024-10-24 06:09:57,943 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 110 transitions. Word has length 184 [2024-10-24 06:09:57,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:09:57,944 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 110 transitions. [2024-10-24 06:09:57,944 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, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 06:09:57,944 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 110 transitions. [2024-10-24 06:09:57,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-24 06:09:57,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:09:57,952 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:09:57,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-24 06:09:58,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-24 06:09:58,154 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:09:58,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:09:58,155 INFO L85 PathProgramCache]: Analyzing trace with hash -141751010, now seen corresponding path program 1 times [2024-10-24 06:09:58,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:09:58,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422464209] [2024-10-24 06:09:58,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:09:58,156 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-24 06:09:58,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:09:58,159 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-24 06:09:58,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-24 06:09:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:09:59,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 06:09:59,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:09:59,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 06:09:59,759 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:09:59,759 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:09:59,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422464209] [2024-10-24 06:09:59,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1422464209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:09:59,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:09:59,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:09:59,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97235409] [2024-10-24 06:09:59,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:09:59,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:09:59,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:09:59,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:09:59,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:09:59,771 INFO L87 Difference]: Start difference. First operand 72 states and 110 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 06:10:04,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-24 06:10:08,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-24 06:10:12,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:10:16,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-24 06:10:20,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-24 06:10:21,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:10:21,100 INFO L93 Difference]: Finished difference Result 214 states and 328 transitions. [2024-10-24 06:10:21,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:10:21,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 184 [2024-10-24 06:10:21,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:10:21,105 INFO L225 Difference]: With dead ends: 214 [2024-10-24 06:10:21,105 INFO L226 Difference]: Without dead ends: 143 [2024-10-24 06:10:21,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:10:21,108 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 106 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:10:21,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 306 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 5 Unknown, 0 Unchecked, 21.1s Time] [2024-10-24 06:10:21,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-24 06:10:21,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 74. [2024-10-24 06:10:21,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 06:10:21,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 112 transitions. [2024-10-24 06:10:21,130 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 112 transitions. Word has length 184 [2024-10-24 06:10:21,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:10:21,132 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 112 transitions. [2024-10-24 06:10:21,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 06:10:21,133 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 112 transitions. [2024-10-24 06:10:21,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-24 06:10:21,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:10:21,138 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:10:21,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-10-24 06:10:21,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-24 06:10:21,340 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:10:21,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:10:21,340 INFO L85 PathProgramCache]: Analyzing trace with hash 538307360, now seen corresponding path program 1 times [2024-10-24 06:10:21,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:10:21,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020706916] [2024-10-24 06:10:21,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:10:21,342 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-24 06:10:21,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:10:21,343 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-24 06:10:21,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-24 06:10:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:22,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 06:10:22,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:10:28,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 06:10:28,379 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:10:28,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:10:28,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020706916] [2024-10-24 06:10:28,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020706916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:10:28,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:10:28,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:10:28,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56892830] [2024-10-24 06:10:28,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:10:28,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:10:28,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:10:28,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:10:28,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:10:28,384 INFO L87 Difference]: Start difference. First operand 74 states and 112 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 06:10:33,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:10:37,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:10:41,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:10:41,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:10:41,238 INFO L93 Difference]: Finished difference Result 218 states and 330 transitions. [2024-10-24 06:10:41,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:10:41,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 184 [2024-10-24 06:10:41,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:10:41,243 INFO L225 Difference]: With dead ends: 218 [2024-10-24 06:10:41,243 INFO L226 Difference]: Without dead ends: 145 [2024-10-24 06:10:41,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:10:41,246 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 14 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2024-10-24 06:10:41,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 205 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 3 Unknown, 0 Unchecked, 12.8s Time] [2024-10-24 06:10:41,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-24 06:10:41,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2024-10-24 06:10:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 80 states have (on average 1.175) internal successors, (94), 80 states have internal predecessors, (94), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 06:10:41,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 214 transitions. [2024-10-24 06:10:41,273 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 214 transitions. Word has length 184 [2024-10-24 06:10:41,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:10:41,274 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 214 transitions. [2024-10-24 06:10:41,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 06:10:41,274 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 214 transitions. [2024-10-24 06:10:41,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-24 06:10:41,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:10:41,280 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:10:41,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2024-10-24 06:10:41,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-24 06:10:41,481 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:10:41,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:10:41,482 INFO L85 PathProgramCache]: Analyzing trace with hash 557466526, now seen corresponding path program 1 times [2024-10-24 06:10:41,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:10:41,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047588406] [2024-10-24 06:10:41,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:10:41,483 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-24 06:10:41,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:10:41,487 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-24 06:10:41,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (5)] Waiting until timeout for monitored process [2024-10-24 06:10:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:10:42,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 06:10:42,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:10:48,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 06:10:48,997 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:10:48,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:10:48,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047588406] [2024-10-24 06:10:48,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047588406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:10:48,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:10:48,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:10:49,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986927942] [2024-10-24 06:10:49,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:10:49,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:10:49,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:10:49,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:10:49,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:10:49,003 INFO L87 Difference]: Start difference. First operand 143 states and 214 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30)