./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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_fillercode_fillercodesize_ps-cn-10_file-85.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 c4862b5ebb887702302f2980511014b313d3fbe17ee23cc3bf7542b446fc70eb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 13:05:02,938 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 13:05:03,026 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 13:05:03,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 13:05:03,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 13:05:03,065 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 13:05:03,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 13:05:03,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 13:05:03,067 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 13:05:03,067 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 13:05:03,068 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 13:05:03,068 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 13:05:03,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 13:05:03,069 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 13:05:03,069 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 13:05:03,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 13:05:03,070 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 13:05:03,070 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 13:05:03,070 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 13:05:03,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 13:05:03,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 13:05:03,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 13:05:03,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 13:05:03,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 13:05:03,079 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 13:05:03,079 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 13:05:03,080 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 13:05:03,080 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 13:05:03,080 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 13:05:03,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 13:05:03,080 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 13:05:03,081 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 13:05:03,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:05:03,082 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 13:05:03,083 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 13:05:03,083 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 13:05:03,083 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 13:05:03,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 13:05:03,084 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 13:05:03,084 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 13:05:03,084 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 13:05:03,084 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 13:05:03,085 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 -> c4862b5ebb887702302f2980511014b313d3fbe17ee23cc3bf7542b446fc70eb [2024-11-16 13:05:03,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 13:05:03,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 13:05:03,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 13:05:03,387 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 13:05:03,387 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 13:05:03,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-85.i [2024-11-16 13:05:04,871 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 13:05:05,075 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 13:05:05,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-85.i [2024-11-16 13:05:05,085 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f048cc135/28ef6d0270aa40e39c2255ffd1685174/FLAGb9c156801 [2024-11-16 13:05:05,101 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f048cc135/28ef6d0270aa40e39c2255ffd1685174 [2024-11-16 13:05:05,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 13:05:05,105 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 13:05:05,106 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 13:05:05,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 13:05:05,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 13:05:05,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:05:05" (1/1) ... [2024-11-16 13:05:05,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6344756c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:05, skipping insertion in model container [2024-11-16 13:05:05,111 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:05:05" (1/1) ... [2024-11-16 13:05:05,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 13:05:05,292 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_fillercode_fillercodesize_ps-cn-10_file-85.i[915,928] [2024-11-16 13:05:05,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:05:05,362 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 13:05:05,373 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_fillercode_fillercodesize_ps-cn-10_file-85.i[915,928] [2024-11-16 13:05:05,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:05:05,420 INFO L204 MainTranslator]: Completed translation [2024-11-16 13:05:05,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:05 WrapperNode [2024-11-16 13:05:05,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 13:05:05,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 13:05:05,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 13:05:05,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 13:05:05,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:05" (1/1) ... [2024-11-16 13:05:05,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:05" (1/1) ... [2024-11-16 13:05:05,468 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2024-11-16 13:05:05,469 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 13:05:05,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 13:05:05,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 13:05:05,470 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 13:05:05,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:05" (1/1) ... [2024-11-16 13:05:05,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:05" (1/1) ... [2024-11-16 13:05:05,484 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:05" (1/1) ... [2024-11-16 13:05:05,507 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-16 13:05:05,508 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:05" (1/1) ... [2024-11-16 13:05:05,508 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:05" (1/1) ... [2024-11-16 13:05:05,520 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:05" (1/1) ... [2024-11-16 13:05:05,523 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:05" (1/1) ... [2024-11-16 13:05:05,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:05" (1/1) ... [2024-11-16 13:05:05,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:05" (1/1) ... [2024-11-16 13:05:05,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 13:05:05,535 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 13:05:05,535 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 13:05:05,536 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 13:05:05,536 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:05" (1/1) ... [2024-11-16 13:05:05,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:05:05,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:05:05,579 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-16 13:05:05,583 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-16 13:05:05,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 13:05:05,631 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 13:05:05,632 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 13:05:05,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 13:05:05,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 13:05:05,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 13:05:05,726 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 13:05:05,727 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 13:05:06,135 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-16 13:05:06,135 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 13:05:06,162 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 13:05:06,164 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-16 13:05:06,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:05:06 BoogieIcfgContainer [2024-11-16 13:05:06,165 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 13:05:06,167 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 13:05:06,167 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 13:05:06,172 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 13:05:06,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:05:05" (1/3) ... [2024-11-16 13:05:06,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d89aed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:05:06, skipping insertion in model container [2024-11-16 13:05:06,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:05" (2/3) ... [2024-11-16 13:05:06,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d89aed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:05:06, skipping insertion in model container [2024-11-16 13:05:06,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:05:06" (3/3) ... [2024-11-16 13:05:06,176 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-85.i [2024-11-16 13:05:06,194 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 13:05:06,195 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 13:05:06,247 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 13:05:06,254 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;@42b7cb2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 13:05:06,254 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 13:05:06,260 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-16 13:05:06,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-16 13:05:06,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:05:06,279 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:05:06,279 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:05:06,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:05:06,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1850398855, now seen corresponding path program 1 times [2024-11-16 13:05:06,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:05:06,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789947443] [2024-11-16 13:05:06,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:05:06,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:05:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:06,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:05:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:06,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:05:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:06,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:05:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:06,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:05:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:06,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 13:05:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:06,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:05:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:06,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 13:05:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:06,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 13:05:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:06,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 13:05:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:06,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:05:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:06,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 13:05:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:06,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 13:05:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:06,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 13:05:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:06,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 13:05:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:06,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:05:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:06,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:05:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:06,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:05:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:06,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:05:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:06,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:05:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:06,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:05:06,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:06,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 13:05:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:06,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:05:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-16 13:05:06,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:05:06,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789947443] [2024-11-16 13:05:06,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789947443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:05:06,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:05:06,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:05:06,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954784107] [2024-11-16 13:05:06,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:05:06,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 13:05:06,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:05:06,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 13:05:06,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:05:06,779 INFO L87 Difference]: Start difference. First operand has 77 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-16 13:05:06,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:05:06,821 INFO L93 Difference]: Finished difference Result 146 states and 247 transitions. [2024-11-16 13:05:06,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 13:05:06,825 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 146 [2024-11-16 13:05:06,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:05:06,835 INFO L225 Difference]: With dead ends: 146 [2024-11-16 13:05:06,835 INFO L226 Difference]: Without dead ends: 72 [2024-11-16 13:05:06,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-16 13:05:06,844 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:05:06,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:05:06,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-16 13:05:06,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-16 13:05:06,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-16 13:05:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 107 transitions. [2024-11-16 13:05:06,900 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 107 transitions. Word has length 146 [2024-11-16 13:05:06,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:05:06,900 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 107 transitions. [2024-11-16 13:05:06,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-16 13:05:06,901 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 107 transitions. [2024-11-16 13:05:06,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 13:05:06,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:05:06,906 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:05:06,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 13:05:06,907 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:05:06,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:05:06,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1410279119, now seen corresponding path program 1 times [2024-11-16 13:05:06,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:05:06,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409314785] [2024-11-16 13:05:06,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:05:06,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:05:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:07,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:05:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:07,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:05:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:07,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:05:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:07,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:05:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:07,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 13:05:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:07,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:05:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:08,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 13:05:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:08,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 13:05:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:08,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 13:05:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:08,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:05:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:08,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 13:05:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:08,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 13:05:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:08,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 13:05:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:08,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 13:05:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:08,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:05:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:08,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:05:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:08,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:05:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:08,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:05:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:08,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:05:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:08,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:05:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:08,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 13:05:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:08,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:05:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-16 13:05:08,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:05:08,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409314785] [2024-11-16 13:05:08,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409314785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:05:08,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:05:08,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 13:05:08,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130393192] [2024-11-16 13:05:08,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:05:08,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 13:05:08,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:05:08,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 13:05:08,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:05:08,128 INFO L87 Difference]: Start difference. First operand 72 states and 107 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-16 13:05:08,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:05:08,424 INFO L93 Difference]: Finished difference Result 212 states and 317 transitions. [2024-11-16 13:05:08,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 13:05:08,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2024-11-16 13:05:08,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:05:08,430 INFO L225 Difference]: With dead ends: 212 [2024-11-16 13:05:08,430 INFO L226 Difference]: Without dead ends: 143 [2024-11-16 13:05:08,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 13:05:08,432 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 86 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 13:05:08,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 332 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 13:05:08,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-16 13:05:08,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 123. [2024-11-16 13:05:08,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 76 states have (on average 1.263157894736842) internal successors, (96), 76 states have internal predecessors, (96), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-16 13:05:08,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 184 transitions. [2024-11-16 13:05:08,475 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 184 transitions. Word has length 147 [2024-11-16 13:05:08,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:05:08,476 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 184 transitions. [2024-11-16 13:05:08,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-16 13:05:08,476 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 184 transitions. [2024-11-16 13:05:08,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-16 13:05:08,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:05:08,482 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:05:08,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 13:05:08,482 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:05:08,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:05:08,483 INFO L85 PathProgramCache]: Analyzing trace with hash 716000857, now seen corresponding path program 1 times [2024-11-16 13:05:08,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:05:08,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317361977] [2024-11-16 13:05:08,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:05:08,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:05:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:09,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:05:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:09,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:05:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:09,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:05:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:09,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:05:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:09,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 13:05:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:09,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:05:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:09,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 13:05:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:09,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 13:05:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:09,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 13:05:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:09,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:05:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:09,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 13:05:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:09,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 13:05:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:09,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 13:05:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:09,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 13:05:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:09,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:05:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:09,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:05:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:09,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:05:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:09,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:05:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:09,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:05:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:09,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:05:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:09,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 13:05:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:09,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:05:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:09,332 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-16 13:05:09,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:05:09,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317361977] [2024-11-16 13:05:09,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317361977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:05:09,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:05:09,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 13:05:09,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908045766] [2024-11-16 13:05:09,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:05:09,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 13:05:09,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:05:09,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 13:05:09,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:05:09,338 INFO L87 Difference]: Start difference. First operand 123 states and 184 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-16 13:05:09,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:05:09,859 INFO L93 Difference]: Finished difference Result 228 states and 337 transitions. [2024-11-16 13:05:09,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 13:05:09,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-11-16 13:05:09,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:05:09,862 INFO L225 Difference]: With dead ends: 228 [2024-11-16 13:05:09,862 INFO L226 Difference]: Without dead ends: 159 [2024-11-16 13:05:09,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 13:05:09,868 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 120 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 13:05:09,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 338 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 13:05:09,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-16 13:05:09,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 131. [2024-11-16 13:05:09,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 84 states have internal predecessors, (108), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-16 13:05:09,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 196 transitions. [2024-11-16 13:05:09,899 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 196 transitions. Word has length 148 [2024-11-16 13:05:09,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:05:09,900 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 196 transitions. [2024-11-16 13:05:09,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-16 13:05:09,900 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 196 transitions. [2024-11-16 13:05:09,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-16 13:05:09,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:05:09,902 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:05:09,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 13:05:09,903 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:05:09,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:05:09,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1836156104, now seen corresponding path program 1 times [2024-11-16 13:05:09,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:05:09,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337873830] [2024-11-16 13:05:09,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:05:09,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:05:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:05:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:05:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:05:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:05:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 13:05:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:05:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 13:05:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 13:05:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 13:05:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:05:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 13:05:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 13:05:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 13:05:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 13:05:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:05:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:05:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:05:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:05:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:05:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:05:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 13:05:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:05:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,144 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-16 13:05:10,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:05:10,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337873830] [2024-11-16 13:05:10,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337873830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:05:10,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:05:10,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 13:05:10,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018176237] [2024-11-16 13:05:10,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:05:10,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 13:05:10,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:05:10,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 13:05:10,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:05:10,147 INFO L87 Difference]: Start difference. First operand 131 states and 196 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-16 13:05:10,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:05:10,307 INFO L93 Difference]: Finished difference Result 224 states and 333 transitions. [2024-11-16 13:05:10,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 13:05:10,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-11-16 13:05:10,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:05:10,310 INFO L225 Difference]: With dead ends: 224 [2024-11-16 13:05:10,310 INFO L226 Difference]: Without dead ends: 145 [2024-11-16 13:05:10,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 13:05:10,312 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 99 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 13:05:10,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 425 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 13:05:10,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-16 13:05:10,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2024-11-16 13:05:10,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 93 states have (on average 1.2795698924731183) internal successors, (119), 93 states have internal predecessors, (119), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-16 13:05:10,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions. [2024-11-16 13:05:10,336 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 207 transitions. Word has length 148 [2024-11-16 13:05:10,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:05:10,337 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 207 transitions. [2024-11-16 13:05:10,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-16 13:05:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 207 transitions. [2024-11-16 13:05:10,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 13:05:10,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:05:10,339 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:05:10,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 13:05:10,339 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:05:10,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:05:10,340 INFO L85 PathProgramCache]: Analyzing trace with hash -68848139, now seen corresponding path program 1 times [2024-11-16 13:05:10,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:05:10,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877547418] [2024-11-16 13:05:10,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:05:10,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:05:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:05:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:05:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:05:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:05:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 13:05:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:05:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 13:05:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 13:05:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 13:05:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:05:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 13:05:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 13:05:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 13:05:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 13:05:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:05:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:05:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:05:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:05:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:05:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:05:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 13:05:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:10,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:05:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:11,001 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 36 proven. 84 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2024-11-16 13:05:11,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:05:11,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877547418] [2024-11-16 13:05:11,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877547418] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:05:11,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753591819] [2024-11-16 13:05:11,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:05:11,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:05:11,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:05:11,006 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-16 13:05:11,010 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-16 13:05:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:11,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 13:05:11,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:05:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 505 proven. 84 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2024-11-16 13:05:11,781 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:05:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 36 proven. 27 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-16 13:05:12,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753591819] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 13:05:12,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 13:05:12,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 18 [2024-11-16 13:05:12,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835815220] [2024-11-16 13:05:12,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 13:05:12,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-16 13:05:12,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:05:12,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-16 13:05:12,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-11-16 13:05:12,119 INFO L87 Difference]: Start difference. First operand 141 states and 207 transitions. Second operand has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 4 states have call successors, (62), 3 states have call predecessors, (62), 6 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63) [2024-11-16 13:05:13,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:05:13,170 INFO L93 Difference]: Finished difference Result 384 states and 527 transitions. [2024-11-16 13:05:13,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-16 13:05:13,171 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 4 states have call successors, (62), 3 states have call predecessors, (62), 6 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63) Word has length 149 [2024-11-16 13:05:13,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:05:13,173 INFO L225 Difference]: With dead ends: 384 [2024-11-16 13:05:13,173 INFO L226 Difference]: Without dead ends: 306 [2024-11-16 13:05:13,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 332 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=448, Invalid=1622, Unknown=0, NotChecked=0, Total=2070 [2024-11-16 13:05:13,176 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 329 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 13:05:13,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 460 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 13:05:13,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-16 13:05:13,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 188. [2024-11-16 13:05:13,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 123 states have (on average 1.2113821138211383) internal successors, (149), 124 states have internal predecessors, (149), 55 states have call successors, (55), 9 states have call predecessors, (55), 9 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-16 13:05:13,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 259 transitions. [2024-11-16 13:05:13,230 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 259 transitions. Word has length 149 [2024-11-16 13:05:13,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:05:13,232 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 259 transitions. [2024-11-16 13:05:13,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 4 states have call successors, (62), 3 states have call predecessors, (62), 6 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63) [2024-11-16 13:05:13,232 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 259 transitions. [2024-11-16 13:05:13,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 13:05:13,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:05:13,235 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:05:13,254 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-16 13:05:13,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:05:13,437 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:05:13,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:05:13,438 INFO L85 PathProgramCache]: Analyzing trace with hash -265361644, now seen corresponding path program 1 times [2024-11-16 13:05:13,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:05:13,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771152116] [2024-11-16 13:05:13,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:05:13,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:05:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 13:05:13,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [619966718] [2024-11-16 13:05:13,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:05:13,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:05:13,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:05:13,520 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-16 13:05:13,522 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-16 13:05:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 13:05:13,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 13:05:13,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 13:05:13,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 13:05:13,781 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 13:05:13,783 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 13:05:13,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 13:05:13,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 13:05:13,989 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-16 13:05:14,122 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 13:05:14,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 01:05:14 BoogieIcfgContainer [2024-11-16 13:05:14,125 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 13:05:14,126 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 13:05:14,126 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 13:05:14,126 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 13:05:14,126 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:05:06" (3/4) ... [2024-11-16 13:05:14,132 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 13:05:14,133 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 13:05:14,133 INFO L158 Benchmark]: Toolchain (without parser) took 9028.61ms. Allocated memory was 146.8MB in the beginning and 232.8MB in the end (delta: 86.0MB). Free memory was 89.3MB in the beginning and 189.8MB in the end (delta: -100.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 13:05:14,134 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 146.8MB. Free memory is still 107.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 13:05:14,134 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.02ms. Allocated memory is still 146.8MB. Free memory was 89.3MB in the beginning and 72.9MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 13:05:14,135 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.27ms. Allocated memory is still 146.8MB. Free memory was 72.9MB in the beginning and 69.6MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 13:05:14,135 INFO L158 Benchmark]: Boogie Preprocessor took 65.11ms. Allocated memory is still 146.8MB. Free memory was 69.6MB in the beginning and 65.4MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 13:05:14,135 INFO L158 Benchmark]: IcfgBuilder took 629.71ms. Allocated memory was 146.8MB in the beginning and 192.9MB in the end (delta: 46.1MB). Free memory was 65.4MB in the beginning and 148.5MB in the end (delta: -83.2MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-11-16 13:05:14,136 INFO L158 Benchmark]: TraceAbstraction took 7957.96ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 147.5MB in the beginning and 190.8MB in the end (delta: -43.3MB). Peak memory consumption was 122.3MB. Max. memory is 16.1GB. [2024-11-16 13:05:14,136 INFO L158 Benchmark]: Witness Printer took 7.40ms. Allocated memory is still 232.8MB. Free memory was 190.8MB in the beginning and 189.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 13:05:14,138 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.22ms. Allocated memory is still 146.8MB. Free memory is still 107.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.02ms. Allocated memory is still 146.8MB. Free memory was 89.3MB in the beginning and 72.9MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.27ms. Allocated memory is still 146.8MB. Free memory was 72.9MB in the beginning and 69.6MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.11ms. Allocated memory is still 146.8MB. Free memory was 69.6MB in the beginning and 65.4MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 629.71ms. Allocated memory was 146.8MB in the beginning and 192.9MB in the end (delta: 46.1MB). Free memory was 65.4MB in the beginning and 148.5MB in the end (delta: -83.2MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7957.96ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 147.5MB in the beginning and 190.8MB in the end (delta: -43.3MB). Peak memory consumption was 122.3MB. Max. memory is 16.1GB. * Witness Printer took 7.40ms. Allocated memory is still 232.8MB. Free memory was 190.8MB in the beginning and 189.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 147, overapproximation of someBinaryDOUBLEComparisonOperation at line 147. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1000; [L23] unsigned char var_1_5 = 1; [L24] unsigned char var_1_6 = 0; [L25] float var_1_7 = 0.6; [L26] unsigned long int var_1_8 = 32; [L27] unsigned long int var_1_9 = 32; [L28] float var_1_11 = 5.5; [L29] unsigned long int var_1_12 = 128; [L30] unsigned char var_1_13 = 16; [L31] unsigned char var_1_14 = 0; [L32] unsigned long int var_1_15 = 8; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] double var_1_18 = 1.8; [L36] double var_1_19 = 4.5; [L37] double var_1_20 = 15.5; [L38] signed char var_1_21 = -5; [L39] signed char var_1_22 = 64; [L40] unsigned long int var_1_23 = 4; [L41] unsigned long int var_1_24 = 16; [L42] signed char var_1_25 = -100; [L43] float var_1_26 = 1000000.6; [L44] float var_1_27 = 4.5; [L45] double var_1_28 = 64.5; [L46] unsigned char var_1_29 = 0; [L47] unsigned long int last_1_var_1_1 = 1000; [L48] unsigned char last_1_var_1_5 = 1; [L49] unsigned long int last_1_var_1_12 = 128; [L50] unsigned char last_1_var_1_13 = 16; [L51] unsigned long int last_1_var_1_15 = 8; VAL [isInitial=0, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L151] isInitial = 1 [L152] FCALL initially() [L153] COND TRUE 1 [L154] CALL updateLastVariables() [L140] last_1_var_1_1 = var_1_1 [L141] last_1_var_1_5 = var_1_5 [L142] last_1_var_1_12 = var_1_12 [L143] last_1_var_1_13 = var_1_13 [L144] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L154] RET updateLastVariables() [L155] CALL updateVariables() [L104] var_1_6 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L105] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L106] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L106] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L107] var_1_8 = __VERIFIER_nondet_ulong() [L108] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L108] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L109] CALL assume_abort_if_not(var_1_8 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L109] RET assume_abort_if_not(var_1_8 <= 4294967295) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L110] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L110] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L111] var_1_9 = __VERIFIER_nondet_ulong() [L112] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32] [L112] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32] [L113] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32] [L113] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32] [L114] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L114] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L115] var_1_11 = __VERIFIER_nondet_float() [L116] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L116] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L117] var_1_14 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L118] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L119] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L120] var_1_17 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L121] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L122] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L123] var_1_19 = __VERIFIER_nondet_double() [L124] 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_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L124] 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_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L125] var_1_20 = __VERIFIER_nondet_double() [L126] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L126] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L127] var_1_22 = __VERIFIER_nondet_char() [L128] CALL assume_abort_if_not(var_1_22 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L128] RET assume_abort_if_not(var_1_22 >= -127) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L129] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L129] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L130] var_1_24 = __VERIFIER_nondet_ulong() [L131] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L131] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L132] CALL assume_abort_if_not(var_1_24 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=0, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=0, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L132] RET assume_abort_if_not(var_1_24 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=0, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L133] var_1_27 = __VERIFIER_nondet_float() [L134] CALL assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=0, var_1_25=-100, var_1_26=5000003/5, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=0, var_1_25=-100, var_1_26=5000003/5, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L134] RET assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=0, var_1_25=-100, var_1_26=5000003/5, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L135] var_1_29 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=0, var_1_25=-100, var_1_26=5000003/5, var_1_28=129/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=0, var_1_25=-100, var_1_26=5000003/5, var_1_28=129/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L136] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=0, var_1_25=-100, var_1_26=5000003/5, var_1_28=129/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L137] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=0, var_1_25=-100, var_1_26=5000003/5, var_1_28=129/2, var_1_29=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=0, var_1_25=-100, var_1_26=5000003/5, var_1_28=129/2, var_1_29=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L137] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=0, var_1_25=-100, var_1_26=5000003/5, var_1_28=129/2, var_1_29=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L155] RET updateVariables() [L156] CALL step() [L55] var_1_21 = var_1_22 [L56] var_1_23 = var_1_24 [L57] var_1_25 = var_1_22 [L58] var_1_26 = var_1_27 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=129/2, var_1_29=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L59] EXPR var_1_24 >> var_1_22 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=129/2, var_1_29=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L59] EXPR 256u ^ (var_1_24 >> var_1_22) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=129/2, var_1_29=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L59] COND TRUE (256u ^ (var_1_24 >> var_1_22)) != var_1_23 [L60] COND TRUE \read(var_1_29) [L61] var_1_28 = var_1_27 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L64] signed long int stepLocal_1 = last_1_var_1_13; [L65] signed long int stepLocal_0 = last_1_var_1_13; VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_1=16, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L66] COND TRUE stepLocal_1 < ((- last_1_var_1_12) * 64) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L67] COND TRUE \read(last_1_var_1_5) [L68] var_1_1 = ((((last_1_var_1_12) < 0 ) ? -(last_1_var_1_12) : (last_1_var_1_12))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L77] unsigned long int stepLocal_2 = last_1_var_1_15 + last_1_var_1_1; VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_2=1008, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L78] COND TRUE last_1_var_1_13 <= stepLocal_2 [L79] var_1_5 = ((last_1_var_1_15 == last_1_var_1_13) && var_1_6) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L83] unsigned char stepLocal_3 = var_1_5; VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_3=0, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L84] COND FALSE !(stepLocal_3 || var_1_17) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L87] var_1_13 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) [L88] var_1_16 = (var_1_6 && var_1_17) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L89] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=1] [L92] COND FALSE !((var_1_15 + (var_1_15 * var_1_13)) <= ((32u / var_1_8) / var_1_9)) [L97] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=3, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=32, var_1_9=1] [L99] COND TRUE var_1_7 <= (- (32.8f + var_1_7)) [L100] var_1_12 = last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=3, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=32, var_1_9=1] [L156] RET step() [L157] CALL, EXPR property() [L147-L148] return ((((((((last_1_var_1_13 < ((- last_1_var_1_12) * 64)) ? (last_1_var_1_5 ? (var_1_1 == ((unsigned long int) ((((last_1_var_1_12) < 0 ) ? -(last_1_var_1_12) : (last_1_var_1_12))))) : ((-10000000 < last_1_var_1_13) ? (var_1_1 == ((unsigned long int) (((((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))) < 0 ) ? -((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))) : ((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))))))) : (var_1_1 == ((unsigned long int) 50u)))) : 1) && ((last_1_var_1_13 <= (last_1_var_1_15 + last_1_var_1_1)) ? (var_1_5 == ((unsigned char) ((last_1_var_1_15 == last_1_var_1_13) && var_1_6))) : (var_1_5 == ((unsigned char) var_1_6)))) && (((var_1_15 + (var_1_15 * var_1_13)) <= ((32u / var_1_8) / var_1_9)) ? ((1.25f < var_1_18) ? (var_1_7 == ((float) 1000000.1f)) : 1) : (var_1_7 == ((float) var_1_11)))) && ((var_1_7 <= (- (32.8f + var_1_7))) ? (var_1_12 == ((unsigned long int) last_1_var_1_12)) : 1)) && (var_1_13 == ((unsigned char) ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) && (var_1_5 ? (var_1_15 == ((unsigned long int) ((((var_1_1) > ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) ? (var_1_1) : ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))))))))) : 1)) && (var_1_16 == ((unsigned char) (var_1_6 && var_1_17)))) && ((var_1_5 || var_1_17) ? (var_1_18 == ((double) ((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) + var_1_20) - 63.6))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=3, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=32, var_1_9=1] [L157] RET, EXPR property() [L157] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=3, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=32, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=3, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=32, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 6, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 646 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 634 mSDsluCounter, 1660 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1110 mSDsCounter, 363 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 809 IncrementalHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 363 mSolverCounterUnsat, 550 mSDtfsCounter, 809 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 602 GetRequests, 540 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=188occurred in iteration=5, InterpolantAutomatonStates: 54, 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, 170 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1185 NumberOfCodeBlocks, 1185 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1029 ConstructedInterpolants, 0 QuantifiedInterpolants, 4292 SizeOfPredicates, 4 NumberOfNonLiveVariables, 370 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 6273/6468 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-16 13:05:14,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_fillercode_fillercodesize_ps-cn-10_file-85.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 c4862b5ebb887702302f2980511014b313d3fbe17ee23cc3bf7542b446fc70eb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 13:05:16,443 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 13:05:16,527 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 13:05:16,534 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 13:05:16,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 13:05:16,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 13:05:16,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 13:05:16,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 13:05:16,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 13:05:16,572 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 13:05:16,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 13:05:16,573 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 13:05:16,573 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 13:05:16,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 13:05:16,574 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 13:05:16,574 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 13:05:16,574 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 13:05:16,575 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 13:05:16,575 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 13:05:16,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 13:05:16,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 13:05:16,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 13:05:16,578 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 13:05:16,578 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 13:05:16,578 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 13:05:16,578 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 13:05:16,579 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 13:05:16,579 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 13:05:16,579 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 13:05:16,579 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 13:05:16,580 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 13:05:16,580 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 13:05:16,580 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 13:05:16,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 13:05:16,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:05:16,581 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 13:05:16,581 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 13:05:16,582 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 13:05:16,583 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 13:05:16,583 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 13:05:16,583 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 13:05:16,583 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 13:05:16,584 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 13:05:16,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 13:05:16,584 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 -> c4862b5ebb887702302f2980511014b313d3fbe17ee23cc3bf7542b446fc70eb [2024-11-16 13:05:16,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 13:05:16,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 13:05:16,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 13:05:16,942 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 13:05:16,942 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 13:05:16,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-85.i [2024-11-16 13:05:18,456 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 13:05:18,682 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 13:05:18,683 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-85.i [2024-11-16 13:05:18,694 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5581d9bb/d41a53a24fdd4eb1afa5d4c4d7fd5007/FLAGf91e38952 [2024-11-16 13:05:18,714 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5581d9bb/d41a53a24fdd4eb1afa5d4c4d7fd5007 [2024-11-16 13:05:18,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 13:05:18,720 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 13:05:18,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 13:05:18,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 13:05:18,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 13:05:18,728 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:05:18" (1/1) ... [2024-11-16 13:05:18,729 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b8729ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:18, skipping insertion in model container [2024-11-16 13:05:18,729 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:05:18" (1/1) ... [2024-11-16 13:05:18,761 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 13:05:18,943 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_fillercode_fillercodesize_ps-cn-10_file-85.i[915,928] [2024-11-16 13:05:19,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:05:19,054 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 13:05:19,065 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_fillercode_fillercodesize_ps-cn-10_file-85.i[915,928] [2024-11-16 13:05:19,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:05:19,128 INFO L204 MainTranslator]: Completed translation [2024-11-16 13:05:19,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:19 WrapperNode [2024-11-16 13:05:19,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 13:05:19,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 13:05:19,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 13:05:19,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 13:05:19,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:19" (1/1) ... [2024-11-16 13:05:19,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:19" (1/1) ... [2024-11-16 13:05:19,184 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 158 [2024-11-16 13:05:19,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 13:05:19,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 13:05:19,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 13:05:19,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 13:05:19,198 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:19" (1/1) ... [2024-11-16 13:05:19,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:19" (1/1) ... [2024-11-16 13:05:19,203 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:19" (1/1) ... [2024-11-16 13:05:19,225 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-16 13:05:19,225 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:19" (1/1) ... [2024-11-16 13:05:19,226 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:19" (1/1) ... [2024-11-16 13:05:19,243 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:19" (1/1) ... [2024-11-16 13:05:19,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:19" (1/1) ... [2024-11-16 13:05:19,249 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:19" (1/1) ... [2024-11-16 13:05:19,251 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:19" (1/1) ... [2024-11-16 13:05:19,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 13:05:19,263 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 13:05:19,264 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 13:05:19,265 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 13:05:19,265 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:19" (1/1) ... [2024-11-16 13:05:19,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:05:19,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:05:19,296 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-16 13:05:19,303 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-16 13:05:19,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 13:05:19,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 13:05:19,343 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 13:05:19,343 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 13:05:19,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 13:05:19,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 13:05:19,434 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 13:05:19,436 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 13:05:22,015 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-16 13:05:22,015 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 13:05:22,026 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 13:05:22,027 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 13:05:22,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:05:22 BoogieIcfgContainer [2024-11-16 13:05:22,027 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 13:05:22,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 13:05:22,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 13:05:22,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 13:05:22,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:05:18" (1/3) ... [2024-11-16 13:05:22,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449ea397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:05:22, skipping insertion in model container [2024-11-16 13:05:22,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:05:19" (2/3) ... [2024-11-16 13:05:22,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449ea397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:05:22, skipping insertion in model container [2024-11-16 13:05:22,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:05:22" (3/3) ... [2024-11-16 13:05:22,034 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-85.i [2024-11-16 13:05:22,045 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 13:05:22,046 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 13:05:22,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 13:05:22,116 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;@2714043b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 13:05:22,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 13:05:22,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 47 states have internal predecessors, (62), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-16 13:05:22,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-16 13:05:22,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:05:22,137 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:05:22,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:05:22,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:05:22,142 INFO L85 PathProgramCache]: Analyzing trace with hash 2032430799, now seen corresponding path program 1 times [2024-11-16 13:05:22,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:05:22,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921149935] [2024-11-16 13:05:22,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:05:22,154 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-16 13:05:22,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:05:22,157 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-16 13:05:22,178 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-16 13:05:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:22,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 13:05:22,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:05:22,650 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-16 13:05:22,650 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:05:22,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:05:22,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [921149935] [2024-11-16 13:05:22,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [921149935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:05:22,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:05:22,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:05:22,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366412055] [2024-11-16 13:05:22,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:05:22,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 13:05:22,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:05:22,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 13:05:22,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:05:22,687 INFO L87 Difference]: Start difference. First operand has 71 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 47 states have internal predecessors, (62), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-16 13:05:22,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:05:22,722 INFO L93 Difference]: Finished difference Result 134 states and 227 transitions. [2024-11-16 13:05:22,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 13:05:22,724 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2024-11-16 13:05:22,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:05:22,732 INFO L225 Difference]: With dead ends: 134 [2024-11-16 13:05:22,733 INFO L226 Difference]: Without dead ends: 66 [2024-11-16 13:05:22,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 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-16 13:05:22,742 INFO L432 NwaCegarLoop]: 98 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, 98 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-16 13:05:22,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:05:22,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-16 13:05:22,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-16 13:05:22,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-16 13:05:22,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2024-11-16 13:05:22,786 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 144 [2024-11-16 13:05:22,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:05:22,787 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2024-11-16 13:05:22,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-16 13:05:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2024-11-16 13:05:22,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-16 13:05:22,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:05:22,790 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:05:22,804 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-16 13:05:22,991 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-16 13:05:22,991 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:05:22,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:05:22,992 INFO L85 PathProgramCache]: Analyzing trace with hash 198203541, now seen corresponding path program 1 times [2024-11-16 13:05:22,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:05:22,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947027871] [2024-11-16 13:05:22,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:05:22,994 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-16 13:05:22,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:05:22,996 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-16 13:05:22,999 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-16 13:05:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:23,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 13:05:23,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:05:24,099 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-16 13:05:24,099 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:05:24,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:05:24,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947027871] [2024-11-16 13:05:24,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947027871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:05:24,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:05:24,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 13:05:24,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808653139] [2024-11-16 13:05:24,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:05:24,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 13:05:24,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:05:24,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 13:05:24,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:05:24,103 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-16 13:05:25,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:05:25,687 INFO L93 Difference]: Finished difference Result 129 states and 193 transitions. [2024-11-16 13:05:25,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 13:05:25,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-11-16 13:05:25,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:05:25,708 INFO L225 Difference]: With dead ends: 129 [2024-11-16 13:05:25,708 INFO L226 Difference]: Without dead ends: 66 [2024-11-16 13:05:25,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-16 13:05:25,711 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 81 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-16 13:05:25,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 135 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-16 13:05:25,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-16 13:05:25,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-16 13:05:25,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-16 13:05:25,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2024-11-16 13:05:25,728 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 144 [2024-11-16 13:05:25,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:05:25,730 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2024-11-16 13:05:25,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-16 13:05:25,731 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2024-11-16 13:05:25,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-16 13:05:25,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:05:25,733 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:05:25,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 13:05:25,933 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-16 13:05:25,934 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:05:25,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:05:25,935 INFO L85 PathProgramCache]: Analyzing trace with hash -960644235, now seen corresponding path program 1 times [2024-11-16 13:05:25,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:05:25,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839971569] [2024-11-16 13:05:25,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:05:25,936 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-16 13:05:25,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:05:25,939 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-16 13:05:25,940 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-16 13:05:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:26,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 13:05:26,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:05:28,337 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 477 proven. 27 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 13:05:28,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:05:29,433 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 36 proven. 27 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-16 13:05:29,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:05:29,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839971569] [2024-11-16 13:05:29,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839971569] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 13:05:29,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 13:05:29,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2024-11-16 13:05:29,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868907611] [2024-11-16 13:05:29,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 13:05:29,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 13:05:29,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:05:29,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 13:05:29,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-16 13:05:29,439 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 4 states have call successors, (44), 3 states have call predecessors, (44), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2024-11-16 13:05:32,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:05:35,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:05:35,766 INFO L93 Difference]: Finished difference Result 258 states and 376 transitions. [2024-11-16 13:05:35,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 13:05:35,767 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 4 states have call successors, (44), 3 states have call predecessors, (44), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) Word has length 145 [2024-11-16 13:05:35,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:05:35,769 INFO L225 Difference]: With dead ends: 258 [2024-11-16 13:05:35,769 INFO L226 Difference]: Without dead ends: 195 [2024-11-16 13:05:35,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 277 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2024-11-16 13:05:35,772 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 284 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-16 13:05:35,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 530 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-11-16 13:05:35,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-16 13:05:35,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 156. [2024-11-16 13:05:35,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 96 states have (on average 1.2291666666666667) internal successors, (118), 97 states have internal predecessors, (118), 55 states have call successors, (55), 4 states have call predecessors, (55), 4 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-16 13:05:35,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 228 transitions. [2024-11-16 13:05:35,816 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 228 transitions. Word has length 145 [2024-11-16 13:05:35,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:05:35,817 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 228 transitions. [2024-11-16 13:05:35,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 4 states have call successors, (44), 3 states have call predecessors, (44), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2024-11-16 13:05:35,817 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 228 transitions. [2024-11-16 13:05:35,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-16 13:05:35,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:05:35,820 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:05:35,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-16 13:05:36,020 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-16 13:05:36,021 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:05:36,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:05:36,023 INFO L85 PathProgramCache]: Analyzing trace with hash 585652595, now seen corresponding path program 1 times [2024-11-16 13:05:36,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:05:36,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194294459] [2024-11-16 13:05:36,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:05:36,027 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-16 13:05:36,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:05:36,030 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-16 13:05:36,032 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-16 13:05:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:36,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-16 13:05:36,393 INFO L278 TraceCheckSpWp]: Computing forward predicates...