./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_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-?-c7c6ca5-m [2024-11-08 20:24:36,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:24:36,181 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 20:24:36,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:24:36,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:24:36,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:24:36,216 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:24:36,216 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:24:36,217 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:24:36,217 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:24:36,218 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:24:36,218 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:24:36,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:24:36,223 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:24:36,224 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:24:36,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:24:36,225 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:24:36,225 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:24:36,225 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 20:24:36,226 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:24:36,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:24:36,228 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:24:36,228 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:24:36,228 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:24:36,229 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:24:36,229 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:24:36,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:24:36,229 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:24:36,230 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:24:36,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:24:36,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:24:36,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:24:36,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:24:36,232 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:24:36,233 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:24:36,233 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:24:36,234 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 20:24:36,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 20:24:36,234 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:24:36,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:24:36,235 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:24:36,235 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:24:36,235 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-08 20:24:36,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:24:36,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:24:36,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:24:36,533 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:24:36,533 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:24:36,534 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-08 20:24:38,123 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:24:38,334 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:24:38,335 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-08 20:24:38,347 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfcc76ab6/82350486d04d4ae48b2635fba1e200bf/FLAGdf1b39f52 [2024-11-08 20:24:38,361 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfcc76ab6/82350486d04d4ae48b2635fba1e200bf [2024-11-08 20:24:38,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:24:38,364 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:24:38,365 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:24:38,365 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:24:38,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:24:38,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:24:38" (1/1) ... [2024-11-08 20:24:38,372 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35c3c100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:38, skipping insertion in model container [2024-11-08 20:24:38,372 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:24:38" (1/1) ... [2024-11-08 20:24:38,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:24:38,609 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-08 20:24:38,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:24:38,718 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:24:38,731 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-08 20:24:38,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:24:38,810 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:24:38,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:38 WrapperNode [2024-11-08 20:24:38,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:24:38,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:24:38,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:24:38,812 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:24:38,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:38" (1/1) ... [2024-11-08 20:24:38,827 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:38" (1/1) ... [2024-11-08 20:24:38,867 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2024-11-08 20:24:38,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:24:38,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:24:38,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:24:38,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:24:38,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:38" (1/1) ... [2024-11-08 20:24:38,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:38" (1/1) ... [2024-11-08 20:24:38,889 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:38" (1/1) ... [2024-11-08 20:24:38,916 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-08 20:24:38,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:38" (1/1) ... [2024-11-08 20:24:38,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:38" (1/1) ... [2024-11-08 20:24:38,932 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:38" (1/1) ... [2024-11-08 20:24:38,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:38" (1/1) ... [2024-11-08 20:24:38,947 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:38" (1/1) ... [2024-11-08 20:24:38,949 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:38" (1/1) ... [2024-11-08 20:24:38,955 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:24:38,956 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:24:38,956 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:24:38,956 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:24:38,959 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:38" (1/1) ... [2024-11-08 20:24:38,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:24:38,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:24:38,998 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-08 20:24:39,005 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-08 20:24:39,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:24:39,049 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:24:39,049 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:24:39,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 20:24:39,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:24:39,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:24:39,138 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:24:39,140 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:24:39,495 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-08 20:24:39,495 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:24:39,512 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:24:39,512 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:24:39,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:24:39 BoogieIcfgContainer [2024-11-08 20:24:39,513 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:24:39,516 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:24:39,516 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:24:39,520 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:24:39,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:24:38" (1/3) ... [2024-11-08 20:24:39,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45306855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:24:39, skipping insertion in model container [2024-11-08 20:24:39,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:38" (2/3) ... [2024-11-08 20:24:39,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45306855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:24:39, skipping insertion in model container [2024-11-08 20:24:39,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:24:39" (3/3) ... [2024-11-08 20:24:39,523 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-85.i [2024-11-08 20:24:39,539 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:24:39,539 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:24:39,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:24:39,611 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;@6ccd0530, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:24:39,612 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:24:39,616 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 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-08 20:24:39,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 20:24:39,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:24:39,629 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-08 20:24:39,629 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:24:39,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:24:39,634 INFO L85 PathProgramCache]: Analyzing trace with hash -141369586, now seen corresponding path program 1 times [2024-11-08 20:24:39,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:24:39,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028341930] [2024-11-08 20:24:39,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:24:39,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:24:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:39,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:24:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:39,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:24:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:39,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:24:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:39,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:24:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:39,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:24:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:40,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:24:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:40,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:24:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:40,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 20:24:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:40,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:24:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:40,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:24:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:40,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:24:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:40,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:24:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:40,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:24:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:40,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:24:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:40,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:24:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:40,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:24:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:40,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:24:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:40,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:24:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:40,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:24:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:40,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:24:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:40,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:24:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:40,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:24:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:40,130 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-08 20:24:40,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:24:40,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028341930] [2024-11-08 20:24:40,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028341930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:24:40,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:24:40,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:24:40,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587215204] [2024-11-08 20:24:40,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:24:40,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:24:40,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:24:40,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:24:40,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:24:40,174 INFO L87 Difference]: Start difference. First operand has 74 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 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 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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-08 20:24:40,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:24:40,206 INFO L93 Difference]: Finished difference Result 141 states and 242 transitions. [2024-11-08 20:24:40,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:24:40,208 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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 144 [2024-11-08 20:24:40,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:24:40,215 INFO L225 Difference]: With dead ends: 141 [2024-11-08 20:24:40,215 INFO L226 Difference]: Without dead ends: 70 [2024-11-08 20:24:40,219 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-08 20:24:40,222 INFO L432 NwaCegarLoop]: 105 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, 105 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-08 20:24:40,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:24:40,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-08 20:24:40,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-08 20:24:40,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 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-08 20:24:40,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 105 transitions. [2024-11-08 20:24:40,288 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 105 transitions. Word has length 144 [2024-11-08 20:24:40,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:24:40,291 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 105 transitions. [2024-11-08 20:24:40,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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-08 20:24:40,291 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 105 transitions. [2024-11-08 20:24:40,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 20:24:40,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:24:40,298 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-08 20:24:40,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 20:24:40,299 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:24:40,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:24:40,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1057895541, now seen corresponding path program 1 times [2024-11-08 20:24:40,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:24:40,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250601242] [2024-11-08 20:24:40,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:24:40,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:24:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:41,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:24:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:41,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:24:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:41,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:24:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:41,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:24:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:41,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:24:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:41,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:24:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:41,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:24:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:41,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 20:24:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:41,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:24:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:41,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:24:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:41,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:24:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:41,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:24:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:41,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:24:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:41,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:24:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:41,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:24:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:41,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:24:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:41,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:24:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:41,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:24:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:41,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:24:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:41,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:24:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:41,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:24:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:41,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:24:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:41,743 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-08 20:24:41,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:24:41,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250601242] [2024-11-08 20:24:41,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250601242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:24:41,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:24:41,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 20:24:41,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947447852] [2024-11-08 20:24:41,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:24:41,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 20:24:41,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:24:41,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 20:24:41,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:24:41,751 INFO L87 Difference]: Start difference. First operand 70 states and 105 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-08 20:24:42,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:24:42,132 INFO L93 Difference]: Finished difference Result 219 states and 329 transitions. [2024-11-08 20:24:42,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 20:24:42,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 145 [2024-11-08 20:24:42,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:24:42,139 INFO L225 Difference]: With dead ends: 219 [2024-11-08 20:24:42,140 INFO L226 Difference]: Without dead ends: 152 [2024-11-08 20:24:42,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 20:24:42,142 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 119 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 20:24:42,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 433 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 20:24:42,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-08 20:24:42,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 128. [2024-11-08 20:24:42,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 81 states have (on average 1.308641975308642) internal successors, (106), 81 states have internal predecessors, (106), 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-08 20:24:42,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 194 transitions. [2024-11-08 20:24:42,194 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 194 transitions. Word has length 145 [2024-11-08 20:24:42,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:24:42,195 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 194 transitions. [2024-11-08 20:24:42,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-08 20:24:42,198 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 194 transitions. [2024-11-08 20:24:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 20:24:42,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:24:42,201 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-08 20:24:42,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 20:24:42,202 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:24:42,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:24:42,202 INFO L85 PathProgramCache]: Analyzing trace with hash 717111821, now seen corresponding path program 1 times [2024-11-08 20:24:42,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:24:42,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719300169] [2024-11-08 20:24:42,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:24:42,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:24:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:24:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:24:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:24:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:24:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:24:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:24:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:24:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 20:24:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:24:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:24:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:24:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:24:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:24:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:24:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:24:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:24:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:24:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:24:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:24:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:24:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:24:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:43,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:24:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:43,011 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-08 20:24:43,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:24:43,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719300169] [2024-11-08 20:24:43,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719300169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:24:43,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:24:43,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:24:43,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349364706] [2024-11-08 20:24:43,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:24:43,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:24:43,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:24:43,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:24:43,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:24:43,017 INFO L87 Difference]: Start difference. First operand 128 states and 194 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-08 20:24:43,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:24:43,354 INFO L93 Difference]: Finished difference Result 215 states and 323 transitions. [2024-11-08 20:24:43,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:24:43,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 145 [2024-11-08 20:24:43,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:24:43,360 INFO L225 Difference]: With dead ends: 215 [2024-11-08 20:24:43,360 INFO L226 Difference]: Without dead ends: 142 [2024-11-08 20:24:43,361 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-08 20:24:43,364 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 83 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:24:43,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 332 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:24:43,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-08 20:24:43,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 128. [2024-11-08 20:24:43,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 81 states have internal predecessors, (105), 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-08 20:24:43,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 193 transitions. [2024-11-08 20:24:43,397 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 193 transitions. Word has length 145 [2024-11-08 20:24:43,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:24:43,397 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 193 transitions. [2024-11-08 20:24:43,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-08 20:24:43,398 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 193 transitions. [2024-11-08 20:24:43,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 20:24:43,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:24:43,414 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-08 20:24:43,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 20:24:43,415 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:24:43,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:24:43,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1691307619, now seen corresponding path program 1 times [2024-11-08 20:24:43,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:24:43,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885673394] [2024-11-08 20:24:43,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:24:43,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:24:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:43,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:24:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:43,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:24:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:43,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:24:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:43,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:24:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:43,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:24:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:43,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:24:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:43,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:24:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:43,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 20:24:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:43,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:24:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:43,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:24:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:43,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:24:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:43,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:24:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:43,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:24:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:43,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:24:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:43,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:24:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:43,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:24:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:43,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:24:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:43,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:24:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:43,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:24:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:43,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:24:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:43,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:24:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:43,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:24:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:43,660 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-08 20:24:43,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:24:43,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885673394] [2024-11-08 20:24:43,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885673394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:24:43,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:24:43,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:24:43,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462472643] [2024-11-08 20:24:43,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:24:43,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:24:43,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:24:43,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:24:43,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:24:43,663 INFO L87 Difference]: Start difference. First operand 128 states and 193 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-08 20:24:43,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:24:43,840 INFO L93 Difference]: Finished difference Result 219 states and 328 transitions. [2024-11-08 20:24:43,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:24:43,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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 146 [2024-11-08 20:24:43,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:24:43,843 INFO L225 Difference]: With dead ends: 219 [2024-11-08 20:24:43,843 INFO L226 Difference]: Without dead ends: 142 [2024-11-08 20:24:43,844 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-08 20:24:43,848 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 97 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:24:43,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 417 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:24:43,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-08 20:24:43,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2024-11-08 20:24:43,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 90 states have (on average 1.288888888888889) internal successors, (116), 90 states have internal predecessors, (116), 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-08 20:24:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 204 transitions. [2024-11-08 20:24:43,883 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 204 transitions. Word has length 146 [2024-11-08 20:24:43,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:24:43,884 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 204 transitions. [2024-11-08 20:24:43,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-08 20:24:43,885 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 204 transitions. [2024-11-08 20:24:43,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 20:24:43,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:24:43,890 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-08 20:24:43,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 20:24:43,891 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:24:43,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:24:43,891 INFO L85 PathProgramCache]: Analyzing trace with hash -2119471841, now seen corresponding path program 1 times [2024-11-08 20:24:43,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:24:43,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983898292] [2024-11-08 20:24:43,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:24:43,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:24:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:24:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:24:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:24:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:24:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:24:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:24:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:24:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 20:24:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:24:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:24:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:24:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:24:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:24:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:24:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:24:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:24:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:24:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:24:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:24:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:24:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:24:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:24:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,867 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-08 20:24:44,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:24:44,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983898292] [2024-11-08 20:24:44,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983898292] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:24:44,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167027273] [2024-11-08 20:24:44,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:24:44,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:24:44,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:24:44,871 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-08 20:24:44,891 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-08 20:24:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 20:24:45,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:24:45,694 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-08 20:24:45,695 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:24:46,243 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 36 proven. 87 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2024-11-08 20:24:46,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167027273] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 20:24:46,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 20:24:46,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2024-11-08 20:24:46,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688226432] [2024-11-08 20:24:46,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 20:24:46,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 20:24:46,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:24:46,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 20:24:46,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2024-11-08 20:24:46,247 INFO L87 Difference]: Start difference. First operand 138 states and 204 transitions. Second operand has 22 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 5 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) [2024-11-08 20:24:47,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:24:47,933 INFO L93 Difference]: Finished difference Result 315 states and 433 transitions. [2024-11-08 20:24:47,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-08 20:24:47,936 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 5 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) Word has length 147 [2024-11-08 20:24:47,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:24:47,938 INFO L225 Difference]: With dead ends: 315 [2024-11-08 20:24:47,938 INFO L226 Difference]: Without dead ends: 239 [2024-11-08 20:24:47,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 327 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=670, Invalid=2870, Unknown=0, NotChecked=0, Total=3540 [2024-11-08 20:24:47,943 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 526 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 20:24:47,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 574 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 20:24:47,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-08 20:24:47,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 150. [2024-11-08 20:24:47,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 97 states have (on average 1.2061855670103092) internal successors, (117), 97 states have internal predecessors, (117), 44 states have call successors, (44), 8 states have call predecessors, (44), 8 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 20:24:47,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 205 transitions. [2024-11-08 20:24:47,983 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 205 transitions. Word has length 147 [2024-11-08 20:24:47,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:24:47,984 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 205 transitions. [2024-11-08 20:24:47,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 5 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) [2024-11-08 20:24:47,985 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 205 transitions. [2024-11-08 20:24:47,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 20:24:47,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:24:47,988 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-08 20:24:48,006 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-08 20:24:48,192 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-08 20:24:48,193 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:24:48,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:24:48,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1439413471, now seen corresponding path program 1 times [2024-11-08 20:24:48,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:24:48,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773251473] [2024-11-08 20:24:48,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:24:48,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:24:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 20:24:48,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [136468802] [2024-11-08 20:24:48,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:24:48,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:24:48,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:24:48,302 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-08 20:24:48,304 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-08 20:24:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:24:48,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 20:24:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:24:48,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 20:24:48,834 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 20:24:48,835 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 20:24:48,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 20:24:49,039 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-08 20:24:49,043 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-08 20:24:49,164 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 20:24:49,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 08:24:49 BoogieIcfgContainer [2024-11-08 20:24:49,167 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 20:24:49,167 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 20:24:49,167 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 20:24:49,167 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 20:24:49,168 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:24:39" (3/4) ... [2024-11-08 20:24:49,172 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 20:24:49,174 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 20:24:49,174 INFO L158 Benchmark]: Toolchain (without parser) took 10810.23ms. Allocated memory was 132.1MB in the beginning and 285.2MB in the end (delta: 153.1MB). Free memory was 60.9MB in the beginning and 215.8MB in the end (delta: -154.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:24:49,174 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 132.1MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:24:49,175 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.96ms. Allocated memory was 132.1MB in the beginning and 197.1MB in the end (delta: 65.0MB). Free memory was 60.8MB in the beginning and 157.6MB in the end (delta: -96.9MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-11-08 20:24:49,175 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.71ms. Allocated memory is still 197.1MB. Free memory was 157.6MB in the beginning and 154.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 20:24:49,175 INFO L158 Benchmark]: Boogie Preprocessor took 87.72ms. Allocated memory is still 197.1MB. Free memory was 154.5MB in the beginning and 150.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 20:24:49,177 INFO L158 Benchmark]: RCFGBuilder took 556.45ms. Allocated memory is still 197.1MB. Free memory was 150.3MB in the beginning and 127.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-08 20:24:49,177 INFO L158 Benchmark]: TraceAbstraction took 9650.69ms. Allocated memory was 197.1MB in the beginning and 285.2MB in the end (delta: 88.1MB). Free memory was 126.2MB in the beginning and 215.8MB in the end (delta: -89.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:24:49,177 INFO L158 Benchmark]: Witness Printer took 6.52ms. Allocated memory is still 285.2MB. Free memory is still 215.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:24:49,178 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.13ms. Allocated memory is still 132.1MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.96ms. Allocated memory was 132.1MB in the beginning and 197.1MB in the end (delta: 65.0MB). Free memory was 60.8MB in the beginning and 157.6MB in the end (delta: -96.9MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.71ms. Allocated memory is still 197.1MB. Free memory was 157.6MB in the beginning and 154.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.72ms. Allocated memory is still 197.1MB. Free memory was 154.5MB in the beginning and 150.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 556.45ms. Allocated memory is still 197.1MB. Free memory was 150.3MB in the beginning and 127.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 9650.69ms. Allocated memory was 197.1MB in the beginning and 285.2MB in the end (delta: 88.1MB). Free memory was 126.2MB in the beginning and 215.8MB in the end (delta: -89.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.52ms. Allocated memory is still 285.2MB. Free memory is still 215.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of 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=3] [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=3] [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=3] [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=3] [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=3] [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=3] [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=3] [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=3] [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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] [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=256, 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=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 6, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 829 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 825 mSDsluCounter, 1861 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1330 mSDsCounter, 417 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 953 IncrementalHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 417 mSolverCounterUnsat, 531 mSDtfsCounter, 953 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 612 GetRequests, 535 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred in iteration=5, InterpolantAutomatonStates: 64, 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, 131 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1168 NumberOfCodeBlocks, 1168 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1014 ConstructedInterpolants, 0 QuantifiedInterpolants, 4843 SizeOfPredicates, 8 NumberOfNonLiveVariables, 368 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 6270/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-08 20:24:49,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_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-?-c7c6ca5-m [2024-11-08 20:24:51,428 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:24:51,511 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 20:24:51,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:24:51,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:24:51,549 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:24:51,552 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:24:51,552 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:24:51,553 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:24:51,554 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:24:51,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:24:51,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:24:51,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:24:51,557 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:24:51,557 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:24:51,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:24:51,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:24:51,558 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:24:51,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:24:51,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:24:51,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:24:51,563 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:24:51,563 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:24:51,564 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 20:24:51,564 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 20:24:51,564 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:24:51,564 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 20:24:51,565 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:24:51,565 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:24:51,565 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:24:51,565 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:24:51,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:24:51,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:24:51,566 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:24:51,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:24:51,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:24:51,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:24:51,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:24:51,569 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 20:24:51,569 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 20:24:51,570 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:24:51,571 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:24:51,571 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:24:51,571 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:24:51,571 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-08 20:24:51,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:24:51,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:24:51,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:24:51,948 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:24:51,948 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:24:51,950 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-08 20:24:53,523 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:24:53,729 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:24:53,729 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-08 20:24:53,750 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f24c866e/bf6ab5456d404d5e963d714b765d8d02/FLAGbbed751a1 [2024-11-08 20:24:53,769 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f24c866e/bf6ab5456d404d5e963d714b765d8d02 [2024-11-08 20:24:53,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:24:53,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:24:53,777 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:24:53,778 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:24:53,783 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:24:53,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:24:53" (1/1) ... [2024-11-08 20:24:53,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59278423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:53, skipping insertion in model container [2024-11-08 20:24:53,787 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:24:53" (1/1) ... [2024-11-08 20:24:53,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:24:54,023 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-08 20:24:54,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:24:54,129 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:24:54,142 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-08 20:24:54,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:24:54,187 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:24:54,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:54 WrapperNode [2024-11-08 20:24:54,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:24:54,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:24:54,190 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:24:54,190 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:24:54,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:54" (1/1) ... [2024-11-08 20:24:54,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:54" (1/1) ... [2024-11-08 20:24:54,253 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2024-11-08 20:24:54,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:24:54,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:24:54,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:24:54,259 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:24:54,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:54" (1/1) ... [2024-11-08 20:24:54,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:54" (1/1) ... [2024-11-08 20:24:54,281 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:54" (1/1) ... [2024-11-08 20:24:54,306 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-08 20:24:54,307 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:54" (1/1) ... [2024-11-08 20:24:54,307 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:54" (1/1) ... [2024-11-08 20:24:54,322 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:54" (1/1) ... [2024-11-08 20:24:54,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:54" (1/1) ... [2024-11-08 20:24:54,337 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:54" (1/1) ... [2024-11-08 20:24:54,342 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:54" (1/1) ... [2024-11-08 20:24:54,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:24:54,354 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:24:54,354 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:24:54,355 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:24:54,355 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:54" (1/1) ... [2024-11-08 20:24:54,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:24:54,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:24:54,389 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-08 20:24:54,396 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-08 20:24:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:24:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 20:24:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:24:54,433 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:24:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:24:54,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:24:54,524 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:24:54,527 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:24:57,452 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 20:24:57,452 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:24:57,464 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:24:57,464 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:24:57,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:24:57 BoogieIcfgContainer [2024-11-08 20:24:57,465 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:24:57,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:24:57,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:24:57,470 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:24:57,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:24:53" (1/3) ... [2024-11-08 20:24:57,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6cd6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:24:57, skipping insertion in model container [2024-11-08 20:24:57,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:54" (2/3) ... [2024-11-08 20:24:57,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6cd6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:24:57, skipping insertion in model container [2024-11-08 20:24:57,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:24:57" (3/3) ... [2024-11-08 20:24:57,473 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-85.i [2024-11-08 20:24:57,494 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:24:57,494 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:24:57,552 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:24:57,560 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;@688384d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:24:57,561 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:24:57,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 43 states have (on average 1.372093023255814) internal successors, (59), 44 states have internal predecessors, (59), 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-08 20:24:57,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 20:24:57,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:24:57,581 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] [2024-11-08 20:24:57,582 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:24:57,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:24:57,589 INFO L85 PathProgramCache]: Analyzing trace with hash -29964851, now seen corresponding path program 1 times [2024-11-08 20:24:57,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:24:57,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311168127] [2024-11-08 20:24:57,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:24:57,610 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-08 20:24:57,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:24:57,613 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-08 20:24:57,614 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-08 20:24:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:58,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 20:24:58,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:24:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2024-11-08 20:24:58,112 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:24:58,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:24:58,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311168127] [2024-11-08 20:24:58,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311168127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:24:58,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:24:58,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:24:58,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972011680] [2024-11-08 20:24:58,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:24:58,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:24:58,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:24:58,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:24:58,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:24:58,155 INFO L87 Difference]: Start difference. First operand has 68 states, 43 states have (on average 1.372093023255814) internal successors, (59), 44 states have internal predecessors, (59), 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), 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-08 20:24:58,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:24:58,186 INFO L93 Difference]: Finished difference Result 129 states and 222 transitions. [2024-11-08 20:24:58,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:24:58,189 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), 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 142 [2024-11-08 20:24:58,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:24:58,196 INFO L225 Difference]: With dead ends: 129 [2024-11-08 20:24:58,197 INFO L226 Difference]: Without dead ends: 64 [2024-11-08 20:24:58,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 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-08 20:24:58,203 INFO L432 NwaCegarLoop]: 96 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, 96 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-08 20:24:58,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:24:58,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-08 20:24:58,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-08 20:24:58,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 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-08 20:24:58,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 96 transitions. [2024-11-08 20:24:58,254 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 96 transitions. Word has length 142 [2024-11-08 20:24:58,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:24:58,254 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 96 transitions. [2024-11-08 20:24:58,254 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), 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-08 20:24:58,255 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 96 transitions. [2024-11-08 20:24:58,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 20:24:58,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:24:58,258 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] [2024-11-08 20:24:58,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 20:24:58,458 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-08 20:24:58,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:24:58,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:24:58,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1810870079, now seen corresponding path program 1 times [2024-11-08 20:24:58,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:24:58,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182272273] [2024-11-08 20:24:58,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:24:58,461 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-08 20:24:58,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:24:58,463 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-08 20:24:58,464 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-08 20:24:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:58,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 20:24:58,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:25:00,162 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-08 20:25:00,162 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:25:00,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:25:00,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182272273] [2024-11-08 20:25:00,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1182272273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:25:00,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:25:00,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:25:00,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060765530] [2024-11-08 20:25:00,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:25:00,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:25:00,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:25:00,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:25:00,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:25:00,166 INFO L87 Difference]: Start difference. First operand 64 states and 96 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 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-08 20:25:02,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:25:02,041 INFO L93 Difference]: Finished difference Result 125 states and 189 transitions. [2024-11-08 20:25:02,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 20:25:02,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 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 142 [2024-11-08 20:25:02,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:25:02,073 INFO L225 Difference]: With dead ends: 125 [2024-11-08 20:25:02,074 INFO L226 Difference]: Without dead ends: 64 [2024-11-08 20:25:02,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:25:02,075 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 78 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 131 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.8s IncrementalHoareTripleChecker+Time [2024-11-08 20:25:02,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 131 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 20:25:02,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-08 20:25:02,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-08 20:25:02,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 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-08 20:25:02,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2024-11-08 20:25:02,122 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 142 [2024-11-08 20:25:02,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:25:02,127 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2024-11-08 20:25:02,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 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-08 20:25:02,127 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2024-11-08 20:25:02,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 20:25:02,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:25:02,129 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] [2024-11-08 20:25:02,178 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-08 20:25:02,338 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-08 20:25:02,339 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:25:02,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:25:02,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1951073965, now seen corresponding path program 1 times [2024-11-08 20:25:02,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:25:02,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430393263] [2024-11-08 20:25:02,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:25:02,341 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-08 20:25:02,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:25:02,343 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:25:02,344 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-08 20:25:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:25:02,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 20:25:02,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:25:05,737 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-08 20:25:05,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:25:07,234 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-08 20:25:07,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:25:07,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430393263] [2024-11-08 20:25:07,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430393263] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 20:25:07,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 20:25:07,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2024-11-08 20:25:07,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979296131] [2024-11-08 20:25:07,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 20:25:07,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 20:25:07,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:25:07,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 20:25:07,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-08 20:25:07,243 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 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-08 20:25:13,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:25:13,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:25:13,819 INFO L93 Difference]: Finished difference Result 249 states and 367 transitions. [2024-11-08 20:25:13,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 20:25:13,821 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 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 143 [2024-11-08 20:25:13,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:25:13,823 INFO L225 Difference]: With dead ends: 249 [2024-11-08 20:25:13,824 INFO L226 Difference]: Without dead ends: 188 [2024-11-08 20:25:13,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 273 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2024-11-08 20:25:13,826 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 258 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-08 20:25:13,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 503 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-11-08 20:25:13,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-08 20:25:13,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 152. [2024-11-08 20:25:13,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 92 states have (on average 1.2391304347826086) internal successors, (114), 93 states have internal predecessors, (114), 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-08 20:25:13,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 224 transitions. [2024-11-08 20:25:13,861 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 224 transitions. Word has length 143 [2024-11-08 20:25:13,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:25:13,862 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 224 transitions. [2024-11-08 20:25:13,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 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-08 20:25:13,863 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 224 transitions. [2024-11-08 20:25:13,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 20:25:13,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:25:13,865 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] [2024-11-08 20:25:13,884 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-08 20:25:14,065 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-08 20:25:14,066 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:25:14,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:25:14,068 INFO L85 PathProgramCache]: Analyzing trace with hash 503991767, now seen corresponding path program 1 times [2024-11-08 20:25:14,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:25:14,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137711762] [2024-11-08 20:25:14,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:25:14,069 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-08 20:25:14,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:25:14,073 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-08 20:25:14,074 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-08 20:25:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:25:14,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 20:25:14,447 INFO L278 TraceCheckSpWp]: Computing forward predicates...