./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-17.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5542c934b0500896737ec6dd9b5fa5cdab93ba295214dc1f80eeb0253f65443a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:51:53,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:51:53,383 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 06:51:53,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:51:53,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:51:53,426 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:51:53,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:51:53,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:51:53,433 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:51:53,433 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:51:53,433 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:51:53,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:51:53,438 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:51:53,438 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:51:53,438 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:51:53,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:51:53,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:51:53,439 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:51:53,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 06:51:53,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:51:53,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:51:53,443 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:51:53,446 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:51:53,446 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:51:53,446 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:51:53,447 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:51:53,447 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:51:53,447 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:51:53,447 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:51:53,447 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:51:53,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:51:53,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:51:53,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:51:53,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:51:53,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:51:53,448 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:51:53,449 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 06:51:53,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 06:51:53,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:51:53,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:51:53,457 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:51:53,457 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:51:53,457 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 -> 5542c934b0500896737ec6dd9b5fa5cdab93ba295214dc1f80eeb0253f65443a [2024-10-24 06:51:53,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:51:53,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:51:53,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:51:53,805 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:51:53,806 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:51:53,807 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-17.i [2024-10-24 06:51:55,155 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:51:55,309 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:51:55,310 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-17.i [2024-10-24 06:51:55,319 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57e97bb9f/ff03316dcd874a01a0c20d1072d5622d/FLAGda5a0333e [2024-10-24 06:51:55,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57e97bb9f/ff03316dcd874a01a0c20d1072d5622d [2024-10-24 06:51:55,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:51:55,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:51:55,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:51:55,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:51:55,337 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:51:55,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:51:55" (1/1) ... [2024-10-24 06:51:55,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be92515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:55, skipping insertion in model container [2024-10-24 06:51:55,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:51:55" (1/1) ... [2024-10-24 06:51:55,366 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:51:55,501 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-17.i[919,932] [2024-10-24 06:51:55,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:51:55,584 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:51:55,593 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-17.i[919,932] [2024-10-24 06:51:55,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:51:55,647 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:51:55,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:55 WrapperNode [2024-10-24 06:51:55,650 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:51:55,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:51:55,651 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:51:55,651 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:51:55,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:55" (1/1) ... [2024-10-24 06:51:55,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:55" (1/1) ... [2024-10-24 06:51:55,751 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2024-10-24 06:51:55,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:51:55,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:51:55,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:51:55,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:51:55,792 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:55" (1/1) ... [2024-10-24 06:51:55,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:55" (1/1) ... [2024-10-24 06:51:55,804 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:55" (1/1) ... [2024-10-24 06:51:55,834 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 06:51:55,834 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:55" (1/1) ... [2024-10-24 06:51:55,834 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:55" (1/1) ... [2024-10-24 06:51:55,849 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:55" (1/1) ... [2024-10-24 06:51:55,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:55" (1/1) ... [2024-10-24 06:51:55,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:55" (1/1) ... [2024-10-24 06:51:55,865 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:55" (1/1) ... [2024-10-24 06:51:55,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:51:55,878 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:51:55,878 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:51:55,878 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:51:55,879 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:55" (1/1) ... [2024-10-24 06:51:55,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:51:55,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:51:55,904 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 06:51:55,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 06:51:55,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:51:55,942 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:51:55,942 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:51:55,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 06:51:55,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:51:55,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:51:56,017 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:51:56,019 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:51:56,314 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 06:51:56,314 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:51:56,335 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:51:56,336 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:51:56,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:51:56 BoogieIcfgContainer [2024-10-24 06:51:56,336 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:51:56,338 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:51:56,338 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:51:56,340 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:51:56,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:51:55" (1/3) ... [2024-10-24 06:51:56,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b402a82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:51:56, skipping insertion in model container [2024-10-24 06:51:56,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:55" (2/3) ... [2024-10-24 06:51:56,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b402a82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:51:56, skipping insertion in model container [2024-10-24 06:51:56,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:51:56" (3/3) ... [2024-10-24 06:51:56,342 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-17.i [2024-10-24 06:51:56,354 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:51:56,354 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:51:56,437 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:51:56,444 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;@406198f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:51:56,445 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:51:56,452 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 67 states have internal predecessors, (102), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 06:51:56,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-24 06:51:56,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:56,484 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:56,485 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:56,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:56,498 INFO L85 PathProgramCache]: Analyzing trace with hash -2006850310, now seen corresponding path program 1 times [2024-10-24 06:51:56,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:51:56,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486310070] [2024-10-24 06:51:56,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:56,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:51:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:56,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:51:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:56,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:51:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:56,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:51:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:56,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:51:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:56,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:51:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:56,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:51:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:56,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:51:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:56,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:51:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:56,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:51:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:56,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:51:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:56,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:51:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:56,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:51:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:56,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:51:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:56,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:51:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:56,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:51:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:56,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:51:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:56,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:51:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:56,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:51:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:56,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:51:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:56,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:51:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:56,847 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 06:51:56,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:51:56,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486310070] [2024-10-24 06:51:56,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486310070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:51:56,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:51:56,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:51:56,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255003318] [2024-10-24 06:51:56,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:51:56,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:51:56,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:51:56,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:51:56,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:51:56,879 INFO L87 Difference]: Start difference. First operand has 89 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 67 states have internal predecessors, (102), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 06:51:56,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:51:56,951 INFO L93 Difference]: Finished difference Result 175 states and 302 transitions. [2024-10-24 06:51:56,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:51:56,954 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 137 [2024-10-24 06:51:56,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:51:56,961 INFO L225 Difference]: With dead ends: 175 [2024-10-24 06:51:56,962 INFO L226 Difference]: Without dead ends: 87 [2024-10-24 06:51:56,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:51:56,969 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:51:56,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:51:56,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-24 06:51:57,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-24 06:51:57,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 65 states have (on average 1.476923076923077) internal successors, (96), 65 states have internal predecessors, (96), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 06:51:57,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 136 transitions. [2024-10-24 06:51:57,011 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 136 transitions. Word has length 137 [2024-10-24 06:51:57,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:51:57,011 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 136 transitions. [2024-10-24 06:51:57,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 06:51:57,011 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 136 transitions. [2024-10-24 06:51:57,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-24 06:51:57,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:57,015 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:57,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 06:51:57,015 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:57,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:57,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1315210302, now seen corresponding path program 1 times [2024-10-24 06:51:57,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:51:57,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561062242] [2024-10-24 06:51:57,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:57,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:51:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:57,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:51:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:57,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:51:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:57,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:51:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:57,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:51:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:57,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:51:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:57,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:51:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:57,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:51:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:57,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:51:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:57,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:51:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:57,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:51:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:57,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:51:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:57,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:51:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:57,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:51:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:57,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:51:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:57,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:51:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:57,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:51:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:57,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:51:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:57,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:51:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:57,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:51:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:57,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:51:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:57,436 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 06:51:57,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:51:57,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561062242] [2024-10-24 06:51:57,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561062242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:51:57,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:51:57,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:51:57,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723237434] [2024-10-24 06:51:57,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:51:57,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:51:57,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:51:57,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:51:57,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:51:57,444 INFO L87 Difference]: Start difference. First operand 87 states and 136 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 06:51:57,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:51:57,635 INFO L93 Difference]: Finished difference Result 310 states and 483 transitions. [2024-10-24 06:51:57,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:51:57,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-10-24 06:51:57,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:51:57,641 INFO L225 Difference]: With dead ends: 310 [2024-10-24 06:51:57,641 INFO L226 Difference]: Without dead ends: 224 [2024-10-24 06:51:57,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 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-10-24 06:51:57,643 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 192 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:51:57,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 546 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:51:57,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-24 06:51:57,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 219. [2024-10-24 06:51:57,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 171 states have (on average 1.4970760233918128) internal successors, (256), 172 states have internal predecessors, (256), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 06:51:57,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 344 transitions. [2024-10-24 06:51:57,675 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 344 transitions. Word has length 137 [2024-10-24 06:51:57,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:51:57,676 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 344 transitions. [2024-10-24 06:51:57,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 06:51:57,676 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 344 transitions. [2024-10-24 06:51:57,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-24 06:51:57,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:57,678 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:57,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 06:51:57,678 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:57,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:57,679 INFO L85 PathProgramCache]: Analyzing trace with hash -273137600, now seen corresponding path program 1 times [2024-10-24 06:51:57,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:51:57,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802100600] [2024-10-24 06:51:57,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:57,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:51:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:57,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:51:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:57,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:51:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:57,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:51:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:57,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:51:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:57,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:51:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:57,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:51:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:51:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:51:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:51:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:51:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:51:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:51:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:51:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:51:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:51:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:51:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:51:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:51:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:51:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:51:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,071 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 06:51:58,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:51:58,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802100600] [2024-10-24 06:51:58,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802100600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:51:58,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:51:58,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:51:58,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819425539] [2024-10-24 06:51:58,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:51:58,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:51:58,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:51:58,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:51:58,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:51:58,073 INFO L87 Difference]: Start difference. First operand 219 states and 344 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 06:51:58,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:51:58,356 INFO L93 Difference]: Finished difference Result 606 states and 954 transitions. [2024-10-24 06:51:58,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:51:58,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-10-24 06:51:58,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:51:58,361 INFO L225 Difference]: With dead ends: 606 [2024-10-24 06:51:58,361 INFO L226 Difference]: Without dead ends: 388 [2024-10-24 06:51:58,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 06:51:58,363 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 98 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:51:58,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 467 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 06:51:58,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-24 06:51:58,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 257. [2024-10-24 06:51:58,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 188 states have (on average 1.452127659574468) internal successors, (273), 189 states have internal predecessors, (273), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 06:51:58,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 401 transitions. [2024-10-24 06:51:58,393 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 401 transitions. Word has length 137 [2024-10-24 06:51:58,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:51:58,394 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 401 transitions. [2024-10-24 06:51:58,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 06:51:58,394 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 401 transitions. [2024-10-24 06:51:58,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 06:51:58,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:58,396 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:58,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 06:51:58,396 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:58,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:58,397 INFO L85 PathProgramCache]: Analyzing trace with hash 953448609, now seen corresponding path program 1 times [2024-10-24 06:51:58,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:51:58,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122805269] [2024-10-24 06:51:58,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:58,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:51:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:51:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:51:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:51:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:51:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:51:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:51:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:51:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:51:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:51:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:51:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:51:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:51:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:51:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:51:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:51:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:51:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:51:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:51:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:51:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:51:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:58,890 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 06:51:58,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:51:58,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122805269] [2024-10-24 06:51:58,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122805269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:51:58,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:51:58,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:51:58,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289407281] [2024-10-24 06:51:58,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:51:58,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:51:58,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:51:58,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:51:58,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:51:58,893 INFO L87 Difference]: Start difference. First operand 257 states and 401 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 06:51:59,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:51:59,067 INFO L93 Difference]: Finished difference Result 814 states and 1265 transitions. [2024-10-24 06:51:59,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:51:59,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2024-10-24 06:51:59,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:51:59,071 INFO L225 Difference]: With dead ends: 814 [2024-10-24 06:51:59,071 INFO L226 Difference]: Without dead ends: 596 [2024-10-24 06:51:59,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:51:59,073 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 231 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:51:59,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 358 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:51:59,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-10-24 06:51:59,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 525. [2024-10-24 06:51:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 428 states have (on average 1.4976635514018692) internal successors, (641), 432 states have internal predecessors, (641), 88 states have call successors, (88), 8 states have call predecessors, (88), 8 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-24 06:51:59,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 817 transitions. [2024-10-24 06:51:59,106 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 817 transitions. Word has length 138 [2024-10-24 06:51:59,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:51:59,107 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 817 transitions. [2024-10-24 06:51:59,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 06:51:59,107 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 817 transitions. [2024-10-24 06:51:59,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 06:51:59,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:59,109 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:59,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 06:51:59,109 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:59,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:59,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1633506979, now seen corresponding path program 1 times [2024-10-24 06:51:59,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:51:59,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579481309] [2024-10-24 06:51:59,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:59,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:51:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:59,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:51:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:59,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:51:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:59,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:51:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:59,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:51:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:59,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:51:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:59,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:51:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:59,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:51:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:59,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:51:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:59,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:51:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:59,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:51:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:59,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:51:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:59,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:51:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:59,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:51:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:59,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:51:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:59,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:51:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:59,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:51:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:59,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:51:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:59,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:51:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:59,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:51:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:59,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:51:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:59,485 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-24 06:51:59,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:51:59,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579481309] [2024-10-24 06:51:59,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579481309] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:51:59,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044410356] [2024-10-24 06:51:59,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:59,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:51:59,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:51:59,489 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-10-24 06:51:59,490 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-10-24 06:51:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:59,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 06:51:59,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:51:59,763 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 399 proven. 27 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-10-24 06:51:59,772 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:51:59,984 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-24 06:51:59,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044410356] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:51:59,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 06:51:59,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-24 06:51:59,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503544476] [2024-10-24 06:51:59,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 06:51:59,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 06:51:59,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:51:59,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 06:51:59,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 06:51:59,986 INFO L87 Difference]: Start difference. First operand 525 states and 817 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 06:52:00,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:52:00,221 INFO L93 Difference]: Finished difference Result 961 states and 1480 transitions. [2024-10-24 06:52:00,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 06:52:00,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 138 [2024-10-24 06:52:00,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:52:00,226 INFO L225 Difference]: With dead ends: 961 [2024-10-24 06:52:00,227 INFO L226 Difference]: Without dead ends: 433 [2024-10-24 06:52:00,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 312 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-24 06:52:00,231 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 68 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:52:00,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 270 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 06:52:00,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-10-24 06:52:00,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 419. [2024-10-24 06:52:00,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 319 states have (on average 1.3761755485893417) internal successors, (439), 323 states have internal predecessors, (439), 88 states have call successors, (88), 11 states have call predecessors, (88), 11 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-24 06:52:00,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 615 transitions. [2024-10-24 06:52:00,274 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 615 transitions. Word has length 138 [2024-10-24 06:52:00,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:52:00,274 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 615 transitions. [2024-10-24 06:52:00,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 06:52:00,275 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 615 transitions. [2024-10-24 06:52:00,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 06:52:00,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:52:00,277 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:52:00,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 06:52:00,477 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-10-24 06:52:00,478 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:52:00,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:52:00,478 INFO L85 PathProgramCache]: Analyzing trace with hash -735495133, now seen corresponding path program 1 times [2024-10-24 06:52:00,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:52:00,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084451427] [2024-10-24 06:52:00,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:52:00,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:52:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 06:52:00,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [262305717] [2024-10-24 06:52:00,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:52:00,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:52:00,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:52:00,557 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-10-24 06:52:00,573 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-10-24 06:52:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:52:00,662 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 06:52:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:52:00,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 06:52:00,758 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 06:52:00,759 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 06:52:00,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 06:52:00,961 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-10-24 06:52:00,966 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 06:52:01,064 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 06:52:01,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 06:52:01 BoogieIcfgContainer [2024-10-24 06:52:01,069 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 06:52:01,069 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 06:52:01,069 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 06:52:01,069 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 06:52:01,070 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:51:56" (3/4) ... [2024-10-24 06:52:01,071 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 06:52:01,072 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 06:52:01,073 INFO L158 Benchmark]: Toolchain (without parser) took 5740.44ms. Allocated memory was 201.3MB in the beginning and 274.7MB in the end (delta: 73.4MB). Free memory was 129.7MB in the beginning and 202.8MB in the end (delta: -73.1MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. [2024-10-24 06:52:01,073 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:52:01,074 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.03ms. Allocated memory is still 201.3MB. Free memory was 129.6MB in the beginning and 112.6MB in the end (delta: 17.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 06:52:01,074 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.34ms. Allocated memory is still 201.3MB. Free memory was 112.6MB in the beginning and 168.4MB in the end (delta: -55.8MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2024-10-24 06:52:01,074 INFO L158 Benchmark]: Boogie Preprocessor took 125.78ms. Allocated memory is still 201.3MB. Free memory was 168.4MB in the beginning and 162.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 06:52:01,074 INFO L158 Benchmark]: RCFGBuilder took 458.30ms. Allocated memory is still 201.3MB. Free memory was 162.1MB in the beginning and 128.6MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-24 06:52:01,074 INFO L158 Benchmark]: TraceAbstraction took 4731.23ms. Allocated memory was 201.3MB in the beginning and 274.7MB in the end (delta: 73.4MB). Free memory was 127.2MB in the beginning and 202.8MB in the end (delta: -75.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:52:01,075 INFO L158 Benchmark]: Witness Printer took 3.17ms. Allocated memory is still 274.7MB. Free memory is still 202.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:52:01,076 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.18ms. Allocated memory is still 117.4MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.03ms. Allocated memory is still 201.3MB. Free memory was 129.6MB in the beginning and 112.6MB in the end (delta: 17.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.34ms. Allocated memory is still 201.3MB. Free memory was 112.6MB in the beginning and 168.4MB in the end (delta: -55.8MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 125.78ms. Allocated memory is still 201.3MB. Free memory was 168.4MB in the beginning and 162.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 458.30ms. Allocated memory is still 201.3MB. Free memory was 162.1MB in the beginning and 128.6MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4731.23ms. Allocated memory was 201.3MB in the beginning and 274.7MB in the end (delta: 73.4MB). Free memory was 127.2MB in the beginning and 202.8MB in the end (delta: -75.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.17ms. Allocated memory is still 274.7MB. Free memory is still 202.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 173. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 25; [L23] unsigned char var_1_2 = 25; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 0; [L26] signed long int var_1_5 = 4; [L27] unsigned char var_1_7 = 0; [L28] unsigned char var_1_8 = 1; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 0; [L31] double var_1_11 = 7.3; [L32] double var_1_12 = 1.25; [L33] double var_1_13 = 128.8; [L34] signed char var_1_14 = -1; [L35] signed char var_1_15 = 10; [L36] signed short int var_1_16 = 8; [L37] unsigned long int var_1_18 = 128; [L38] unsigned long int var_1_19 = 3963666122; [L39] float var_1_20 = 15.875; [L40] signed short int var_1_23 = -10; [L41] unsigned long int var_1_30 = 1000000000; [L42] float var_1_33 = 99.25; [L43] signed long int var_1_34 = 10; [L44] unsigned char var_1_35 = 16; [L45] signed long int var_1_39 = -128; [L46] signed long int var_1_40 = 1792665454; [L47] unsigned char last_1_var_1_8 = 1; [L48] signed char last_1_var_1_14 = -1; [L177] isInitial = 1 [L178] FCALL initially() [L179] COND TRUE 1 [L180] CALL updateLastVariables() [L169] last_1_var_1_8 = var_1_8 [L170] last_1_var_1_14 = var_1_14 [L180] RET updateLastVariables() [L181] CALL updateVariables() [L136] var_1_2 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L137] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L138] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L138] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L139] var_1_3 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L140] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L141] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L142] var_1_4 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L143] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L144] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L144] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L145] var_1_7 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_8=1, var_1_9=0] [L146] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_8=1, var_1_9=0] [L147] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L147] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L148] var_1_9 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L149] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L150] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L151] var_1_10 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L152] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L153] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L153] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L154] var_1_12 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L155] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L156] var_1_13 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L157] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L158] var_1_15 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_15 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L159] RET assume_abort_if_not(var_1_15 >= -127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L160] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L160] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L161] var_1_19 = __VERIFIER_nondet_ulong() [L162] CALL assume_abort_if_not(var_1_19 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L162] RET assume_abort_if_not(var_1_19 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L163] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L164] var_1_40 = __VERIFIER_nondet_long() [L165] CALL assume_abort_if_not(var_1_40 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L165] RET assume_abort_if_not(var_1_40 >= 1073741823) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L166] CALL assume_abort_if_not(var_1_40 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L166] RET assume_abort_if_not(var_1_40 <= 2147483646) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L181] RET updateVariables() [L182] CALL step() [L52] unsigned char stepLocal_0 = last_1_var_1_8; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_0=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L53] COND TRUE stepLocal_0 && last_1_var_1_8 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L54] COND TRUE \read(last_1_var_1_8) [L55] var_1_5 = (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L60] COND FALSE !(var_1_5 < var_1_3) [L63] var_1_8 = (! var_1_10) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L65] var_1_1 = (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=50, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L66] COND FALSE !((64.4f + 1.5f) <= var_1_13) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=50, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L71] unsigned char stepLocal_3 = var_1_9 && var_1_8; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_3=0, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=50, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L72] COND FALSE !(stepLocal_3 || (var_1_8 && var_1_10)) [L75] var_1_18 = var_1_2 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L77] signed long int stepLocal_1 = 8 + var_1_14; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_1=7, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L78] COND FALSE !(var_1_4 == stepLocal_1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L81] EXPR var_1_15 & var_1_1 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L81] unsigned long int stepLocal_2 = var_1_18 * (var_1_15 & var_1_1); [L82] COND FALSE !(var_1_12 >= 9.6) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L93] var_1_20 = ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=2, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L94] COND FALSE !(128u <= var_1_1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=2, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L109] COND TRUE var_1_2 >= var_1_2 [L110] var_1_30 = (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) - var_1_3) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=2, var_1_23=-10, var_1_2=0, var_1_30=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L112] var_1_33 = var_1_12 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=2, var_1_23=-10, var_1_2=0, var_1_30=-2147483649, var_1_33=3, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L113] COND TRUE \read(var_1_10) [L114] var_1_34 = ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=2, var_1_23=-10, var_1_2=0, var_1_30=-2147483649, var_1_33=3, var_1_34=0, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L116] COND TRUE var_1_19 > var_1_3 [L117] var_1_35 = var_1_4 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=2, var_1_23=-10, var_1_2=0, var_1_30=-2147483649, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L125] EXPR var_1_4 >> var_1_4 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=2, var_1_23=-10, var_1_2=0, var_1_30=-2147483649, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L125] COND FALSE !(var_1_2 > (var_1_4 >> var_1_4)) [L132] var_1_39 = var_1_2 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=2, var_1_23=-10, var_1_2=0, var_1_30=-2147483649, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L182] RET step() [L183] CALL, EXPR property() [L173] EXPR (((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=2, var_1_23=-10, var_1_2=0, var_1_30=-2147483649, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L173-L174] return ((((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1)) && (((var_1_9 && var_1_8) || (var_1_8 && var_1_10)) ? (var_1_18 == ((unsigned long int) (var_1_19 - (((((1991720936u - var_1_1)) < (var_1_2)) ? ((1991720936u - var_1_1)) : (var_1_2)))))) : (var_1_18 == ((unsigned long int) var_1_2))) ; [L183] RET, EXPR property() [L183] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=2, var_1_23=-10, var_1_2=0, var_1_30=-2147483649, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=2, var_1_23=-10, var_1_2=0, var_1_30=-2147483649, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 6, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 599 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 589 mSDsluCounter, 1774 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1131 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 455 IncrementalHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 643 mSDtfsCounter, 455 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 525 GetRequests, 502 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=525occurred in iteration=4, InterpolantAutomatonStates: 26, 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, 221 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1101 NumberOfCodeBlocks, 1101 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 956 ConstructedInterpolants, 0 QuantifiedInterpolants, 1963 SizeOfPredicates, 0 NumberOfNonLiveVariables, 328 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 5239/5320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 06:52:01,110 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-17.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5542c934b0500896737ec6dd9b5fa5cdab93ba295214dc1f80eeb0253f65443a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:52:03,354 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:52:03,424 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 06:52:03,429 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:52:03,429 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:52:03,455 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:52:03,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:52:03,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:52:03,456 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:52:03,457 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:52:03,457 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:52:03,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:52:03,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:52:03,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:52:03,462 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:52:03,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:52:03,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:52:03,463 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:52:03,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:52:03,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:52:03,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:52:03,464 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:52:03,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:52:03,465 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 06:52:03,465 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 06:52:03,465 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:52:03,465 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 06:52:03,465 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:52:03,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:52:03,466 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:52:03,466 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:52:03,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:52:03,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:52:03,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:52:03,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:52:03,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:52:03,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:52:03,467 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:52:03,467 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 06:52:03,467 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 06:52:03,467 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:52:03,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:52:03,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:52:03,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:52:03,469 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 06:52:03,469 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 -> 5542c934b0500896737ec6dd9b5fa5cdab93ba295214dc1f80eeb0253f65443a [2024-10-24 06:52:03,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:52:03,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:52:03,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:52:03,805 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:52:03,805 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:52:03,811 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-17.i [2024-10-24 06:52:05,717 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:52:05,948 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:52:05,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-17.i [2024-10-24 06:52:05,961 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a792d44b/fd4b3ed52195438a95cc480bb66e1e5a/FLAG53822f248 [2024-10-24 06:52:05,977 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a792d44b/fd4b3ed52195438a95cc480bb66e1e5a [2024-10-24 06:52:05,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:52:05,981 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:52:05,982 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:52:05,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:52:05,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:52:05,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:52:05" (1/1) ... [2024-10-24 06:52:05,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@315272aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:05, skipping insertion in model container [2024-10-24 06:52:05,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:52:05" (1/1) ... [2024-10-24 06:52:06,011 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:52:06,192 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-17.i[919,932] [2024-10-24 06:52:06,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:52:06,296 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:52:06,306 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-17.i[919,932] [2024-10-24 06:52:06,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:52:06,372 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:52:06,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:06 WrapperNode [2024-10-24 06:52:06,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:52:06,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:52:06,374 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:52:06,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:52:06,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:06" (1/1) ... [2024-10-24 06:52:06,397 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:06" (1/1) ... [2024-10-24 06:52:06,431 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2024-10-24 06:52:06,432 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:52:06,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:52:06,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:52:06,433 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:52:06,448 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:06" (1/1) ... [2024-10-24 06:52:06,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:06" (1/1) ... [2024-10-24 06:52:06,453 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:06" (1/1) ... [2024-10-24 06:52:06,469 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 06:52:06,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:06" (1/1) ... [2024-10-24 06:52:06,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:06" (1/1) ... [2024-10-24 06:52:06,483 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:06" (1/1) ... [2024-10-24 06:52:06,491 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:06" (1/1) ... [2024-10-24 06:52:06,495 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:06" (1/1) ... [2024-10-24 06:52:06,496 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:06" (1/1) ... [2024-10-24 06:52:06,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:52:06,500 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:52:06,500 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:52:06,500 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:52:06,501 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:06" (1/1) ... [2024-10-24 06:52:06,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:52:06,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:52:06,538 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 06:52:06,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 06:52:06,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:52:06,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 06:52:06,577 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:52:06,578 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:52:06,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:52:06,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:52:06,650 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:52:06,652 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:52:07,462 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 06:52:07,462 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:52:07,528 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:52:07,528 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:52:07,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:52:07 BoogieIcfgContainer [2024-10-24 06:52:07,529 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:52:07,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:52:07,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:52:07,536 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:52:07,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:52:05" (1/3) ... [2024-10-24 06:52:07,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48acd9b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:52:07, skipping insertion in model container [2024-10-24 06:52:07,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:06" (2/3) ... [2024-10-24 06:52:07,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48acd9b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:52:07, skipping insertion in model container [2024-10-24 06:52:07,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:52:07" (3/3) ... [2024-10-24 06:52:07,538 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-17.i [2024-10-24 06:52:07,549 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:52:07,550 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:52:07,610 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:52:07,616 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;@4691187f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:52:07,617 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:52:07,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 49 states have internal predecessors, (74), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 06:52:07,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 06:52:07,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:52:07,631 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:52:07,632 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:52:07,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:52:07,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1650061256, now seen corresponding path program 1 times [2024-10-24 06:52:07,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:52:07,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811710789] [2024-10-24 06:52:07,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:52:07,650 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:52:07,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:52:07,653 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:52:07,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 06:52:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:52:07,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 06:52:07,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:52:07,906 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2024-10-24 06:52:07,907 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:52:07,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:52:07,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811710789] [2024-10-24 06:52:07,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811710789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:52:07,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:52:07,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:52:07,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697223133] [2024-10-24 06:52:07,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:52:07,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:52:07,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:52:07,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:52:07,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:52:07,934 INFO L87 Difference]: Start difference. First operand has 71 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 49 states have internal predecessors, (74), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 06:52:08,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:52:08,161 INFO L93 Difference]: Finished difference Result 139 states and 246 transitions. [2024-10-24 06:52:08,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:52:08,171 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2024-10-24 06:52:08,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:52:08,180 INFO L225 Difference]: With dead ends: 139 [2024-10-24 06:52:08,180 INFO L226 Difference]: Without dead ends: 69 [2024-10-24 06:52:08,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:52:08,196 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:52:08,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 06:52:08,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-24 06:52:08,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-24 06:52:08,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.446808510638298) internal successors, (68), 47 states have internal predecessors, (68), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 06:52:08,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 108 transitions. [2024-10-24 06:52:08,266 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 108 transitions. Word has length 133 [2024-10-24 06:52:08,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:52:08,266 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 108 transitions. [2024-10-24 06:52:08,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 06:52:08,267 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 108 transitions. [2024-10-24 06:52:08,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 06:52:08,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:52:08,269 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:52:08,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 06:52:08,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:52:08,475 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:52:08,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:52:08,476 INFO L85 PathProgramCache]: Analyzing trace with hash 725807484, now seen corresponding path program 1 times [2024-10-24 06:52:08,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:52:08,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561974810] [2024-10-24 06:52:08,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:52:08,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:52:08,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:52:08,482 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:52:08,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 06:52:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:52:08,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 06:52:08,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:52:09,122 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 06:52:09,122 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:52:09,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:52:09,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561974810] [2024-10-24 06:52:09,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561974810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:52:09,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:52:09,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:52:09,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262358716] [2024-10-24 06:52:09,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:52:09,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:52:09,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:52:09,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:52:09,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:52:09,130 INFO L87 Difference]: Start difference. First operand 69 states and 108 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 06:52:09,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:52:09,594 INFO L93 Difference]: Finished difference Result 206 states and 323 transitions. [2024-10-24 06:52:09,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:52:09,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-10-24 06:52:09,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:52:09,604 INFO L225 Difference]: With dead ends: 206 [2024-10-24 06:52:09,604 INFO L226 Difference]: Without dead ends: 138 [2024-10-24 06:52:09,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 06:52:09,606 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 67 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 06:52:09,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 359 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 06:52:09,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-24 06:52:09,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 107. [2024-10-24 06:52:09,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 06:52:09,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 165 transitions. [2024-10-24 06:52:09,640 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 165 transitions. Word has length 133 [2024-10-24 06:52:09,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:52:09,641 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 165 transitions. [2024-10-24 06:52:09,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 06:52:09,641 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 165 transitions. [2024-10-24 06:52:09,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 06:52:09,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:52:09,643 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:52:09,651 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-10-24 06:52:09,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:52:09,847 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:52:09,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:52:09,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1955729883, now seen corresponding path program 1 times [2024-10-24 06:52:09,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:52:09,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064352907] [2024-10-24 06:52:09,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:52:09,850 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:52:09,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:52:09,853 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:52:09,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 06:52:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:52:10,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 06:52:10,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:52:10,206 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 399 proven. 27 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-10-24 06:52:10,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:52:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-24 06:52:10,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:52:10,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064352907] [2024-10-24 06:52:10,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064352907] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:52:10,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 06:52:10,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-10-24 06:52:10,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209987772] [2024-10-24 06:52:10,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 06:52:10,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 06:52:10,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:52:10,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 06:52:10,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-24 06:52:10,563 INFO L87 Difference]: Start difference. First operand 107 states and 165 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 06:52:11,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:52:11,719 INFO L93 Difference]: Finished difference Result 259 states and 390 transitions. [2024-10-24 06:52:11,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 06:52:11,720 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 134 [2024-10-24 06:52:11,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:52:11,723 INFO L225 Difference]: With dead ends: 259 [2024-10-24 06:52:11,723 INFO L226 Difference]: Without dead ends: 191 [2024-10-24 06:52:11,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2024-10-24 06:52:11,725 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 234 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:52:11,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 449 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 06:52:11,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-24 06:52:11,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 119. [2024-10-24 06:52:11,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 74 states have internal predecessors, (93), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 06:52:11,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 173 transitions. [2024-10-24 06:52:11,753 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 173 transitions. Word has length 134 [2024-10-24 06:52:11,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:52:11,765 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 173 transitions. [2024-10-24 06:52:11,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 06:52:11,766 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 173 transitions. [2024-10-24 06:52:11,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 06:52:11,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:52:11,768 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:52:11,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 06:52:11,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:52:11,973 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:52:11,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:52:11,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1059373735, now seen corresponding path program 1 times [2024-10-24 06:52:11,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:52:11,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422117723] [2024-10-24 06:52:11,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:52:11,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:52:11,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:52:11,981 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:52:11,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 06:52:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:52:12,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 06:52:12,153 INFO L278 TraceCheckSpWp]: Computing forward predicates...