./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-17.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 3980aec6b620dedacc05e58a868efa4198422dba376226818fb2c2d10e4fc0b3 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:21:41,299 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:21:41,393 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:21:41,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:21:41,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:21:41,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:21:41,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:21:41,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:21:41,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:21:41,415 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:21:41,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:21:41,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:21:41,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:21:41,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:21:41,421 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:21:41,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:21:41,421 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:21:41,422 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:21:41,422 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:21:41,422 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:21:41,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:21:41,423 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:21:41,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:21:41,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:21:41,423 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:21:41,424 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:21:41,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:21:41,424 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:21:41,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:21:41,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:21:41,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:21:41,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:21:41,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:21:41,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:21:41,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:21:41,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:21:41,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:21:41,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:21:41,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:21:41,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:21:41,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:21:41,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:21:41,428 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 -> 3980aec6b620dedacc05e58a868efa4198422dba376226818fb2c2d10e4fc0b3 [2024-11-09 00:21:41,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:21:41,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:21:41,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:21:41,699 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:21:41,700 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:21:41,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-17.i [2024-11-09 00:21:43,143 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:21:43,340 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:21:43,341 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-17.i [2024-11-09 00:21:43,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/008e1a71e/325771f36ceb472fa7fc83780ef5babd/FLAGfbc0fa6b2 [2024-11-09 00:21:43,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/008e1a71e/325771f36ceb472fa7fc83780ef5babd [2024-11-09 00:21:43,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:21:43,715 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:21:43,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:21:43,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:21:43,730 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:21:43,731 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:21:43" (1/1) ... [2024-11-09 00:21:43,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f03cef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:43, skipping insertion in model container [2024-11-09 00:21:43,732 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:21:43" (1/1) ... [2024-11-09 00:21:43,759 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:21:43,927 WARN L250 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_operatoramount_amount100_file-17.i[916,929] [2024-11-09 00:21:44,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:21:44,034 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:21:44,068 WARN L250 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_operatoramount_amount100_file-17.i[916,929] [2024-11-09 00:21:44,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:21:44,174 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:21:44,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:44 WrapperNode [2024-11-09 00:21:44,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:21:44,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:21:44,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:21:44,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:21:44,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:44" (1/1) ... [2024-11-09 00:21:44,200 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:44" (1/1) ... [2024-11-09 00:21:44,239 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 225 [2024-11-09 00:21:44,240 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:21:44,244 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:21:44,244 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:21:44,245 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:21:44,254 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:44" (1/1) ... [2024-11-09 00:21:44,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:44" (1/1) ... [2024-11-09 00:21:44,262 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:44" (1/1) ... [2024-11-09 00:21:44,292 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-11-09 00:21:44,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:44" (1/1) ... [2024-11-09 00:21:44,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:44" (1/1) ... [2024-11-09 00:21:44,307 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:44" (1/1) ... [2024-11-09 00:21:44,315 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:44" (1/1) ... [2024-11-09 00:21:44,319 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:44" (1/1) ... [2024-11-09 00:21:44,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:44" (1/1) ... [2024-11-09 00:21:44,330 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:21:44,331 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:21:44,331 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:21:44,332 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:21:44,332 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:44" (1/1) ... [2024-11-09 00:21:44,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:21:44,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:21:44,374 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-11-09 00:21:44,377 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-11-09 00:21:44,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:21:44,426 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:21:44,426 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:21:44,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:21:44,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:21:44,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:21:44,509 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:21:44,511 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:21:44,943 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-09 00:21:44,944 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:21:44,956 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:21:44,957 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:21:44,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:21:44 BoogieIcfgContainer [2024-11-09 00:21:44,957 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:21:44,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:21:44,959 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:21:44,962 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:21:44,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:21:43" (1/3) ... [2024-11-09 00:21:44,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bfb16ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:21:44, skipping insertion in model container [2024-11-09 00:21:44,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:44" (2/3) ... [2024-11-09 00:21:44,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bfb16ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:21:44, skipping insertion in model container [2024-11-09 00:21:44,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:21:44" (3/3) ... [2024-11-09 00:21:44,964 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-17.i [2024-11-09 00:21:44,979 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:21:44,979 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:21:45,039 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:21:45,045 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;@5a376ab1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:21:45,045 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:21:45,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 70 states have internal predecessors, (98), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 00:21:45,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-09 00:21:45,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:21:45,063 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:21:45,063 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:21:45,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:21:45,068 INFO L85 PathProgramCache]: Analyzing trace with hash -2003996029, now seen corresponding path program 1 times [2024-11-09 00:21:45,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:21:45,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832848596] [2024-11-09 00:21:45,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:45,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:21:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:21:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:21:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:21:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:21:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:21:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:21:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:21:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:21:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:21:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:21:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:21:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:21:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:21:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:21:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:21:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:21:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:21:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:21:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:21:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:21:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:21:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 00:21:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 00:21:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-09 00:21:45,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:21:45,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832848596] [2024-11-09 00:21:45,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832848596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:21:45,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:21:45,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:21:45,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780101309] [2024-11-09 00:21:45,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:21:45,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:21:45,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:21:45,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:21:45,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:21:45,603 INFO L87 Difference]: Start difference. First operand has 96 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 70 states have internal predecessors, (98), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-09 00:21:45,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:21:45,641 INFO L93 Difference]: Finished difference Result 185 states and 310 transitions. [2024-11-09 00:21:45,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:21:45,646 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 167 [2024-11-09 00:21:45,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:21:45,653 INFO L225 Difference]: With dead ends: 185 [2024-11-09 00:21:45,654 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 00:21:45,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-11-09 00:21:45,664 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:21:45,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:21:45,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 00:21:45,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-09 00:21:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.378787878787879) internal successors, (91), 66 states have internal predecessors, (91), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 00:21:45,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 139 transitions. [2024-11-09 00:21:45,717 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 139 transitions. Word has length 167 [2024-11-09 00:21:45,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:21:45,718 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 139 transitions. [2024-11-09 00:21:45,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-09 00:21:45,718 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 139 transitions. [2024-11-09 00:21:45,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-09 00:21:45,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:21:45,722 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:21:45,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:21:45,723 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:21:45,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:21:45,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2143567311, now seen corresponding path program 1 times [2024-11-09 00:21:45,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:21:45,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922718323] [2024-11-09 00:21:45,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:45,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:46,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:21:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:46,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:21:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:46,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:21:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:46,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:21:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:46,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:21:46,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:46,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:21:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:46,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:21:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:46,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:21:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:46,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:21:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:46,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:21:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:46,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:21:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:46,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:21:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:46,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:21:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:46,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:21:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:46,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:21:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:46,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:21:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:46,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:21:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:46,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:21:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:46,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:21:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:46,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:21:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:46,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:21:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:46,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:21:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:46,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 00:21:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:46,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 00:21:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:46,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-09 00:21:46,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:21:46,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922718323] [2024-11-09 00:21:46,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922718323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:21:46,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:21:46,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 00:21:46,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670392032] [2024-11-09 00:21:46,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:21:46,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:21:46,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:21:46,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:21:46,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:21:46,269 INFO L87 Difference]: Start difference. First operand 92 states and 139 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-09 00:21:46,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:21:46,525 INFO L93 Difference]: Finished difference Result 282 states and 431 transitions. [2024-11-09 00:21:46,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:21:46,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 167 [2024-11-09 00:21:46,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:21:46,528 INFO L225 Difference]: With dead ends: 282 [2024-11-09 00:21:46,531 INFO L226 Difference]: Without dead ends: 193 [2024-11-09 00:21:46,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 00:21:46,533 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 200 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:21:46,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 378 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:21:46,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-09 00:21:46,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 178. [2024-11-09 00:21:46,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 127 states have (on average 1.3779527559055118) internal successors, (175), 127 states have internal predecessors, (175), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 00:21:46,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 271 transitions. [2024-11-09 00:21:46,601 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 271 transitions. Word has length 167 [2024-11-09 00:21:46,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:21:46,602 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 271 transitions. [2024-11-09 00:21:46,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-09 00:21:46,602 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 271 transitions. [2024-11-09 00:21:46,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-09 00:21:46,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:21:46,609 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:21:46,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:21:46,609 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:21:46,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:21:46,610 INFO L85 PathProgramCache]: Analyzing trace with hash 650116325, now seen corresponding path program 1 times [2024-11-09 00:21:46,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:21:46,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208940090] [2024-11-09 00:21:46,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:46,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:47,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:21:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:47,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:21:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:47,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:21:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:47,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:21:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:47,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:21:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:47,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:21:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:47,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:21:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:47,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:21:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:47,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:21:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:47,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:21:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:47,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:21:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:47,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:21:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:47,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:21:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:47,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:21:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:47,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:21:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:47,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:21:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:47,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:21:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:47,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:21:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:47,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:21:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:47,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:21:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:47,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:21:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:47,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:21:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:47,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 00:21:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:47,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 00:21:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:47,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-09 00:21:47,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:21:47,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208940090] [2024-11-09 00:21:47,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208940090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:21:47,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:21:47,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 00:21:47,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249002329] [2024-11-09 00:21:47,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:21:47,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 00:21:47,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:21:47,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 00:21:47,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-09 00:21:47,698 INFO L87 Difference]: Start difference. First operand 178 states and 271 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-09 00:21:48,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:21:48,259 INFO L93 Difference]: Finished difference Result 458 states and 694 transitions. [2024-11-09 00:21:48,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 00:21:48,259 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 168 [2024-11-09 00:21:48,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:21:48,264 INFO L225 Difference]: With dead ends: 458 [2024-11-09 00:21:48,264 INFO L226 Difference]: Without dead ends: 369 [2024-11-09 00:21:48,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-09 00:21:48,266 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 332 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 00:21:48,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 480 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 00:21:48,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-09 00:21:48,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 235. [2024-11-09 00:21:48,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 159 states have (on average 1.3522012578616351) internal successors, (215), 159 states have internal predecessors, (215), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-09 00:21:48,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 359 transitions. [2024-11-09 00:21:48,318 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 359 transitions. Word has length 168 [2024-11-09 00:21:48,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:21:48,319 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 359 transitions. [2024-11-09 00:21:48,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-09 00:21:48,319 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 359 transitions. [2024-11-09 00:21:48,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-09 00:21:48,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:21:48,325 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:21:48,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:21:48,325 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:21:48,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:21:48,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1038827417, now seen corresponding path program 1 times [2024-11-09 00:21:48,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:21:48,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476911438] [2024-11-09 00:21:48,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:48,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:21:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:21:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:21:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:21:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:21:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:21:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:21:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:21:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:21:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:21:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:21:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:21:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:21:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:21:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:21:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:21:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:21:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:21:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:21:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:21:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:21:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:21:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 00:21:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 00:21:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 3 proven. 66 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-09 00:21:48,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:21:48,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476911438] [2024-11-09 00:21:48,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476911438] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:21:48,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800368440] [2024-11-09 00:21:48,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:48,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:21:48,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:21:48,699 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:21:48,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 00:21:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:48,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 00:21:48,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:21:49,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 113 proven. 66 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2024-11-09 00:21:49,149 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:21:49,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 3 proven. 66 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-09 00:21:49,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800368440] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:21:49,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:21:49,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-09 00:21:49,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133224758] [2024-11-09 00:21:49,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:21:49,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 00:21:49,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:21:49,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 00:21:49,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:21:49,367 INFO L87 Difference]: Start difference. First operand 235 states and 359 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-09 00:21:49,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:21:49,516 INFO L93 Difference]: Finished difference Result 439 states and 655 transitions. [2024-11-09 00:21:49,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 00:21:49,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 168 [2024-11-09 00:21:49,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:21:49,519 INFO L225 Difference]: With dead ends: 439 [2024-11-09 00:21:49,519 INFO L226 Difference]: Without dead ends: 259 [2024-11-09 00:21:49,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 380 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-09 00:21:49,521 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 68 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:21:49,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 284 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:21:49,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-09 00:21:49,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 247. [2024-11-09 00:21:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 168 states have (on average 1.3154761904761905) internal successors, (221), 168 states have internal predecessors, (221), 72 states have call successors, (72), 6 states have call predecessors, (72), 6 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-09 00:21:49,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 365 transitions. [2024-11-09 00:21:49,545 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 365 transitions. Word has length 168 [2024-11-09 00:21:49,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:21:49,546 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 365 transitions. [2024-11-09 00:21:49,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-09 00:21:49,546 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 365 transitions. [2024-11-09 00:21:49,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-09 00:21:49,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:21:49,547 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:21:49,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 00:21:49,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:21:49,749 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:21:49,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:21:49,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1172840923, now seen corresponding path program 1 times [2024-11-09 00:21:49,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:21:49,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912328151] [2024-11-09 00:21:49,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:49,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:21:49,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [669106621] [2024-11-09 00:21:49,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:49,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:21:49,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:21:49,943 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:21:49,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 00:21:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:50,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 00:21:50,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:21:50,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-09 00:21:50,632 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:21:50,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:21:50,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912328151] [2024-11-09 00:21:50,633 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 00:21:50,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669106621] [2024-11-09 00:21:50,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669106621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:21:50,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:21:50,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:21:50,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825995913] [2024-11-09 00:21:50,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:21:50,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:21:50,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:21:50,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:21:50,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:21:50,640 INFO L87 Difference]: Start difference. First operand 247 states and 365 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-09 00:21:50,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:21:50,861 INFO L93 Difference]: Finished difference Result 508 states and 751 transitions. [2024-11-09 00:21:50,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 00:21:50,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 168 [2024-11-09 00:21:50,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:21:50,869 INFO L225 Difference]: With dead ends: 508 [2024-11-09 00:21:50,869 INFO L226 Difference]: Without dead ends: 317 [2024-11-09 00:21:50,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:21:50,874 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 95 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:21:50,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 460 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:21:50,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-09 00:21:50,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 247. [2024-11-09 00:21:50,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 168 states have (on average 1.3095238095238095) internal successors, (220), 168 states have internal predecessors, (220), 72 states have call successors, (72), 6 states have call predecessors, (72), 6 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-09 00:21:50,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 364 transitions. [2024-11-09 00:21:50,909 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 364 transitions. Word has length 168 [2024-11-09 00:21:50,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:21:50,910 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 364 transitions. [2024-11-09 00:21:50,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-09 00:21:50,910 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 364 transitions. [2024-11-09 00:21:50,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 00:21:50,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:21:50,911 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:21:50,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 00:21:51,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:21:51,113 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:21:51,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:21:51,114 INFO L85 PathProgramCache]: Analyzing trace with hash 26139922, now seen corresponding path program 1 times [2024-11-09 00:21:51,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:21:51,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469710726] [2024-11-09 00:21:51,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:51,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:21:51,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [93552658] [2024-11-09 00:21:51,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:21:51,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:21:51,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:21:51,287 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:21:51,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 00:21:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:21:51,464 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:21:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:21:51,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:21:51,615 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:21:51,616 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:21:51,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 00:21:51,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:21:51,822 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-09 00:21:51,934 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:21:51,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:21:51 BoogieIcfgContainer [2024-11-09 00:21:51,937 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:21:51,938 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:21:51,938 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:21:51,938 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:21:51,938 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:21:44" (3/4) ... [2024-11-09 00:21:51,940 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:21:51,941 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:21:51,942 INFO L158 Benchmark]: Toolchain (without parser) took 8227.27ms. Allocated memory was 182.5MB in the beginning and 289.4MB in the end (delta: 107.0MB). Free memory was 115.7MB in the beginning and 182.4MB in the end (delta: -66.6MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2024-11-09 00:21:51,942 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory was 77.6MB in the beginning and 77.4MB in the end (delta: 134.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:21:51,942 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.00ms. Allocated memory is still 182.5MB. Free memory was 115.5MB in the beginning and 151.6MB in the end (delta: -36.1MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2024-11-09 00:21:51,942 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.83ms. Allocated memory is still 182.5MB. Free memory was 151.6MB in the beginning and 146.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:21:51,943 INFO L158 Benchmark]: Boogie Preprocessor took 86.24ms. Allocated memory is still 182.5MB. Free memory was 146.4MB in the beginning and 139.0MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 00:21:51,943 INFO L158 Benchmark]: RCFGBuilder took 626.12ms. Allocated memory is still 182.5MB. Free memory was 139.0MB in the beginning and 106.5MB in the end (delta: 32.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-09 00:21:51,943 INFO L158 Benchmark]: TraceAbstraction took 6978.20ms. Allocated memory was 182.5MB in the beginning and 289.4MB in the end (delta: 107.0MB). Free memory was 105.4MB in the beginning and 182.4MB in the end (delta: -76.9MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2024-11-09 00:21:51,943 INFO L158 Benchmark]: Witness Printer took 3.68ms. Allocated memory is still 289.4MB. Free memory is still 182.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:21:51,944 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.14ms. Allocated memory is still 113.2MB. Free memory was 77.6MB in the beginning and 77.4MB in the end (delta: 134.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 459.00ms. Allocated memory is still 182.5MB. Free memory was 115.5MB in the beginning and 151.6MB in the end (delta: -36.1MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.83ms. Allocated memory is still 182.5MB. Free memory was 151.6MB in the beginning and 146.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.24ms. Allocated memory is still 182.5MB. Free memory was 146.4MB in the beginning and 139.0MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 626.12ms. Allocated memory is still 182.5MB. Free memory was 139.0MB in the beginning and 106.5MB in the end (delta: 32.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6978.20ms. Allocated memory was 182.5MB in the beginning and 289.4MB in the end (delta: 107.0MB). Free memory was 105.4MB in the beginning and 182.4MB in the end (delta: -76.9MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * Witness Printer took 3.68ms. Allocated memory is still 289.4MB. Free memory is still 182.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 178, overapproximation of someBinaryArithmeticDOUBLEoperation at line 114, overapproximation of someUnaryDOUBLEoperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 178, overapproximation of someBinaryArithmeticFLOAToperation at line 108. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_8 = 0; [L24] unsigned char var_1_9 = 1; [L25] signed short int var_1_10 = 1000; [L26] signed long int var_1_11 = -10; [L27] signed short int var_1_12 = 16; [L28] signed short int var_1_14 = 0; [L29] double var_1_16 = 7.3; [L30] double var_1_17 = 0.2; [L31] float var_1_18 = 3.5; [L32] float var_1_19 = 128.2; [L33] float var_1_20 = 5.8; [L34] signed char var_1_21 = 16; [L35] unsigned char var_1_22 = 1; [L36] signed long int var_1_23 = -128; [L37] unsigned short int var_1_24 = 128; [L38] float var_1_26 = 31.25; [L39] float var_1_27 = 0.6; [L40] float var_1_28 = 127.2; [L41] float var_1_29 = 128.18; [L42] float var_1_30 = 31.8; [L43] unsigned char var_1_31 = 25; [L44] unsigned char var_1_33 = 5; [L45] unsigned char var_1_34 = 2; [L46] unsigned char var_1_35 = 128; [L47] unsigned char last_1_var_1_1 = 1; [L48] signed short int last_1_var_1_14 = 0; [L49] signed long int last_1_var_1_23 = -128; [L50] unsigned char last_1_var_1_31 = 25; VAL [isInitial=0, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L182] isInitial = 1 [L183] FCALL initially() [L184] COND TRUE 1 [L185] CALL updateLastVariables() [L172] last_1_var_1_1 = var_1_1 [L173] last_1_var_1_14 = var_1_14 [L174] last_1_var_1_23 = var_1_23 [L175] last_1_var_1_31 = var_1_31 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L185] RET updateLastVariables() [L186] CALL updateVariables() [L132] var_1_8 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_9=1] [L133] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_9=1] [L134] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L134] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L135] var_1_9 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L136] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L137] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L137] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L138] var_1_11 = __VERIFIER_nondet_long() [L139] CALL assume_abort_if_not(var_1_11 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L139] RET assume_abort_if_not(var_1_11 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L140] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L140] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L142] var_1_12 = __VERIFIER_nondet_short() [L143] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L143] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_12 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L144] RET assume_abort_if_not(var_1_12 <= 32766) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L145] var_1_17 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L146] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L147] var_1_19 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L148] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L149] var_1_21 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_21 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L150] RET assume_abort_if_not(var_1_21 >= -128) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L151] CALL assume_abort_if_not(var_1_21 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L151] RET assume_abort_if_not(var_1_21 <= 127) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L152] CALL assume_abort_if_not(var_1_21 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L152] RET assume_abort_if_not(var_1_21 != 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L153] var_1_27 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_27 >= -115292.1504606845700e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 1152921.504606845700e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L154] RET assume_abort_if_not((var_1_27 >= -115292.1504606845700e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 1152921.504606845700e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L155] var_1_28 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_28 >= -115292.1504606845700e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 1152921.504606845700e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L156] RET assume_abort_if_not((var_1_28 >= -115292.1504606845700e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 1152921.504606845700e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L157] var_1_29 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_29 >= 0.0F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L158] RET assume_abort_if_not((var_1_29 >= 0.0F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L159] var_1_30 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L160] RET assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L161] var_1_33 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L162] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_33 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L163] RET assume_abort_if_not(var_1_33 <= 64) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L164] var_1_34 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_35=128, var_1_8=0, var_1_9=1] [L165] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_35=128, var_1_8=0, var_1_9=1] [L166] CALL assume_abort_if_not(var_1_34 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=128, var_1_8=0, var_1_9=1] [L166] RET assume_abort_if_not(var_1_34 <= 63) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=128, var_1_8=0, var_1_9=1] [L167] var_1_35 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_35 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L168] RET assume_abort_if_not(var_1_35 >= 127) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_35 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L169] RET assume_abort_if_not(var_1_35 <= 254) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L186] RET updateVariables() [L187] CALL step() [L54] COND TRUE (-16 * last_1_var_1_23) > (((((last_1_var_1_23) < (last_1_var_1_23)) ? (last_1_var_1_23) : (last_1_var_1_23))) / var_1_11) [L55] var_1_10 = ((((last_1_var_1_14) < (last_1_var_1_23)) ? (last_1_var_1_14) : (last_1_var_1_23))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L59] signed long int stepLocal_8 = last_1_var_1_14; [L60] unsigned char stepLocal_7 = last_1_var_1_14 <= (last_1_var_1_14 * var_1_12); VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_7=1, stepLocal_8=0, var_1_10=-128, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L61] COND TRUE stepLocal_7 && last_1_var_1_1 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_8=0, var_1_10=-128, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L62] COND FALSE !(last_1_var_1_31 <= stepLocal_8) [L69] var_1_31 = var_1_33 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L74] var_1_14 = (-2 + (last_1_var_1_31 + last_1_var_1_31)) [L75] unsigned char stepLocal_1 = var_1_31; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_1=0, var_1_10=-128, var_1_11=-129, var_1_12=-1, var_1_14=48, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L76] COND TRUE stepLocal_1 == (-128 * var_1_31) [L77] var_1_16 = (((((0.875 + (var_1_17 + 64.4))) > (1.0000000000000005E15)) ? ((0.875 + (var_1_17 + 64.4))) : (1.0000000000000005E15))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L81] COND FALSE !(\read(var_1_8)) [L84] var_1_26 = ((((var_1_17) < ((var_1_29 - var_1_30))) ? (var_1_17) : ((var_1_29 - var_1_30)))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L86] signed short int stepLocal_6 = var_1_10; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_6=-128, var_1_10=-128, var_1_11=-129, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L87] COND TRUE stepLocal_6 >= ((((var_1_11) < ((var_1_31 * var_1_14))) ? (var_1_11) : ((var_1_31 * var_1_14)))) [L88] var_1_24 = ((((var_1_31) < (var_1_31)) ? (var_1_31) : (var_1_31))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L92] signed long int stepLocal_5 = 25 * var_1_14; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_5=1200, var_1_10=-128, var_1_11=-129, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L93] COND TRUE ! (var_1_31 <= var_1_10) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_5=1200, var_1_10=-128, var_1_11=-129, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L94] COND FALSE !(var_1_10 >= stepLocal_5) [L97] var_1_23 = ((var_1_10 + var_1_14) + var_1_24) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L100] unsigned char stepLocal_0 = ((((var_1_24) < (var_1_14)) ? (var_1_24) : (var_1_14))) > var_1_31; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_0=0, var_1_10=-128, var_1_11=-129, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L101] EXPR var_1_31 | var_1_24 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_0=0, var_1_10=-128, var_1_11=-129, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L101] COND TRUE ((var_1_31 | var_1_24) <= var_1_31) || stepLocal_0 [L102] var_1_1 = ((! 1) && var_1_8) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=0, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L106] unsigned char stepLocal_2 = var_1_31; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_2=0, var_1_10=-128, var_1_11=-129, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=0, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L107] COND TRUE ((var_1_24 + -16) * var_1_23) >= stepLocal_2 [L108] var_1_18 = (64.9f + var_1_19) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_1=0, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L112] signed long int stepLocal_3 = var_1_14 % var_1_21; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_3=1, var_1_10=-128, var_1_11=-129, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_1=0, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L113] EXPR var_1_31 & var_1_24 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_3=1, var_1_10=-128, var_1_11=-129, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_1=0, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L113] COND TRUE stepLocal_3 >= (var_1_31 & var_1_24) [L114] var_1_20 = ((((((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) < (var_1_19)) ? (((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) : (var_1_19))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L118] unsigned long int stepLocal_4 = ~ (var_1_31 * 128u); VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_4=4294967295, var_1_10=-128, var_1_11=-129, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L119] COND FALSE !(! (var_1_10 <= var_1_23)) [L128] var_1_22 = var_1_9 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_4=4294967295, var_1_10=-128, var_1_11=-129, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L187] RET step() [L188] CALL, EXPR property() [L178] EXPR var_1_31 | var_1_24 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L178] EXPR ((((((((var_1_31 | var_1_24) <= var_1_31) || (((((var_1_24) < (var_1_14)) ? (var_1_24) : (var_1_14))) > var_1_31)) ? (var_1_1 == ((unsigned char) ((! 1) && var_1_8))) : (var_1_1 == ((unsigned char) var_1_9))) && (((-16 * last_1_var_1_23) > (((((last_1_var_1_23) < (last_1_var_1_23)) ? (last_1_var_1_23) : (last_1_var_1_23))) / var_1_11)) ? (var_1_10 == ((signed short int) ((((last_1_var_1_14) < (last_1_var_1_23)) ? (last_1_var_1_14) : (last_1_var_1_23))))) : (var_1_10 == ((signed short int) (last_1_var_1_31 - last_1_var_1_31))))) && (var_1_14 == ((signed short int) (-2 + (last_1_var_1_31 + last_1_var_1_31))))) && ((var_1_31 == (-128 * var_1_31)) ? (var_1_16 == ((double) (((((0.875 + (var_1_17 + 64.4))) > (1.0000000000000005E15)) ? ((0.875 + (var_1_17 + 64.4))) : (1.0000000000000005E15))))) : (var_1_16 == ((double) var_1_17)))) && ((((var_1_24 + -16) * var_1_23) >= var_1_31) ? (var_1_18 == ((float) (64.9f + var_1_19))) : (var_1_18 == ((float) var_1_17)))) && (((var_1_14 % var_1_21) >= (var_1_31 & var_1_24)) ? (var_1_20 == ((float) ((((((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) < (var_1_19)) ? (((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) : (var_1_19))))) : (var_1_20 == ((float) var_1_19))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L178-L179] return (((((((((((((var_1_31 | var_1_24) <= var_1_31) || (((((var_1_24) < (var_1_14)) ? (var_1_24) : (var_1_14))) > var_1_31)) ? (var_1_1 == ((unsigned char) ((! 1) && var_1_8))) : (var_1_1 == ((unsigned char) var_1_9))) && (((-16 * last_1_var_1_23) > (((((last_1_var_1_23) < (last_1_var_1_23)) ? (last_1_var_1_23) : (last_1_var_1_23))) / var_1_11)) ? (var_1_10 == ((signed short int) ((((last_1_var_1_14) < (last_1_var_1_23)) ? (last_1_var_1_14) : (last_1_var_1_23))))) : (var_1_10 == ((signed short int) (last_1_var_1_31 - last_1_var_1_31))))) && (var_1_14 == ((signed short int) (-2 + (last_1_var_1_31 + last_1_var_1_31))))) && ((var_1_31 == (-128 * var_1_31)) ? (var_1_16 == ((double) (((((0.875 + (var_1_17 + 64.4))) > (1.0000000000000005E15)) ? ((0.875 + (var_1_17 + 64.4))) : (1.0000000000000005E15))))) : (var_1_16 == ((double) var_1_17)))) && ((((var_1_24 + -16) * var_1_23) >= var_1_31) ? (var_1_18 == ((float) (64.9f + var_1_19))) : (var_1_18 == ((float) var_1_17)))) && (((var_1_14 % var_1_21) >= (var_1_31 & var_1_24)) ? (var_1_20 == ((float) ((((((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) < (var_1_19)) ? (((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) : (var_1_19))))) : (var_1_20 == ((float) var_1_19)))) && ((! (var_1_10 <= var_1_23)) ? (var_1_1 ? (((~ (var_1_31 * 128u)) == var_1_23) ? (var_1_22 == ((unsigned char) (! var_1_9))) : 1) : (var_1_22 == ((unsigned char) var_1_9))) : (var_1_22 == ((unsigned char) var_1_9)))) && ((! (var_1_31 <= var_1_10)) ? ((var_1_10 >= (25 * var_1_14)) ? (var_1_23 == ((signed long int) ((((var_1_24) < (var_1_10)) ? (var_1_24) : (var_1_10))))) : (var_1_23 == ((signed long int) ((var_1_10 + var_1_14) + var_1_24)))) : 1)) && ((var_1_10 >= ((((var_1_11) < ((var_1_31 * var_1_14))) ? (var_1_11) : ((var_1_31 * var_1_14))))) ? (var_1_24 == ((unsigned short int) ((((var_1_31) < (var_1_31)) ? (var_1_31) : (var_1_31))))) : (var_1_24 == ((unsigned short int) var_1_31)))) && (var_1_8 ? (var_1_26 == ((float) (var_1_19 + ((var_1_27 + var_1_28) + var_1_17)))) : (var_1_26 == ((float) ((((var_1_17) < ((var_1_29 - var_1_30))) ? (var_1_17) : ((var_1_29 - var_1_30)))))))) && (((last_1_var_1_14 <= (last_1_var_1_14 * var_1_12)) && last_1_var_1_1) ? ((last_1_var_1_31 <= last_1_var_1_14) ? (((- var_1_19) >= var_1_17) ? (var_1_31 == ((unsigned char) (128 - ((((100) < ((var_1_33 + var_1_34))) ? (100) : ((var_1_33 + var_1_34))))))) : (var_1_31 == ((unsigned char) (var_1_35 - 5)))) : (var_1_31 == ((unsigned char) var_1_33))) : (var_1_31 == ((unsigned char) var_1_33))) ; [L188] RET, EXPR property() [L188] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 6, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 695 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 695 mSDsluCounter, 1741 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1088 mSDsCounter, 226 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 678 IncrementalHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 226 mSolverCounterUnsat, 653 mSDtfsCounter, 678 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 747 GetRequests, 719 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=4, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 231 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1512 NumberOfCodeBlocks, 1512 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1167 ConstructedInterpolants, 0 QuantifiedInterpolants, 4672 SizeOfPredicates, 4 NumberOfNonLiveVariables, 801 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 7530/7728 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-11-09 00:21:51,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-17.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 3980aec6b620dedacc05e58a868efa4198422dba376226818fb2c2d10e4fc0b3 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:21:54,096 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:21:54,172 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:21:54,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:21:54,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:21:54,218 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:21:54,218 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:21:54,218 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:21:54,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:21:54,223 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:21:54,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:21:54,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:21:54,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:21:54,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:21:54,224 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:21:54,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:21:54,225 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:21:54,225 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:21:54,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:21:54,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:21:54,225 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:21:54,228 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:21:54,228 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:21:54,228 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:21:54,228 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:21:54,229 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:21:54,229 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:21:54,229 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:21:54,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:21:54,230 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:21:54,230 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:21:54,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:21:54,231 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:21:54,231 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:21:54,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:21:54,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:21:54,232 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:21:54,232 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:21:54,232 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:21:54,232 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:21:54,232 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:21:54,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:21:54,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:21:54,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:21:54,238 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 -> 3980aec6b620dedacc05e58a868efa4198422dba376226818fb2c2d10e4fc0b3 [2024-11-09 00:21:54,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:21:54,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:21:54,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:21:54,597 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:21:54,597 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:21:54,598 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-17.i [2024-11-09 00:21:56,019 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:21:56,257 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:21:56,258 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-17.i [2024-11-09 00:21:56,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83a915385/415b67fa11914e478bd6ffc5b40ac00b/FLAG609305fa7 [2024-11-09 00:21:56,291 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83a915385/415b67fa11914e478bd6ffc5b40ac00b [2024-11-09 00:21:56,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:21:56,296 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:21:56,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:21:56,297 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:21:56,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:21:56,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:21:56" (1/1) ... [2024-11-09 00:21:56,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72025bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:56, skipping insertion in model container [2024-11-09 00:21:56,305 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:21:56" (1/1) ... [2024-11-09 00:21:56,341 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:21:56,529 WARN L250 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_operatoramount_amount100_file-17.i[916,929] [2024-11-09 00:21:56,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:21:56,649 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:21:56,661 WARN L250 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_operatoramount_amount100_file-17.i[916,929] [2024-11-09 00:21:56,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:21:56,730 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:21:56,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:56 WrapperNode [2024-11-09 00:21:56,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:21:56,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:21:56,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:21:56,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:21:56,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:56" (1/1) ... [2024-11-09 00:21:56,759 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:56" (1/1) ... [2024-11-09 00:21:56,793 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 181 [2024-11-09 00:21:56,793 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:21:56,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:21:56,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:21:56,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:21:56,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:56" (1/1) ... [2024-11-09 00:21:56,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:56" (1/1) ... [2024-11-09 00:21:56,814 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:56" (1/1) ... [2024-11-09 00:21:56,832 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-11-09 00:21:56,833 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:56" (1/1) ... [2024-11-09 00:21:56,833 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:56" (1/1) ... [2024-11-09 00:21:56,845 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:56" (1/1) ... [2024-11-09 00:21:56,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:56" (1/1) ... [2024-11-09 00:21:56,851 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:56" (1/1) ... [2024-11-09 00:21:56,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:56" (1/1) ... [2024-11-09 00:21:56,858 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:21:56,859 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:21:56,859 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:21:56,859 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:21:56,860 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:56" (1/1) ... [2024-11-09 00:21:56,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:21:56,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:21:56,909 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-11-09 00:21:56,919 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-11-09 00:21:56,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:21:56,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:21:56,972 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:21:56,973 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:21:56,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:21:56,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:21:57,073 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:21:57,077 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:22:09,971 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-09 00:22:09,971 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:22:09,986 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:22:09,987 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:22:09,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:22:09 BoogieIcfgContainer [2024-11-09 00:22:09,987 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:22:09,992 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:22:09,992 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:22:09,996 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:22:09,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:21:56" (1/3) ... [2024-11-09 00:22:09,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514acb17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:22:09, skipping insertion in model container [2024-11-09 00:22:09,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:21:56" (2/3) ... [2024-11-09 00:22:09,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514acb17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:22:09, skipping insertion in model container [2024-11-09 00:22:09,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:22:09" (3/3) ... [2024-11-09 00:22:10,000 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-17.i [2024-11-09 00:22:10,016 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:22:10,016 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:22:10,067 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:22:10,079 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;@2ec3b0fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:22:10,080 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:22:10,085 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 54 states have internal predecessors, (73), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 00:22:10,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-09 00:22:10,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:22:10,106 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:22:10,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:22:10,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:22:10,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1871605942, now seen corresponding path program 1 times [2024-11-09 00:22:10,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:22:10,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661503577] [2024-11-09 00:22:10,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:22:10,129 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-11-09 00:22:10,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:22:10,135 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-11-09 00:22:10,144 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-11-09 00:22:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:10,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:22:11,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:22:11,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-09 00:22:11,051 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:22:11,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:22:11,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661503577] [2024-11-09 00:22:11,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661503577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:22:11,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:22:11,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:22:11,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342458925] [2024-11-09 00:22:11,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:22:11,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:22:11,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:22:11,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:22:11,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:22:11,086 INFO L87 Difference]: Start difference. First operand has 80 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 54 states have internal predecessors, (73), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-09 00:22:11,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:22:11,118 INFO L93 Difference]: Finished difference Result 153 states and 260 transitions. [2024-11-09 00:22:11,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:22:11,121 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2024-11-09 00:22:11,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:22:11,127 INFO L225 Difference]: With dead ends: 153 [2024-11-09 00:22:11,128 INFO L226 Difference]: Without dead ends: 76 [2024-11-09 00:22:11,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 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-11-09 00:22:11,135 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:22:11,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:22:11,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-09 00:22:11,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-09 00:22:11,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.32) internal successors, (66), 50 states have internal predecessors, (66), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 00:22:11,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2024-11-09 00:22:11,183 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 161 [2024-11-09 00:22:11,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:22:11,184 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2024-11-09 00:22:11,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-09 00:22:11,185 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2024-11-09 00:22:11,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-09 00:22:11,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:22:11,189 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:22:11,254 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 (2)] Forceful destruction successful, exit code 0 [2024-11-09 00:22:11,389 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-11-09 00:22:11,390 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:22:11,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:22:11,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1102724202, now seen corresponding path program 1 times [2024-11-09 00:22:11,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:22:11,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989262534] [2024-11-09 00:22:11,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:22:11,396 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-11-09 00:22:11,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:22:11,397 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-11-09 00:22:11,399 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-11-09 00:22:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:12,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 00:22:12,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:22:19,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-09 00:22:19,894 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:22:19,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:22:19,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989262534] [2024-11-09 00:22:19,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989262534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:22:19,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:22:19,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:22:19,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817293906] [2024-11-09 00:22:19,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:22:19,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:22:19,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:22:19,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:22:19,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:22:19,901 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-09 00:22:25,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:22:29,526 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-11-09 00:22:33,539 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-11-09 00:22:38,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:22:42,084 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-11-09 00:22:46,096 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-11-09 00:22:46,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:22:46,097 INFO L93 Difference]: Finished difference Result 223 states and 337 transitions. [2024-11-09 00:22:46,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 00:22:46,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-11-09 00:22:46,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:22:46,205 INFO L225 Difference]: With dead ends: 223 [2024-11-09 00:22:46,205 INFO L226 Difference]: Without dead ends: 150 [2024-11-09 00:22:46,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:22:46,206 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 71 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 49 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.9s IncrementalHoareTripleChecker+Time [2024-11-09 00:22:46,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 371 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 76 Invalid, 6 Unknown, 0 Unchecked, 25.9s Time] [2024-11-09 00:22:46,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-09 00:22:46,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 123. [2024-11-09 00:22:46,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 72 states have internal predecessors, (89), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 00:22:46,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 185 transitions. [2024-11-09 00:22:46,236 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 185 transitions. Word has length 161 [2024-11-09 00:22:46,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:22:46,237 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 185 transitions. [2024-11-09 00:22:46,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-09 00:22:46,237 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 185 transitions. [2024-11-09 00:22:46,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-09 00:22:46,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:22:46,240 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:22:46,286 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-11-09 00:22:46,441 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-11-09 00:22:46,441 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:22:46,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:22:46,442 INFO L85 PathProgramCache]: Analyzing trace with hash 775383925, now seen corresponding path program 1 times [2024-11-09 00:22:46,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:22:46,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [898226281] [2024-11-09 00:22:46,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:22:46,443 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-11-09 00:22:46,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:22:46,445 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-11-09 00:22:46,446 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-11-09 00:22:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:47,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 00:22:47,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:22:51,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 113 proven. 66 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2024-11-09 00:22:51,142 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:22:54,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 3 proven. 66 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-09 00:22:54,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:22:54,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [898226281] [2024-11-09 00:22:54,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [898226281] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:22:54,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 00:22:54,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-09 00:22:54,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556577733] [2024-11-09 00:22:54,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 00:22:54,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 00:22:54,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:22:54,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 00:22:54,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:22:54,242 INFO L87 Difference]: Start difference. First operand 123 states and 185 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-09 00:23:01,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:23:05,565 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-11-09 00:23:09,576 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-11-09 00:23:09,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:23:09,581 INFO L93 Difference]: Finished difference Result 212 states and 310 transitions. [2024-11-09 00:23:09,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 00:23:09,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 162 [2024-11-09 00:23:09,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:23:09,700 INFO L225 Difference]: With dead ends: 212 [2024-11-09 00:23:09,700 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 00:23:09,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 316 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-09 00:23:09,702 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 122 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 12 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2024-11-09 00:23:09,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 208 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 128 Invalid, 3 Unknown, 0 Unchecked, 14.9s Time] [2024-11-09 00:23:09,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 00:23:09,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 131. [2024-11-09 00:23:09,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 78 states have (on average 1.205128205128205) internal successors, (94), 78 states have internal predecessors, (94), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 00:23:09,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 190 transitions. [2024-11-09 00:23:09,717 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 190 transitions. Word has length 162 [2024-11-09 00:23:09,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:23:09,717 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 190 transitions. [2024-11-09 00:23:09,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-09 00:23:09,718 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 190 transitions. [2024-11-09 00:23:09,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-09 00:23:09,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:23:09,720 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:23:09,753 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 (4)] Forceful destruction successful, exit code 0 [2024-11-09 00:23:09,923 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-11-09 00:23:09,924 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:23:09,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:23:09,924 INFO L85 PathProgramCache]: Analyzing trace with hash -812963977, now seen corresponding path program 1 times [2024-11-09 00:23:09,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:23:09,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427782028] [2024-11-09 00:23:09,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:23:09,925 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-11-09 00:23:09,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:23:09,926 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-11-09 00:23:09,932 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-11-09 00:23:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:10,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 00:23:10,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:23:19,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-09 00:23:19,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:23:19,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:23:19,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427782028] [2024-11-09 00:23:19,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1427782028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:23:19,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:23:19,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:23:19,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500979062] [2024-11-09 00:23:19,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:23:19,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:23:19,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:23:19,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:23:19,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:23:19,448 INFO L87 Difference]: Start difference. First operand 131 states and 190 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24)