./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-pr-ci_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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-pr-ci_file-97.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 84a77ba55ab51f560e1bf3563bb3191090888d113bc8317dcee7de2867768a2d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:16:18,378 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:16:18,437 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:16:18,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:16:18,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:16:18,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:16:18,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:16:18,463 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:16:18,463 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:16:18,463 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:16:18,464 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:16:18,464 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:16:18,464 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:16:18,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:16:18,465 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:16:18,465 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:16:18,466 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:16:18,466 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:16:18,466 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:16:18,466 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:16:18,467 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:16:18,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:16:18,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:16:18,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:16:18,470 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:16:18,470 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:16:18,471 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:16:18,471 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:16:18,471 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:16:18,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:16:18,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:16:18,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:16:18,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:16:18,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:16:18,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:16:18,472 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:16:18,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:16:18,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:16:18,473 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:16:18,474 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:16:18,474 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:16:18,474 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:16:18,475 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 -> 84a77ba55ab51f560e1bf3563bb3191090888d113bc8317dcee7de2867768a2d [2024-10-13 02:16:18,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:16:18,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:16:18,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:16:18,698 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:16:18,698 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:16:18,699 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i [2024-10-13 02:16:20,036 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:16:20,201 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:16:20,201 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i [2024-10-13 02:16:20,208 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a03a1b304/75c3fc460bb84af197cf74bf3f54c9fe/FLAG8a2ce140d [2024-10-13 02:16:20,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a03a1b304/75c3fc460bb84af197cf74bf3f54c9fe [2024-10-13 02:16:20,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:16:20,592 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:16:20,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:16:20,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:16:20,597 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:16:20,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:16:20" (1/1) ... [2024-10-13 02:16:20,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6934bc6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:20, skipping insertion in model container [2024-10-13 02:16:20,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:16:20" (1/1) ... [2024-10-13 02:16:20,624 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:16:20,771 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-pr-ci_file-97.i[919,932] [2024-10-13 02:16:20,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:16:20,889 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:16:20,902 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-pr-ci_file-97.i[919,932] [2024-10-13 02:16:20,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:16:20,940 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:16:20,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:20 WrapperNode [2024-10-13 02:16:20,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:16:20,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:16:20,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:16:20,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:16:20,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:20" (1/1) ... [2024-10-13 02:16:20,957 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:20" (1/1) ... [2024-10-13 02:16:20,991 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 252 [2024-10-13 02:16:20,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:16:20,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:16:20,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:16:20,995 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:16:21,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:20" (1/1) ... [2024-10-13 02:16:21,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:20" (1/1) ... [2024-10-13 02:16:21,007 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:20" (1/1) ... [2024-10-13 02:16:21,031 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-13 02:16:21,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:20" (1/1) ... [2024-10-13 02:16:21,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:20" (1/1) ... [2024-10-13 02:16:21,051 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:20" (1/1) ... [2024-10-13 02:16:21,055 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:20" (1/1) ... [2024-10-13 02:16:21,057 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:20" (1/1) ... [2024-10-13 02:16:21,059 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:20" (1/1) ... [2024-10-13 02:16:21,065 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:16:21,066 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:16:21,066 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:16:21,066 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:16:21,067 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:20" (1/1) ... [2024-10-13 02:16:21,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:16:21,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:16:21,105 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-13 02:16:21,107 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-13 02:16:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:16:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:16:21,143 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:16:21,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:16:21,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:16:21,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:16:21,217 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:16:21,220 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:16:21,605 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-13 02:16:21,606 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:16:21,630 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:16:21,631 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:16:21,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:16:21 BoogieIcfgContainer [2024-10-13 02:16:21,632 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:16:21,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:16:21,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:16:21,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:16:21,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:16:20" (1/3) ... [2024-10-13 02:16:21,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4e718e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:16:21, skipping insertion in model container [2024-10-13 02:16:21,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:20" (2/3) ... [2024-10-13 02:16:21,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4e718e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:16:21, skipping insertion in model container [2024-10-13 02:16:21,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:16:21" (3/3) ... [2024-10-13 02:16:21,639 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i [2024-10-13 02:16:21,651 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:16:21,651 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:16:21,700 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:16:21,705 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;@20e2c7a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:16:21,706 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:16:21,709 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 78 states have internal predecessors, (120), 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-13 02:16:21,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 02:16:21,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:16:21,721 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] [2024-10-13 02:16:21,721 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:16:21,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:16:21,725 INFO L85 PathProgramCache]: Analyzing trace with hash 649403876, now seen corresponding path program 1 times [2024-10-13 02:16:21,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:16:21,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666886752] [2024-10-13 02:16:21,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:16:21,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:16:21,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:21,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:16:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:21,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:16:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:21,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:16:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:21,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:16:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:21,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:16:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:16:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:16:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:16:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:16:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:16:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:16:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:16:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:16:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:16:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:16:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:16:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:16:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:16:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:16:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:16:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,104 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-13 02:16:22,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:16:22,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666886752] [2024-10-13 02:16:22,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666886752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:16:22,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:16:22,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:16:22,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610011400] [2024-10-13 02:16:22,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:16:22,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:16:22,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:16:22,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:16:22,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:16:22,155 INFO L87 Difference]: Start difference. First operand has 100 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 78 states have internal predecessors, (120), 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 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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-13 02:16:22,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:16:22,198 INFO L93 Difference]: Finished difference Result 197 states and 338 transitions. [2024-10-13 02:16:22,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:16:22,202 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (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 136 [2024-10-13 02:16:22,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:16:22,209 INFO L225 Difference]: With dead ends: 197 [2024-10-13 02:16:22,210 INFO L226 Difference]: Without dead ends: 98 [2024-10-13 02:16:22,216 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-13 02:16:22,219 INFO L432 NwaCegarLoop]: 150 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, 150 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-13 02:16:22,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:16:22,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-13 02:16:22,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-13 02:16:22,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.486842105263158) internal successors, (113), 76 states have internal predecessors, (113), 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-13 02:16:22,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 153 transitions. [2024-10-13 02:16:22,267 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 153 transitions. Word has length 136 [2024-10-13 02:16:22,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:16:22,267 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 153 transitions. [2024-10-13 02:16:22,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (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-13 02:16:22,268 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 153 transitions. [2024-10-13 02:16:22,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 02:16:22,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:16:22,270 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] [2024-10-13 02:16:22,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:16:22,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:16:22,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:16:22,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1077388324, now seen corresponding path program 1 times [2024-10-13 02:16:22,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:16:22,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962690445] [2024-10-13 02:16:22,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:16:22,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:16:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:16:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:16:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:16:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:16:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:16:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:16:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:16:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:16:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:16:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:16:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:16:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:16:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:16:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:16:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:16:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:16:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:16:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:16:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:16:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:16:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,497 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-13 02:16:22,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:16:22,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962690445] [2024-10-13 02:16:22,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962690445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:16:22,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:16:22,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:16:22,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419752214] [2024-10-13 02:16:22,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:16:22,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:16:22,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:16:22,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:16:22,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:16:22,500 INFO L87 Difference]: Start difference. First operand 98 states and 153 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-13 02:16:22,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:16:22,587 INFO L93 Difference]: Finished difference Result 274 states and 427 transitions. [2024-10-13 02:16:22,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:16:22,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 136 [2024-10-13 02:16:22,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:16:22,591 INFO L225 Difference]: With dead ends: 274 [2024-10-13 02:16:22,591 INFO L226 Difference]: Without dead ends: 177 [2024-10-13 02:16:22,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:16:22,594 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 133 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:16:22,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 359 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:16:22,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-13 02:16:22,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 131. [2024-10-13 02:16:22,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 109 states have (on average 1.4770642201834863) internal successors, (161), 109 states have internal predecessors, (161), 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-13 02:16:22,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 201 transitions. [2024-10-13 02:16:22,616 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 201 transitions. Word has length 136 [2024-10-13 02:16:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:16:22,617 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 201 transitions. [2024-10-13 02:16:22,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-13 02:16:22,617 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 201 transitions. [2024-10-13 02:16:22,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 02:16:22,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:16:22,619 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] [2024-10-13 02:16:22,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 02:16:22,619 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:16:22,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:16:22,620 INFO L85 PathProgramCache]: Analyzing trace with hash 349367392, now seen corresponding path program 1 times [2024-10-13 02:16:22,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:16:22,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142341900] [2024-10-13 02:16:22,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:16:22,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:16:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:16:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:16:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:16:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:16:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:16:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:16:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:16:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:16:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:16:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:16:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:16:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:16:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:16:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:16:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:16:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:16:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:16:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:16:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:22,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:16:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:23,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:16:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:23,005 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-13 02:16:23,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:16:23,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142341900] [2024-10-13 02:16:23,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142341900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:16:23,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:16:23,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:16:23,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928566980] [2024-10-13 02:16:23,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:16:23,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:16:23,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:16:23,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:16:23,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:16:23,008 INFO L87 Difference]: Start difference. First operand 131 states and 201 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (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-13 02:16:23,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:16:23,295 INFO L93 Difference]: Finished difference Result 420 states and 647 transitions. [2024-10-13 02:16:23,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:16:23,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (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 136 [2024-10-13 02:16:23,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:16:23,299 INFO L225 Difference]: With dead ends: 420 [2024-10-13 02:16:23,300 INFO L226 Difference]: Without dead ends: 290 [2024-10-13 02:16:23,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-13 02:16:23,302 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 152 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:16:23,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 485 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 02:16:23,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-13 02:16:23,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 248. [2024-10-13 02:16:23,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 205 states have (on average 1.448780487804878) internal successors, (297), 205 states have internal predecessors, (297), 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-13 02:16:23,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 377 transitions. [2024-10-13 02:16:23,332 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 377 transitions. Word has length 136 [2024-10-13 02:16:23,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:16:23,333 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 377 transitions. [2024-10-13 02:16:23,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (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-13 02:16:23,334 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 377 transitions. [2024-10-13 02:16:23,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 02:16:23,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:16:23,337 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-13 02:16:23,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 02:16:23,337 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:16:23,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:16:23,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1213952040, now seen corresponding path program 1 times [2024-10-13 02:16:23,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:16:23,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66356218] [2024-10-13 02:16:23,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:16:23,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:16:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:23,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:16:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:23,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:16:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:23,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:16:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:23,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:16:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:23,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:16:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:23,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:16:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:23,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:16:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:23,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:16:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:23,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:16:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:23,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:16:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:23,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:16:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:23,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:16:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:23,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:16:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:23,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:16:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:23,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:16:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:23,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:16:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:23,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:16:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:23,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:16:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:23,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:16:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:23,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:16:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:23,904 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-13 02:16:23,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:16:23,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66356218] [2024-10-13 02:16:23,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66356218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:16:23,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:16:23,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 02:16:23,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469660427] [2024-10-13 02:16:23,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:16:23,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 02:16:23,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:16:23,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 02:16:23,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:16:23,908 INFO L87 Difference]: Start difference. First operand 248 states and 377 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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-13 02:16:24,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:16:24,236 INFO L93 Difference]: Finished difference Result 645 states and 971 transitions. [2024-10-13 02:16:24,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:16:24,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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-13 02:16:24,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:16:24,241 INFO L225 Difference]: With dead ends: 645 [2024-10-13 02:16:24,241 INFO L226 Difference]: Without dead ends: 398 [2024-10-13 02:16:24,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-13 02:16:24,243 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 303 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:16:24,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 452 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 02:16:24,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-10-13 02:16:24,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 375. [2024-10-13 02:16:24,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 311 states have (on average 1.4019292604501608) internal successors, (436), 311 states have internal predecessors, (436), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 02:16:24,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 556 transitions. [2024-10-13 02:16:24,278 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 556 transitions. Word has length 137 [2024-10-13 02:16:24,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:16:24,279 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 556 transitions. [2024-10-13 02:16:24,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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-13 02:16:24,280 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 556 transitions. [2024-10-13 02:16:24,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-13 02:16:24,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:16:24,282 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-13 02:16:24,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 02:16:24,282 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:16:24,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:16:24,282 INFO L85 PathProgramCache]: Analyzing trace with hash 2049437269, now seen corresponding path program 1 times [2024-10-13 02:16:24,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:16:24,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192010455] [2024-10-13 02:16:24,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:16:24,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:16:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:16:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:16:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:16:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:16:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:16:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:16:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:16:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:16:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:16:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:16:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:16:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:16:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:16:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:16:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:16:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:16:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:16:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:16:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:16:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:16:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,563 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-13 02:16:24,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:16:24,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192010455] [2024-10-13 02:16:24,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192010455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:16:24,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:16:24,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:16:24,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578375003] [2024-10-13 02:16:24,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:16:24,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:16:24,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:16:24,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:16:24,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:16:24,565 INFO L87 Difference]: Start difference. First operand 375 states and 556 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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-13 02:16:24,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:16:24,613 INFO L93 Difference]: Finished difference Result 789 states and 1172 transitions. [2024-10-13 02:16:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:16:24,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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-13 02:16:24,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:16:24,616 INFO L225 Difference]: With dead ends: 789 [2024-10-13 02:16:24,616 INFO L226 Difference]: Without dead ends: 415 [2024-10-13 02:16:24,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:16:24,617 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 100 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:16:24,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 511 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:16:24,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-10-13 02:16:24,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 375. [2024-10-13 02:16:24,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 311 states have (on average 1.3762057877813505) internal successors, (428), 311 states have internal predecessors, (428), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 02:16:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 548 transitions. [2024-10-13 02:16:24,637 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 548 transitions. Word has length 138 [2024-10-13 02:16:24,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:16:24,637 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 548 transitions. [2024-10-13 02:16:24,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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-13 02:16:24,638 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 548 transitions. [2024-10-13 02:16:24,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-13 02:16:24,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:16:24,639 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, 1, 1, 1] [2024-10-13 02:16:24,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 02:16:24,639 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:16:24,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:16:24,640 INFO L85 PathProgramCache]: Analyzing trace with hash 244122794, now seen corresponding path program 1 times [2024-10-13 02:16:24,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:16:24,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367711732] [2024-10-13 02:16:24,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:16:24,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:16:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:16:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:16:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:16:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:16:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:16:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:16:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:16:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:16:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:16:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:16:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:16:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:16:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:16:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:16:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:16:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:16:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:16:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:16:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:16:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:16:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:24,802 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-13 02:16:24,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:16:24,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367711732] [2024-10-13 02:16:24,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367711732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:16:24,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:16:24,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:16:24,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878180561] [2024-10-13 02:16:24,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:16:24,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:16:24,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:16:24,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:16:24,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:16:24,806 INFO L87 Difference]: Start difference. First operand 375 states and 548 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-13 02:16:24,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:16:24,835 INFO L93 Difference]: Finished difference Result 750 states and 1097 transitions. [2024-10-13 02:16:24,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:16:24,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 141 [2024-10-13 02:16:24,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:16:24,838 INFO L225 Difference]: With dead ends: 750 [2024-10-13 02:16:24,838 INFO L226 Difference]: Without dead ends: 376 [2024-10-13 02:16:24,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:16:24,839 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:16:24,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 290 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:16:24,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-10-13 02:16:24,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2024-10-13 02:16:24,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 312 states have (on average 1.3685897435897436) internal successors, (427), 312 states have internal predecessors, (427), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 02:16:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 547 transitions. [2024-10-13 02:16:24,860 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 547 transitions. Word has length 141 [2024-10-13 02:16:24,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:16:24,861 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 547 transitions. [2024-10-13 02:16:24,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-13 02:16:24,861 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 547 transitions. [2024-10-13 02:16:24,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-13 02:16:24,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:16:24,864 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, 1, 1, 1] [2024-10-13 02:16:24,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 02:16:24,865 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:16:24,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:16:24,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1035740884, now seen corresponding path program 1 times [2024-10-13 02:16:24,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:16:24,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309417649] [2024-10-13 02:16:24,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:16:24,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:16:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:25,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:16:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:25,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:16:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:25,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:16:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:25,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:16:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:25,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:16:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:25,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:16:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:25,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:16:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:25,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:16:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:25,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:16:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:25,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:16:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:25,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:16:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:25,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:16:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:25,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:16:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:25,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:16:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:25,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:16:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:25,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:16:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:25,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:16:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:25,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:16:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:25,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:16:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:25,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:16:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:25,044 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-13 02:16:25,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:16:25,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309417649] [2024-10-13 02:16:25,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309417649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:16:25,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:16:25,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:16:25,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567828687] [2024-10-13 02:16:25,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:16:25,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:16:25,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:16:25,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:16:25,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:16:25,046 INFO L87 Difference]: Start difference. First operand 376 states and 547 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-13 02:16:25,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:16:25,360 INFO L93 Difference]: Finished difference Result 646 states and 953 transitions. [2024-10-13 02:16:25,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 02:16:25,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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 141 [2024-10-13 02:16:25,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:16:25,363 INFO L225 Difference]: With dead ends: 646 [2024-10-13 02:16:25,363 INFO L226 Difference]: Without dead ends: 515 [2024-10-13 02:16:25,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:16:25,365 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 258 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:16:25,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 713 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 02:16:25,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-10-13 02:16:25,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 397. [2024-10-13 02:16:25,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 333 states have (on average 1.3783783783783783) internal successors, (459), 333 states have internal predecessors, (459), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 02:16:25,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 579 transitions. [2024-10-13 02:16:25,392 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 579 transitions. Word has length 141 [2024-10-13 02:16:25,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:16:25,392 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 579 transitions. [2024-10-13 02:16:25,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-13 02:16:25,393 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 579 transitions. [2024-10-13 02:16:25,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 02:16:25,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:16:25,394 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, 1, 1, 1, 1] [2024-10-13 02:16:25,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 02:16:25,394 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:16:25,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:16:25,394 INFO L85 PathProgramCache]: Analyzing trace with hash -2038831618, now seen corresponding path program 1 times [2024-10-13 02:16:25,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:16:25,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166189419] [2024-10-13 02:16:25,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:16:25,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:16:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:30,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:16:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:30,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:16:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:30,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:16:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:30,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:16:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:30,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:16:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:30,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:16:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:30,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:16:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:30,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:16:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:30,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:16:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:30,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:16:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:30,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:16:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:30,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:16:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:30,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:16:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:30,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:16:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:30,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:16:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:30,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:16:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:30,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:16:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:30,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:16:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:30,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:16:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:30,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:16:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:30,488 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-13 02:16:30,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:16:30,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166189419] [2024-10-13 02:16:30,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166189419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:16:30,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:16:30,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 02:16:30,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822011394] [2024-10-13 02:16:30,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:16:30,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 02:16:30,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:16:30,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 02:16:30,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-13 02:16:30,490 INFO L87 Difference]: Start difference. First operand 397 states and 579 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 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-13 02:16:32,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:16:32,833 INFO L93 Difference]: Finished difference Result 1057 states and 1521 transitions. [2024-10-13 02:16:32,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 02:16:32,834 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 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 142 [2024-10-13 02:16:32,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:16:32,837 INFO L225 Difference]: With dead ends: 1057 [2024-10-13 02:16:32,837 INFO L226 Difference]: Without dead ends: 788 [2024-10-13 02:16:32,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-13 02:16:32,839 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 143 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:16:32,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 527 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 02:16:32,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2024-10-13 02:16:32,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 721. [2024-10-13 02:16:32,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 648 states have (on average 1.3919753086419753) internal successors, (902), 651 states have internal predecessors, (902), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 02:16:32,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1034 transitions. [2024-10-13 02:16:32,888 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1034 transitions. Word has length 142 [2024-10-13 02:16:32,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:16:32,889 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 1034 transitions. [2024-10-13 02:16:32,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 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-13 02:16:32,889 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1034 transitions. [2024-10-13 02:16:32,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 02:16:32,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:16:32,891 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, 1, 1, 1, 1] [2024-10-13 02:16:32,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 02:16:32,891 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:16:32,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:16:32,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1746662588, now seen corresponding path program 1 times [2024-10-13 02:16:32,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:16:32,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470314828] [2024-10-13 02:16:32,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:16:32,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:16:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 02:16:32,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [52144958] [2024-10-13 02:16:32,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:16:32,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:16:32,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:16:32,961 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-13 02:16:32,963 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-13 02:16:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:16:33,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 02:16:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:16:33,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 02:16:33,251 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 02:16:33,252 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 02:16:33,271 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-13 02:16:33,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:16:33,457 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:16:33,541 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 02:16:33,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:16:33 BoogieIcfgContainer [2024-10-13 02:16:33,544 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 02:16:33,544 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 02:16:33,545 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 02:16:33,545 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 02:16:33,545 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:16:21" (3/4) ... [2024-10-13 02:16:33,547 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 02:16:33,548 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 02:16:33,548 INFO L158 Benchmark]: Toolchain (without parser) took 12956.30ms. Allocated memory was 159.4MB in the beginning and 333.4MB in the end (delta: 174.1MB). Free memory was 90.3MB in the beginning and 282.8MB in the end (delta: -192.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:16:33,548 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:16:33,548 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.10ms. Allocated memory is still 159.4MB. Free memory was 90.1MB in the beginning and 126.7MB in the end (delta: -36.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 02:16:33,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.86ms. Allocated memory is still 159.4MB. Free memory was 126.7MB in the beginning and 120.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 02:16:33,549 INFO L158 Benchmark]: Boogie Preprocessor took 71.79ms. Allocated memory is still 159.4MB. Free memory was 120.5MB in the beginning and 112.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 02:16:33,549 INFO L158 Benchmark]: RCFGBuilder took 565.38ms. Allocated memory is still 159.4MB. Free memory was 112.1MB in the beginning and 74.3MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-13 02:16:33,549 INFO L158 Benchmark]: TraceAbstraction took 11910.27ms. Allocated memory was 159.4MB in the beginning and 333.4MB in the end (delta: 174.1MB). Free memory was 73.7MB in the beginning and 282.8MB in the end (delta: -209.0MB). Peak memory consumption was 148.6MB. Max. memory is 16.1GB. [2024-10-13 02:16:33,549 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 333.4MB. Free memory is still 282.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:16:33,550 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.10ms. Allocated memory is still 159.4MB. Free memory was 90.1MB in the beginning and 126.7MB in the end (delta: -36.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.86ms. Allocated memory is still 159.4MB. Free memory was 126.7MB in the beginning and 120.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.79ms. Allocated memory is still 159.4MB. Free memory was 120.5MB in the beginning and 112.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 565.38ms. Allocated memory is still 159.4MB. Free memory was 112.1MB in the beginning and 74.3MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11910.27ms. Allocated memory was 159.4MB in the beginning and 333.4MB in the end (delta: 174.1MB). Free memory was 73.7MB in the beginning and 282.8MB in the end (delta: -209.0MB). Peak memory consumption was 148.6MB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 333.4MB. Free memory is still 282.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed short int var_1_24 = -4; [L40] unsigned short int var_1_29 = 8; [L41] unsigned short int var_1_33 = 48416; [L42] unsigned char var_1_35 = 4; [L43] unsigned long int var_1_37 = 32; [L44] unsigned char var_1_38 = 8; [L45] double var_1_40 = 31.75; [L46] double var_1_41 = 5.5; [L47] signed char var_1_43 = 100; [L48] signed long int last_1_var_1_5 = 5; [L178] isInitial = 1 [L179] FCALL initially() [L180] COND TRUE 1 [L181] CALL updateLastVariables() [L171] last_1_var_1_5 = var_1_5 [L181] RET updateLastVariables() [L182] CALL updateVariables() [L137] var_1_9 = __VERIFIER_nondet_float() [L138] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L138] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L139] var_1_10 = __VERIFIER_nondet_float() [L140] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L140] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L141] var_1_11 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L142] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L143] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L143] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L144] var_1_12 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L145] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L146] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L146] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L147] var_1_13 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L148] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L149] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L149] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L150] var_1_14 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L151] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L152] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L152] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L153] var_1_18 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L154] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L155] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L155] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L156] var_1_19 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L157] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L158] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L158] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L159] var_1_23 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L160] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L161] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L161] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L162] var_1_33 = __VERIFIER_nondet_ushort() [L163] CALL assume_abort_if_not(var_1_33 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L163] RET assume_abort_if_not(var_1_33 >= 32767) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L164] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L164] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L165] var_1_40 = __VERIFIER_nondet_double() [L166] CALL assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L166] RET assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L167] var_1_41 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L168] RET assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L182] RET updateVariables() [L183] CALL step() [L52] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L55] COND TRUE ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))) >= var_1_12 [L56] var_1_37 = var_1_14 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L58] var_1_20 = var_1_8 [L59] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L60] COND TRUE (var_1_20 / var_1_12) < var_1_13 [L61] var_1_29 = var_1_12 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L65] COND FALSE !((var_1_9 * (var_1_40 - var_1_41)) >= var_1_9) [L72] var_1_38 = var_1_13 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=100, var_1_5=5, var_1_8=0] [L74] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=100, var_1_5=5, var_1_8=0] [L77] COND FALSE !(\read(var_1_22)) [L82] var_1_24 = ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=100, var_1_5=5, var_1_8=0] [L84] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=100, var_1_5=5, var_1_8=0] [L87] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=100, var_1_5=5, var_1_8=0] [L88] COND FALSE !(\read(var_1_22)) [L95] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=100, var_1_5=5, var_1_8=0] [L97] COND FALSE !(((((var_1_10) > (64.75f)) ? (var_1_10) : (64.75f))) <= var_1_40) [L104] var_1_43 = var_1_13 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=5, var_1_8=0] [L106] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L107] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=5, var_1_8=0] [L108] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=5, var_1_8=0] [L109] COND FALSE !(\read(var_1_22)) [L116] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=5, var_1_8=0] [L121] signed long int stepLocal_4 = 256; [L122] unsigned char stepLocal_3 = var_1_22; [L123] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=5, var_1_8=0] [L124] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=5, var_1_8=0] [L127] COND FALSE !(stepLocal_3 || var_1_22) [L132] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L183] RET step() [L184] CALL, EXPR property() [L174] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L174] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L174] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L174] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L174] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L174] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L174-L175] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L184] RET, EXPR property() [L184] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.8s, OverallIterations: 9, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1089 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1089 mSDsluCounter, 3487 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2007 mSDsCounter, 168 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1350 IncrementalHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 168 mSolverCounterUnsat, 1480 mSDtfsCounter, 1350 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=721occurred in iteration=8, InterpolantAutomatonStates: 38, 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, 8 MinimizatonAttempts, 336 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 1391 NumberOfCodeBlocks, 1391 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1099 ConstructedInterpolants, 0 QuantifiedInterpolants, 11102 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 6080/6080 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-13 02:16:33,628 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-pr-ci_file-97.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 84a77ba55ab51f560e1bf3563bb3191090888d113bc8317dcee7de2867768a2d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:16:35,484 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:16:35,546 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 02:16:35,550 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:16:35,550 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:16:35,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:16:35,569 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:16:35,569 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:16:35,569 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:16:35,570 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:16:35,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:16:35,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:16:35,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:16:35,573 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:16:35,573 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:16:35,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:16:35,573 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:16:35,574 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:16:35,574 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:16:35,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:16:35,576 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:16:35,576 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:16:35,576 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:16:35,577 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 02:16:35,577 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 02:16:35,577 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:16:35,577 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 02:16:35,577 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:16:35,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:16:35,578 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:16:35,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:16:35,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:16:35,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:16:35,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:16:35,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:16:35,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:16:35,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:16:35,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:16:35,579 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 02:16:35,579 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 02:16:35,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:16:35,581 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:16:35,581 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:16:35,581 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:16:35,581 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 02:16:35,582 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 -> 84a77ba55ab51f560e1bf3563bb3191090888d113bc8317dcee7de2867768a2d [2024-10-13 02:16:35,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:16:35,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:16:35,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:16:35,861 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:16:35,862 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:16:35,863 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i [2024-10-13 02:16:37,121 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:16:37,321 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:16:37,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i [2024-10-13 02:16:37,332 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f490e4c98/7912b3d0db784b9b9fab3d5ddce04a23/FLAG17e3afaf8 [2024-10-13 02:16:37,343 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f490e4c98/7912b3d0db784b9b9fab3d5ddce04a23 [2024-10-13 02:16:37,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:16:37,346 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:16:37,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:16:37,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:16:37,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:16:37,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:16:37" (1/1) ... [2024-10-13 02:16:37,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@439b497f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:37, skipping insertion in model container [2024-10-13 02:16:37,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:16:37" (1/1) ... [2024-10-13 02:16:37,384 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:16:37,572 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-pr-ci_file-97.i[919,932] [2024-10-13 02:16:37,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:16:37,672 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:16:37,683 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-pr-ci_file-97.i[919,932] [2024-10-13 02:16:37,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:16:37,742 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:16:37,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:37 WrapperNode [2024-10-13 02:16:37,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:16:37,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:16:37,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:16:37,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:16:37,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:37" (1/1) ... [2024-10-13 02:16:37,761 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:37" (1/1) ... [2024-10-13 02:16:37,797 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2024-10-13 02:16:37,797 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:16:37,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:16:37,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:16:37,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:16:37,807 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:37" (1/1) ... [2024-10-13 02:16:37,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:37" (1/1) ... [2024-10-13 02:16:37,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:37" (1/1) ... [2024-10-13 02:16:37,829 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-13 02:16:37,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:37" (1/1) ... [2024-10-13 02:16:37,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:37" (1/1) ... [2024-10-13 02:16:37,839 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:37" (1/1) ... [2024-10-13 02:16:37,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:37" (1/1) ... [2024-10-13 02:16:37,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:37" (1/1) ... [2024-10-13 02:16:37,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:37" (1/1) ... [2024-10-13 02:16:37,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:16:37,858 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:16:37,858 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:16:37,858 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:16:37,859 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:37" (1/1) ... [2024-10-13 02:16:37,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:16:37,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:16:37,887 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-13 02:16:37,893 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-13 02:16:37,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:16:37,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 02:16:37,930 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:16:37,931 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:16:37,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:16:37,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:16:38,011 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:16:38,013 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:16:43,895 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-13 02:16:43,896 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:16:43,941 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:16:43,941 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:16:43,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:16:43 BoogieIcfgContainer [2024-10-13 02:16:43,941 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:16:43,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:16:43,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:16:43,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:16:43,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:16:37" (1/3) ... [2024-10-13 02:16:43,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a8d77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:16:43, skipping insertion in model container [2024-10-13 02:16:43,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:16:37" (2/3) ... [2024-10-13 02:16:43,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a8d77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:16:43, skipping insertion in model container [2024-10-13 02:16:43,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:16:43" (3/3) ... [2024-10-13 02:16:43,951 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i [2024-10-13 02:16:43,964 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:16:43,964 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:16:44,018 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:16:44,024 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;@3c13f3b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:16:44,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:16:44,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 47 states have internal predecessors, (71), 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-13 02:16:44,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-13 02:16:44,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:16:44,041 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] [2024-10-13 02:16:44,041 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:16:44,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:16:44,046 INFO L85 PathProgramCache]: Analyzing trace with hash -590971721, now seen corresponding path program 1 times [2024-10-13 02:16:44,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:16:44,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594236644] [2024-10-13 02:16:44,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:16:44,077 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-13 02:16:44,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:16:44,080 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-13 02:16:44,081 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-13 02:16:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:44,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 02:16:44,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:16:44,484 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-13 02:16:44,485 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:16:44,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:16:44,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594236644] [2024-10-13 02:16:44,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594236644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:16:44,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:16:44,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:16:44,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606545507] [2024-10-13 02:16:44,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:16:44,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:16:44,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:16:44,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:16:44,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:16:44,512 INFO L87 Difference]: Start difference. First operand has 69 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 47 states have internal predecessors, (71), 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 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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-13 02:16:44,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:16:44,564 INFO L93 Difference]: Finished difference Result 135 states and 240 transitions. [2024-10-13 02:16:44,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:16:44,568 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (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 132 [2024-10-13 02:16:44,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:16:44,575 INFO L225 Difference]: With dead ends: 135 [2024-10-13 02:16:44,575 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 02:16:44,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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-13 02:16:44,581 INFO L432 NwaCegarLoop]: 102 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, 102 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-13 02:16:44,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:16:44,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 02:16:44,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-13 02:16:44,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 45 states have internal predecessors, (65), 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-13 02:16:44,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 105 transitions. [2024-10-13 02:16:44,617 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 105 transitions. Word has length 132 [2024-10-13 02:16:44,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:16:44,617 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 105 transitions. [2024-10-13 02:16:44,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (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-13 02:16:44,618 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 105 transitions. [2024-10-13 02:16:44,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-13 02:16:44,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:16:44,620 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] [2024-10-13 02:16:44,631 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-13 02:16:44,824 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-13 02:16:44,825 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:16:44,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:16:44,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2069329583, now seen corresponding path program 1 times [2024-10-13 02:16:44,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:16:44,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368752276] [2024-10-13 02:16:44,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:16:44,827 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-13 02:16:44,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:16:44,830 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-13 02:16:44,830 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-13 02:16:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:45,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 02:16:45,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:16:45,508 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 289 proven. 12 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2024-10-13 02:16:45,510 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:16:46,044 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-13 02:16:46,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:16:46,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368752276] [2024-10-13 02:16:46,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368752276] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:16:46,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 02:16:46,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-13 02:16:46,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960212773] [2024-10-13 02:16:46,045 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 02:16:46,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 02:16:46,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:16:46,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 02:16:46,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 02:16:46,047 INFO L87 Difference]: Start difference. First operand 67 states and 105 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-13 02:16:46,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:16:46,766 INFO L93 Difference]: Finished difference Result 138 states and 210 transitions. [2024-10-13 02:16:46,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 02:16:46,766 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 132 [2024-10-13 02:16:46,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:16:46,768 INFO L225 Difference]: With dead ends: 138 [2024-10-13 02:16:46,768 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 02:16:46,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-10-13 02:16:46,769 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 102 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 02:16:46,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 141 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 02:16:46,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 02:16:46,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2024-10-13 02:16:46,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 02:16:46,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 97 transitions. [2024-10-13 02:16:46,781 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 97 transitions. Word has length 132 [2024-10-13 02:16:46,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:16:46,781 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 97 transitions. [2024-10-13 02:16:46,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-13 02:16:46,781 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 97 transitions. [2024-10-13 02:16:46,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-13 02:16:46,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:16:46,783 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] [2024-10-13 02:16:46,796 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-13 02:16:46,983 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-13 02:16:46,984 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:16:46,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:16:46,984 INFO L85 PathProgramCache]: Analyzing trace with hash -2111379149, now seen corresponding path program 1 times [2024-10-13 02:16:46,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:16:46,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697224685] [2024-10-13 02:16:46,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:16:46,985 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-13 02:16:46,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:16:46,987 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-13 02:16:46,988 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-13 02:16:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:47,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 02:16:47,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:16:48,435 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-13 02:16:48,435 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:16:48,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:16:48,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1697224685] [2024-10-13 02:16:48,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1697224685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:16:48,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:16:48,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:16:48,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912581709] [2024-10-13 02:16:48,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:16:48,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:16:48,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:16:48,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:16:48,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:16:48,437 INFO L87 Difference]: Start difference. First operand 68 states and 97 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (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-13 02:16:49,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:16:49,108 INFO L93 Difference]: Finished difference Result 179 states and 257 transitions. [2024-10-13 02:16:49,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:16:49,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (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 132 [2024-10-13 02:16:49,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:16:49,112 INFO L225 Difference]: With dead ends: 179 [2024-10-13 02:16:49,112 INFO L226 Difference]: Without dead ends: 112 [2024-10-13 02:16:49,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 02:16:49,113 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 84 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 02:16:49,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 295 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 02:16:49,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-13 02:16:49,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 68. [2024-10-13 02:16:49,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 45 states have internal predecessors, (55), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 02:16:49,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2024-10-13 02:16:49,127 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 95 transitions. Word has length 132 [2024-10-13 02:16:49,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:16:49,128 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 95 transitions. [2024-10-13 02:16:49,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (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-13 02:16:49,128 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 95 transitions. [2024-10-13 02:16:49,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-13 02:16:49,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:16:49,130 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-13 02:16:49,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-13 02:16:49,330 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-13 02:16:49,331 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:16:49,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:16:49,332 INFO L85 PathProgramCache]: Analyzing trace with hash -716895116, now seen corresponding path program 1 times [2024-10-13 02:16:49,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:16:49,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907349238] [2024-10-13 02:16:49,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:16:49,333 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-13 02:16:49,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:16:49,335 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-13 02:16:49,336 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-13 02:16:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:49,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 02:16:49,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:16:51,441 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-13 02:16:51,441 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:16:51,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:16:51,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907349238] [2024-10-13 02:16:51,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907349238] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:16:51,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:16:51,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:16:51,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899077930] [2024-10-13 02:16:51,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:16:51,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:16:51,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:16:51,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:16:51,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:16:51,443 INFO L87 Difference]: Start difference. First operand 68 states and 95 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-13 02:16:51,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:16:51,907 INFO L93 Difference]: Finished difference Result 208 states and 289 transitions. [2024-10-13 02:16:51,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:16:51,907 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-13 02:16:51,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:16:51,910 INFO L225 Difference]: With dead ends: 208 [2024-10-13 02:16:51,910 INFO L226 Difference]: Without dead ends: 141 [2024-10-13 02:16:51,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 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-13 02:16:51,911 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 67 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 02:16:51,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 292 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 02:16:51,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-13 02:16:51,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 133. [2024-10-13 02:16:51,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 88 states have internal predecessors, (107), 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-13 02:16:51,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 187 transitions. [2024-10-13 02:16:51,941 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 187 transitions. Word has length 133 [2024-10-13 02:16:51,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:16:51,941 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 187 transitions. [2024-10-13 02:16:51,941 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-13 02:16:51,942 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 187 transitions. [2024-10-13 02:16:51,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 02:16:51,943 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:16:51,943 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-13 02:16:51,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-13 02:16:52,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-13 02:16:52,144 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:16:52,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:16:52,144 INFO L85 PathProgramCache]: Analyzing trace with hash -749262764, now seen corresponding path program 1 times [2024-10-13 02:16:52,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:16:52,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443172451] [2024-10-13 02:16:52,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:16:52,145 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-13 02:16:52,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:16:52,148 INFO L229 MonitoredProcess]: Starting monitored process 6 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-13 02:16:52,151 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 (6)] Waiting until timeout for monitored process [2024-10-13 02:16:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:16:52,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-13 02:16:52,484 INFO L278 TraceCheckSpWp]: Computing forward predicates...