./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_loopvsstraightlinecode_50-1loop_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_loopvsstraightlinecode_50-1loop_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 7546368952c9092d5ff7b1c9b7170a5f4931681ecce745d3ea9c0f5a0ac16217 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 12:03:28,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 12:03:28,497 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 12:03:28,508 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 12:03:28,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 12:03:28,540 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 12:03:28,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 12:03:28,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 12:03:28,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 12:03:28,543 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 12:03:28,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 12:03:28,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 12:03:28,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 12:03:28,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 12:03:28,545 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 12:03:28,545 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 12:03:28,549 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 12:03:28,549 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 12:03:28,550 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 12:03:28,550 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 12:03:28,550 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 12:03:28,551 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 12:03:28,551 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 12:03:28,551 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 12:03:28,552 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 12:03:28,552 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 12:03:28,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 12:03:28,553 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 12:03:28,553 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 12:03:28,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 12:03:28,553 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 12:03:28,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 12:03:28,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:03:28,559 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 12:03:28,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 12:03:28,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 12:03:28,559 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 12:03:28,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 12:03:28,560 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 12:03:28,560 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 12:03:28,561 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 12:03:28,564 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 12:03:28,564 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 -> 7546368952c9092d5ff7b1c9b7170a5f4931681ecce745d3ea9c0f5a0ac16217 [2024-10-14 12:03:28,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 12:03:28,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 12:03:28,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 12:03:28,914 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 12:03:28,915 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 12:03:28,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-97.i [2024-10-14 12:03:30,611 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 12:03:30,839 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 12:03:30,840 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-97.i [2024-10-14 12:03:30,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83fdcd68c/4437884808f546dfac3092625d18dcbe/FLAG418a55020 [2024-10-14 12:03:31,187 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83fdcd68c/4437884808f546dfac3092625d18dcbe [2024-10-14 12:03:31,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 12:03:31,191 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 12:03:31,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 12:03:31,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 12:03:31,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 12:03:31,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:03:31" (1/1) ... [2024-10-14 12:03:31,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f58eb66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:31, skipping insertion in model container [2024-10-14 12:03:31,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:03:31" (1/1) ... [2024-10-14 12:03:31,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 12:03:31,397 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_loopvsstraightlinecode_50-1loop_file-97.i[915,928] [2024-10-14 12:03:31,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:03:31,518 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 12:03:31,533 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_loopvsstraightlinecode_50-1loop_file-97.i[915,928] [2024-10-14 12:03:31,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:03:31,605 INFO L204 MainTranslator]: Completed translation [2024-10-14 12:03:31,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:31 WrapperNode [2024-10-14 12:03:31,606 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 12:03:31,607 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 12:03:31,607 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 12:03:31,607 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 12:03:31,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:31" (1/1) ... [2024-10-14 12:03:31,626 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:31" (1/1) ... [2024-10-14 12:03:31,674 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2024-10-14 12:03:31,674 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 12:03:31,675 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 12:03:31,675 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 12:03:31,675 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 12:03:31,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:31" (1/1) ... [2024-10-14 12:03:31,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:31" (1/1) ... [2024-10-14 12:03:31,704 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:31" (1/1) ... [2024-10-14 12:03:31,747 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-14 12:03:31,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:31" (1/1) ... [2024-10-14 12:03:31,753 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:31" (1/1) ... [2024-10-14 12:03:31,770 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:31" (1/1) ... [2024-10-14 12:03:31,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:31" (1/1) ... [2024-10-14 12:03:31,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:31" (1/1) ... [2024-10-14 12:03:31,792 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:31" (1/1) ... [2024-10-14 12:03:31,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 12:03:31,800 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 12:03:31,800 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 12:03:31,800 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 12:03:31,801 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:31" (1/1) ... [2024-10-14 12:03:31,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:03:31,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:03:31,843 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-14 12:03:31,848 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-14 12:03:31,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 12:03:31,886 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 12:03:31,887 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 12:03:31,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 12:03:31,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 12:03:31,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 12:03:31,960 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 12:03:31,962 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 12:03:32,526 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-10-14 12:03:32,526 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 12:03:32,560 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 12:03:32,561 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 12:03:32,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:03:32 BoogieIcfgContainer [2024-10-14 12:03:32,561 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 12:03:32,564 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 12:03:32,564 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 12:03:32,567 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 12:03:32,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:03:31" (1/3) ... [2024-10-14 12:03:32,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c810cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:03:32, skipping insertion in model container [2024-10-14 12:03:32,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:31" (2/3) ... [2024-10-14 12:03:32,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c810cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:03:32, skipping insertion in model container [2024-10-14 12:03:32,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:03:32" (3/3) ... [2024-10-14 12:03:32,570 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-97.i [2024-10-14 12:03:32,586 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 12:03:32,587 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 12:03:32,646 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 12:03:32,653 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;@2dfac33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 12:03:32,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 12:03:32,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 58 states have internal predecessors, (85), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 12:03:32,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 12:03:32,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:03:32,675 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:03:32,676 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:03:32,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:03:32,683 INFO L85 PathProgramCache]: Analyzing trace with hash -187669195, now seen corresponding path program 1 times [2024-10-14 12:03:32,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:03:32,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578713271] [2024-10-14 12:03:32,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:03:32,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:03:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:32,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:03:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:32,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 12:03:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:32,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 12:03:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 12:03:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 12:03:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:03:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:03:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:03:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:03:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:03:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:03:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:03:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:03:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 12:03:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 12:03:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 12:03:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,115 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 12:03:33,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:03:33,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578713271] [2024-10-14 12:03:33,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578713271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:03:33,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:03:33,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 12:03:33,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269157177] [2024-10-14 12:03:33,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:03:33,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 12:03:33,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:03:33,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 12:03:33,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:03:33,153 INFO L87 Difference]: Start difference. First operand has 76 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 58 states have internal predecessors, (85), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 12:03:33,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:03:33,202 INFO L93 Difference]: Finished difference Result 151 states and 249 transitions. [2024-10-14 12:03:33,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 12:03:33,206 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2024-10-14 12:03:33,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:03:33,217 INFO L225 Difference]: With dead ends: 151 [2024-10-14 12:03:33,218 INFO L226 Difference]: Without dead ends: 74 [2024-10-14 12:03:33,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-14 12:03:33,226 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 12:03:33,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:03:33,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-14 12:03:33,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-14 12:03:33,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 56 states have internal predecessors, (80), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 12:03:33,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 112 transitions. [2024-10-14 12:03:33,286 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 112 transitions. Word has length 107 [2024-10-14 12:03:33,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:03:33,287 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 112 transitions. [2024-10-14 12:03:33,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 12:03:33,289 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 112 transitions. [2024-10-14 12:03:33,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 12:03:33,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:03:33,296 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:03:33,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 12:03:33,297 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:03:33,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:03:33,299 INFO L85 PathProgramCache]: Analyzing trace with hash 223222393, now seen corresponding path program 1 times [2024-10-14 12:03:33,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:03:33,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312222916] [2024-10-14 12:03:33,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:03:33,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:03:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:03:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 12:03:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 12:03:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 12:03:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 12:03:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:03:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:03:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:03:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:03:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:03:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:03:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:03:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:03:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 12:03:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 12:03:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 12:03:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:33,575 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 12:03:33,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:03:33,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312222916] [2024-10-14 12:03:33,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312222916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:03:33,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:03:33,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 12:03:33,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860237170] [2024-10-14 12:03:33,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:03:33,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 12:03:33,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:03:33,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 12:03:33,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 12:03:33,583 INFO L87 Difference]: Start difference. First operand 74 states and 112 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:03:33,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:03:33,737 INFO L93 Difference]: Finished difference Result 206 states and 311 transitions. [2024-10-14 12:03:33,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 12:03:33,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2024-10-14 12:03:33,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:03:33,742 INFO L225 Difference]: With dead ends: 206 [2024-10-14 12:03:33,743 INFO L226 Difference]: Without dead ends: 133 [2024-10-14 12:03:33,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-14 12:03:33,748 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 99 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 12:03:33,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 251 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 12:03:33,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-14 12:03:33,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 95. [2024-10-14 12:03:33,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 12:03:33,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 141 transitions. [2024-10-14 12:03:33,770 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 141 transitions. Word has length 107 [2024-10-14 12:03:33,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:03:33,772 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 141 transitions. [2024-10-14 12:03:33,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:03:33,772 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 141 transitions. [2024-10-14 12:03:33,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 12:03:33,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:03:33,776 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:03:33,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 12:03:33,777 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:03:33,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:03:33,778 INFO L85 PathProgramCache]: Analyzing trace with hash -787894857, now seen corresponding path program 1 times [2024-10-14 12:03:33,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:03:33,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559037149] [2024-10-14 12:03:33,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:03:33,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:03:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:34,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:03:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:34,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 12:03:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:34,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 12:03:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:34,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 12:03:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:34,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 12:03:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:34,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:03:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:34,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:03:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:34,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:03:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:34,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:03:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:34,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:03:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:34,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:03:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:34,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:03:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:34,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:03:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:34,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 12:03:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:34,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 12:03:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:34,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 12:03:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:34,301 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 12:03:34,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:03:34,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559037149] [2024-10-14 12:03:34,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559037149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:03:34,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:03:34,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 12:03:34,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487793053] [2024-10-14 12:03:34,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:03:34,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 12:03:34,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:03:34,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 12:03:34,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 12:03:34,306 INFO L87 Difference]: Start difference. First operand 95 states and 141 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:03:34,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:03:34,657 INFO L93 Difference]: Finished difference Result 309 states and 461 transitions. [2024-10-14 12:03:34,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 12:03:34,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2024-10-14 12:03:34,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:03:34,662 INFO L225 Difference]: With dead ends: 309 [2024-10-14 12:03:34,664 INFO L226 Difference]: Without dead ends: 215 [2024-10-14 12:03:34,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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-14 12:03:34,667 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 117 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 12:03:34,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 346 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 12:03:34,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-14 12:03:34,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 181. [2024-10-14 12:03:34,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 146 states have (on average 1.3972602739726028) internal successors, (204), 146 states have internal predecessors, (204), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 12:03:34,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 268 transitions. [2024-10-14 12:03:34,706 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 268 transitions. Word has length 107 [2024-10-14 12:03:34,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:03:34,706 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 268 transitions. [2024-10-14 12:03:34,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:03:34,707 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 268 transitions. [2024-10-14 12:03:34,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 12:03:34,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:03:34,709 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:03:34,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 12:03:34,709 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:03:34,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:03:34,710 INFO L85 PathProgramCache]: Analyzing trace with hash 318589422, now seen corresponding path program 1 times [2024-10-14 12:03:34,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:03:34,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411545928] [2024-10-14 12:03:34,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:03:34,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:03:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:35,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:03:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:35,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 12:03:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:35,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 12:03:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:35,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 12:03:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:35,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 12:03:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:35,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:03:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:35,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:03:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:35,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:03:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:35,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:03:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:35,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:03:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:35,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:03:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:35,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:03:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:35,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:03:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:35,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 12:03:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:35,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 12:03:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:35,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 12:03:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:35,357 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 12:03:35,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:03:35,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411545928] [2024-10-14 12:03:35,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411545928] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:03:35,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:03:35,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 12:03:35,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703132746] [2024-10-14 12:03:35,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:03:35,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 12:03:35,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:03:35,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 12:03:35,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 12:03:35,365 INFO L87 Difference]: Start difference. First operand 181 states and 268 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:03:35,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:03:35,818 INFO L93 Difference]: Finished difference Result 480 states and 704 transitions. [2024-10-14 12:03:35,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 12:03:35,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2024-10-14 12:03:35,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:03:35,822 INFO L225 Difference]: With dead ends: 480 [2024-10-14 12:03:35,826 INFO L226 Difference]: Without dead ends: 300 [2024-10-14 12:03:35,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 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-14 12:03:35,828 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 166 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 12:03:35,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 441 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 12:03:35,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-14 12:03:35,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 277. [2024-10-14 12:03:35,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 225 states have (on average 1.3422222222222222) internal successors, (302), 225 states have internal predecessors, (302), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 12:03:35,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 398 transitions. [2024-10-14 12:03:35,878 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 398 transitions. Word has length 108 [2024-10-14 12:03:35,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:03:35,879 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 398 transitions. [2024-10-14 12:03:35,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:03:35,879 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 398 transitions. [2024-10-14 12:03:35,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 12:03:35,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:03:35,884 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:03:35,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 12:03:35,885 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:03:35,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:03:35,885 INFO L85 PathProgramCache]: Analyzing trace with hash -2093475199, now seen corresponding path program 1 times [2024-10-14 12:03:35,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:03:35,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248684327] [2024-10-14 12:03:35,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:03:35,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:03:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:03:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 12:03:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 12:03:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 12:03:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 12:03:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:03:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:03:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:03:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:03:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:03:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:03:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:03:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:03:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 12:03:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 12:03:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 12:03:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 12:03:36,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:03:36,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248684327] [2024-10-14 12:03:36,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248684327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:03:36,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:03:36,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 12:03:36,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070276356] [2024-10-14 12:03:36,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:03:36,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 12:03:36,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:03:36,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 12:03:36,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 12:03:36,134 INFO L87 Difference]: Start difference. First operand 277 states and 398 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:03:36,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:03:36,175 INFO L93 Difference]: Finished difference Result 554 states and 797 transitions. [2024-10-14 12:03:36,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 12:03:36,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2024-10-14 12:03:36,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:03:36,178 INFO L225 Difference]: With dead ends: 554 [2024-10-14 12:03:36,178 INFO L226 Difference]: Without dead ends: 278 [2024-10-14 12:03:36,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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-14 12:03:36,181 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 12:03:36,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:03:36,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-14 12:03:36,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2024-10-14 12:03:36,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 226 states have (on average 1.331858407079646) internal successors, (301), 226 states have internal predecessors, (301), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 12:03:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 397 transitions. [2024-10-14 12:03:36,202 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 397 transitions. Word has length 109 [2024-10-14 12:03:36,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:03:36,203 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 397 transitions. [2024-10-14 12:03:36,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:03:36,203 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 397 transitions. [2024-10-14 12:03:36,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 12:03:36,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:03:36,205 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:03:36,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 12:03:36,205 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:03:36,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:03:36,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1835309761, now seen corresponding path program 1 times [2024-10-14 12:03:36,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:03:36,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981654978] [2024-10-14 12:03:36,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:03:36,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:03:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:03:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 12:03:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 12:03:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 12:03:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 12:03:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:03:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:03:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:03:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:03:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:03:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:03:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:03:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:03:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 12:03:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 12:03:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 12:03:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:36,473 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 12:03:36,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:03:36,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981654978] [2024-10-14 12:03:36,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981654978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:03:36,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:03:36,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 12:03:36,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079802378] [2024-10-14 12:03:36,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:03:36,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 12:03:36,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:03:36,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 12:03:36,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 12:03:36,479 INFO L87 Difference]: Start difference. First operand 278 states and 397 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:03:36,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:03:36,834 INFO L93 Difference]: Finished difference Result 479 states and 692 transitions. [2024-10-14 12:03:36,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 12:03:36,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2024-10-14 12:03:36,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:03:36,842 INFO L225 Difference]: With dead ends: 479 [2024-10-14 12:03:36,843 INFO L226 Difference]: Without dead ends: 384 [2024-10-14 12:03:36,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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-14 12:03:36,844 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 196 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 12:03:36,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 532 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 12:03:36,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-10-14 12:03:36,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 285. [2024-10-14 12:03:36,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 233 states have (on average 1.3347639484978542) internal successors, (311), 233 states have internal predecessors, (311), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 12:03:36,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 407 transitions. [2024-10-14 12:03:36,889 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 407 transitions. Word has length 109 [2024-10-14 12:03:36,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:03:36,890 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 407 transitions. [2024-10-14 12:03:36,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:03:36,890 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 407 transitions. [2024-10-14 12:03:36,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 12:03:36,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:03:36,892 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:03:36,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 12:03:36,892 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:03:36,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:03:36,893 INFO L85 PathProgramCache]: Analyzing trace with hash 63028620, now seen corresponding path program 1 times [2024-10-14 12:03:36,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:03:36,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258695325] [2024-10-14 12:03:36,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:03:36,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:03:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:03:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 12:03:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 12:03:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 12:03:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 12:03:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:03:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:03:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:03:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:03:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:03:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:03:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:03:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:03:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 12:03:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 12:03:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 12:03:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,245 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 12:03:37,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:03:37,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258695325] [2024-10-14 12:03:37,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258695325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:03:37,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:03:37,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 12:03:37,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900928473] [2024-10-14 12:03:37,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:03:37,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 12:03:37,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:03:37,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 12:03:37,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 12:03:37,248 INFO L87 Difference]: Start difference. First operand 285 states and 407 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:03:37,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:03:37,339 INFO L93 Difference]: Finished difference Result 601 states and 861 transitions. [2024-10-14 12:03:37,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 12:03:37,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2024-10-14 12:03:37,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:03:37,344 INFO L225 Difference]: With dead ends: 601 [2024-10-14 12:03:37,345 INFO L226 Difference]: Without dead ends: 317 [2024-10-14 12:03:37,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-14 12:03:37,348 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 87 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 362 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-14 12:03:37,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 362 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:03:37,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-14 12:03:37,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 285. [2024-10-14 12:03:37,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 233 states have (on average 1.3004291845493563) internal successors, (303), 233 states have internal predecessors, (303), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 12:03:37,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 399 transitions. [2024-10-14 12:03:37,407 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 399 transitions. Word has length 109 [2024-10-14 12:03:37,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:03:37,409 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 399 transitions. [2024-10-14 12:03:37,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:03:37,409 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 399 transitions. [2024-10-14 12:03:37,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-14 12:03:37,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:03:37,412 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:03:37,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 12:03:37,413 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:03:37,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:03:37,414 INFO L85 PathProgramCache]: Analyzing trace with hash 2088694319, now seen corresponding path program 1 times [2024-10-14 12:03:37,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:03:37,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783396423] [2024-10-14 12:03:37,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:03:37,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:03:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:03:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 12:03:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 12:03:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 12:03:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 12:03:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:03:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:03:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:03:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:03:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:03:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:03:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:03:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:03:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 12:03:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 12:03:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 12:03:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:37,751 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 12:03:37,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:03:37,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783396423] [2024-10-14 12:03:37,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783396423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:03:37,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:03:37,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 12:03:37,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798872520] [2024-10-14 12:03:37,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:03:37,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 12:03:37,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:03:37,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 12:03:37,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 12:03:37,754 INFO L87 Difference]: Start difference. First operand 285 states and 399 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:03:38,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:03:38,312 INFO L93 Difference]: Finished difference Result 782 states and 1091 transitions. [2024-10-14 12:03:38,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 12:03:38,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2024-10-14 12:03:38,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:03:38,318 INFO L225 Difference]: With dead ends: 782 [2024-10-14 12:03:38,318 INFO L226 Difference]: Without dead ends: 680 [2024-10-14 12:03:38,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 12:03:38,319 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 258 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 12:03:38,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 439 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 12:03:38,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-10-14 12:03:38,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 492. [2024-10-14 12:03:38,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 406 states have (on average 1.3004926108374384) internal successors, (528), 406 states have internal predecessors, (528), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-14 12:03:38,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 688 transitions. [2024-10-14 12:03:38,424 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 688 transitions. Word has length 113 [2024-10-14 12:03:38,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:03:38,426 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 688 transitions. [2024-10-14 12:03:38,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:03:38,426 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 688 transitions. [2024-10-14 12:03:38,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-14 12:03:38,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:03:38,428 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:03:38,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 12:03:38,428 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:03:38,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:03:38,429 INFO L85 PathProgramCache]: Analyzing trace with hash 945023221, now seen corresponding path program 1 times [2024-10-14 12:03:38,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:03:38,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255604382] [2024-10-14 12:03:38,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:03:38,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:03:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:47,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:03:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:47,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 12:03:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:47,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 12:03:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:47,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 12:03:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:47,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 12:03:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:47,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:03:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:47,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:03:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:47,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:03:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:47,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:03:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:47,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:03:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:47,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:03:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:47,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:03:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:47,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:03:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:47,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 12:03:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:47,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 12:03:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:47,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 12:03:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:47,816 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 12:03:47,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:03:47,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255604382] [2024-10-14 12:03:47,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255604382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:03:47,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:03:47,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 12:03:47,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391215700] [2024-10-14 12:03:47,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:03:47,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 12:03:47,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:03:47,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 12:03:47,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-14 12:03:47,819 INFO L87 Difference]: Start difference. First operand 492 states and 688 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:03:51,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:03:51,541 INFO L93 Difference]: Finished difference Result 1116 states and 1528 transitions. [2024-10-14 12:03:51,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 12:03:51,543 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2024-10-14 12:03:51,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:03:51,549 INFO L225 Difference]: With dead ends: 1116 [2024-10-14 12:03:51,549 INFO L226 Difference]: Without dead ends: 928 [2024-10-14 12:03:51,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-14 12:03:51,553 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 204 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 12:03:51,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 339 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 12:03:51,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2024-10-14 12:03:51,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 857. [2024-10-14 12:03:51,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 756 states have (on average 1.306878306878307) internal successors, (988), 761 states have internal predecessors, (988), 90 states have call successors, (90), 10 states have call predecessors, (90), 10 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-14 12:03:51,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1168 transitions. [2024-10-14 12:03:51,690 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1168 transitions. Word has length 113 [2024-10-14 12:03:51,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:03:51,691 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1168 transitions. [2024-10-14 12:03:51,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:03:51,691 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1168 transitions. [2024-10-14 12:03:51,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-14 12:03:51,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:03:51,693 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:03:51,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 12:03:51,694 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:03:51,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:03:51,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1163877939, now seen corresponding path program 1 times [2024-10-14 12:03:51,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:03:51,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881484467] [2024-10-14 12:03:51,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:03:51,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:03:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 12:03:51,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 12:03:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 12:03:51,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 12:03:51,844 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 12:03:51,845 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 12:03:51,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 12:03:51,850 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:03:51,951 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 12:03:51,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 12:03:51 BoogieIcfgContainer [2024-10-14 12:03:51,955 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 12:03:51,956 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 12:03:51,956 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 12:03:51,956 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 12:03:51,956 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:03:32" (3/4) ... [2024-10-14 12:03:51,958 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 12:03:51,959 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 12:03:51,960 INFO L158 Benchmark]: Toolchain (without parser) took 20768.65ms. Allocated memory was 159.4MB in the beginning and 385.9MB in the end (delta: 226.5MB). Free memory was 104.3MB in the beginning and 135.2MB in the end (delta: -30.9MB). Peak memory consumption was 196.4MB. Max. memory is 16.1GB. [2024-10-14 12:03:51,960 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 159.4MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 12:03:51,960 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.71ms. Allocated memory is still 159.4MB. Free memory was 103.9MB in the beginning and 89.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 12:03:51,961 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.30ms. Allocated memory is still 159.4MB. Free memory was 89.2MB in the beginning and 85.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 12:03:51,961 INFO L158 Benchmark]: Boogie Preprocessor took 123.57ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 78.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 12:03:51,961 INFO L158 Benchmark]: RCFGBuilder took 762.05ms. Allocated memory is still 159.4MB. Free memory was 78.8MB in the beginning and 111.7MB in the end (delta: -33.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 12:03:51,962 INFO L158 Benchmark]: TraceAbstraction took 19391.11ms. Allocated memory was 159.4MB in the beginning and 385.9MB in the end (delta: 226.5MB). Free memory was 110.9MB in the beginning and 135.2MB in the end (delta: -24.3MB). Peak memory consumption was 203.3MB. Max. memory is 16.1GB. [2024-10-14 12:03:51,962 INFO L158 Benchmark]: Witness Printer took 3.92ms. Allocated memory is still 385.9MB. Free memory is still 135.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 12:03:51,963 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.12ms. Allocated memory is still 159.4MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 413.71ms. Allocated memory is still 159.4MB. Free memory was 103.9MB in the beginning and 89.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.30ms. Allocated memory is still 159.4MB. Free memory was 89.2MB in the beginning and 85.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 123.57ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 78.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 762.05ms. Allocated memory is still 159.4MB. Free memory was 78.8MB in the beginning and 111.7MB in the end (delta: -33.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 19391.11ms. Allocated memory was 159.4MB in the beginning and 385.9MB in the end (delta: 226.5MB). Free memory was 110.9MB in the beginning and 135.2MB in the end (delta: -24.3MB). Peak memory consumption was 203.3MB. Max. memory is 16.1GB. * Witness Printer took 3.92ms. Allocated memory is still 385.9MB. Free memory is still 135.2MB. 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 122. 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 long int last_1_var_1_5 = 5; [L126] isInitial = 1 [L127] FCALL initially() [L128] int k_loop; [L129] k_loop = 0 VAL [isInitial=1, k_loop=0, 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_5=5, var_1_8=0, var_1_9=643/5] [L129] COND TRUE k_loop < 1 [L130] CALL updateLastVariables() [L119] last_1_var_1_5 = var_1_5 [L130] RET updateLastVariables() [L131] CALL updateVariables() [L92] var_1_9 = __VERIFIER_nondet_float() [L93] 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_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_5=5, var_1_8=0] [L93] 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_5=5, var_1_8=0] [L94] var_1_10 = __VERIFIER_nondet_float() [L95] 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_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_5=5, var_1_8=0] [L95] 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_5=5, var_1_8=0] [L96] var_1_11 = __VERIFIER_nondet_uchar() [L97] 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_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_5=5, var_1_8=0] [L97] 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_5=5, var_1_8=0] [L98] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, 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_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=127, 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_5=5, var_1_8=0] [L98] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, 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_5=5, var_1_8=0] [L99] var_1_12 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, 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_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=127, 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_5=5, var_1_8=0] [L100] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, 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_5=5, var_1_8=0] [L101] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, 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_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=127, 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_5=5, var_1_8=0] [L101] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, 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_5=5, var_1_8=0] [L102] var_1_13 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, 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_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=127, 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_5=5, var_1_8=0] [L103] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, 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_5=5, var_1_8=0] [L104] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=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_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=127, var_1_12=63, var_1_13=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_5=5, var_1_8=0] [L104] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=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_5=5, var_1_8=0] [L105] var_1_14 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, 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_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=127, var_1_12=63, var_1_13=63, 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_5=5, var_1_8=0] [L106] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, 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_5=5, var_1_8=0] [L107] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, 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_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=127, var_1_12=63, var_1_13=63, var_1_14=122, 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_5=5, var_1_8=0] [L107] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, 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_5=5, var_1_8=0] [L108] var_1_18 = __VERIFIER_nondet_char() [L109] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, 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_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=127, var_1_12=63, var_1_13=63, var_1_14=122, 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_5=5, var_1_8=0] [L109] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, 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_5=5, var_1_8=0] [L110] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, 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_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=127, var_1_12=63, var_1_13=63, var_1_14=122, 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_5=5, var_1_8=0] [L110] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, 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_5=5, var_1_8=0] [L111] var_1_19 = __VERIFIER_nondet_char() [L112] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, 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=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L112] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L113] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, 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=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L113] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L114] var_1_23 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, 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=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L115] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L116] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, 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=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L116] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L131] RET updateVariables() [L132] CALL step() [L43] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L46] var_1_20 = var_1_8 [L47] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L48] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L51] 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=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L52] COND FALSE !(\read(var_1_22)) [L59] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L61] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L62] 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=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L63] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L64] COND FALSE !(\read(var_1_22)) [L71] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L76] signed long int stepLocal_4 = 256; [L77] unsigned char stepLocal_3 = var_1_22; [L78] 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=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L79] 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=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L82] COND FALSE !(stepLocal_3 || var_1_22) [L87] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L132] RET step() [L133] CALL, EXPR property() [L122] 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=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] 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=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] 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=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] 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=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] 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=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] 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=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122-L123] 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)) ; [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.2s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1127 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1127 mSDsluCounter, 3027 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1784 mSDsCounter, 274 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1236 IncrementalHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 274 mSolverCounterUnsat, 1243 mSDtfsCounter, 1236 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 367 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=857occurred in iteration=9, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 485 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 1095 NumberOfCodeBlocks, 1095 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 973 ConstructedInterpolants, 0 QuantifiedInterpolants, 13712 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 4320/4320 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-14 12:03:52,015 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_loopvsstraightlinecode_50-1loop_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 7546368952c9092d5ff7b1c9b7170a5f4931681ecce745d3ea9c0f5a0ac16217 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 12:03:54,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 12:03:54,396 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 12:03:54,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 12:03:54,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 12:03:54,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 12:03:54,450 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 12:03:54,450 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 12:03:54,451 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 12:03:54,451 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 12:03:54,451 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 12:03:54,452 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 12:03:54,452 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 12:03:54,453 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 12:03:54,453 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 12:03:54,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 12:03:54,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 12:03:54,457 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 12:03:54,458 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 12:03:54,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 12:03:54,458 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 12:03:54,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 12:03:54,459 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 12:03:54,459 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 12:03:54,460 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 12:03:54,460 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 12:03:54,460 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 12:03:54,460 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 12:03:54,461 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 12:03:54,461 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 12:03:54,461 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 12:03:54,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 12:03:54,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 12:03:54,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 12:03:54,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:03:54,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 12:03:54,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 12:03:54,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 12:03:54,468 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 12:03:54,470 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 12:03:54,470 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 12:03:54,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 12:03:54,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 12:03:54,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 12:03:54,472 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 12:03:54,472 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 -> 7546368952c9092d5ff7b1c9b7170a5f4931681ecce745d3ea9c0f5a0ac16217 [2024-10-14 12:03:54,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 12:03:54,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 12:03:54,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 12:03:54,860 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 12:03:54,861 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 12:03:54,863 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-97.i [2024-10-14 12:03:56,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 12:03:56,614 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 12:03:56,615 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-97.i [2024-10-14 12:03:56,629 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17159d9a9/0d6d9f2161b64a188d4ae9dc6ab145a2/FLAG013d73a4d [2024-10-14 12:03:56,990 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17159d9a9/0d6d9f2161b64a188d4ae9dc6ab145a2 [2024-10-14 12:03:56,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 12:03:56,995 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 12:03:56,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 12:03:56,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 12:03:57,004 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 12:03:57,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:03:56" (1/1) ... [2024-10-14 12:03:57,006 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1400aaed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:57, skipping insertion in model container [2024-10-14 12:03:57,006 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:03:56" (1/1) ... [2024-10-14 12:03:57,038 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 12:03:57,223 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_loopvsstraightlinecode_50-1loop_file-97.i[915,928] [2024-10-14 12:03:57,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:03:57,339 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 12:03:57,352 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_loopvsstraightlinecode_50-1loop_file-97.i[915,928] [2024-10-14 12:03:57,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:03:57,423 INFO L204 MainTranslator]: Completed translation [2024-10-14 12:03:57,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:57 WrapperNode [2024-10-14 12:03:57,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 12:03:57,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 12:03:57,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 12:03:57,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 12:03:57,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:57" (1/1) ... [2024-10-14 12:03:57,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:57" (1/1) ... [2024-10-14 12:03:57,475 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2024-10-14 12:03:57,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 12:03:57,477 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 12:03:57,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 12:03:57,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 12:03:57,489 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:57" (1/1) ... [2024-10-14 12:03:57,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:57" (1/1) ... [2024-10-14 12:03:57,494 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:57" (1/1) ... [2024-10-14 12:03:57,512 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-14 12:03:57,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:57" (1/1) ... [2024-10-14 12:03:57,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:57" (1/1) ... [2024-10-14 12:03:57,531 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:57" (1/1) ... [2024-10-14 12:03:57,539 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:57" (1/1) ... [2024-10-14 12:03:57,545 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:57" (1/1) ... [2024-10-14 12:03:57,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:57" (1/1) ... [2024-10-14 12:03:57,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 12:03:57,559 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 12:03:57,559 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 12:03:57,559 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 12:03:57,560 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:57" (1/1) ... [2024-10-14 12:03:57,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:03:57,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:03:57,619 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-14 12:03:57,623 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-14 12:03:57,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 12:03:57,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 12:03:57,663 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 12:03:57,663 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 12:03:57,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 12:03:57,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 12:03:57,746 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 12:03:57,748 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 12:03:58,101 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-14 12:03:58,101 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 12:03:58,168 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 12:03:58,169 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 12:03:58,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:03:58 BoogieIcfgContainer [2024-10-14 12:03:58,173 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 12:03:58,175 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 12:03:58,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 12:03:58,180 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 12:03:58,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:03:56" (1/3) ... [2024-10-14 12:03:58,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72264e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:03:58, skipping insertion in model container [2024-10-14 12:03:58,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:03:57" (2/3) ... [2024-10-14 12:03:58,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72264e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:03:58, skipping insertion in model container [2024-10-14 12:03:58,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:03:58" (3/3) ... [2024-10-14 12:03:58,186 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-97.i [2024-10-14 12:03:58,203 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 12:03:58,203 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 12:03:58,284 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 12:03:58,294 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;@4028248e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 12:03:58,295 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 12:03:58,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 12:03:58,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 12:03:58,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:03:58,316 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:03:58,317 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:03:58,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:03:58,326 INFO L85 PathProgramCache]: Analyzing trace with hash 2092324347, now seen corresponding path program 1 times [2024-10-14 12:03:58,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:03:58,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618987057] [2024-10-14 12:03:58,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:03:58,344 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-14 12:03:58,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:03:58,348 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-14 12:03:58,349 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-14 12:03:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:58,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 12:03:58,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:03:58,624 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-10-14 12:03:58,624 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 12:03:58,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 12:03:58,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618987057] [2024-10-14 12:03:58,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618987057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:03:58,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:03:58,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 12:03:58,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377376010] [2024-10-14 12:03:58,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:03:58,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 12:03:58,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 12:03:58,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 12:03:58,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:03:58,665 INFO L87 Difference]: Start difference. First operand has 52 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 12:03:58,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:03:58,721 INFO L93 Difference]: Finished difference Result 103 states and 175 transitions. [2024-10-14 12:03:58,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 12:03:58,727 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2024-10-14 12:03:58,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:03:58,734 INFO L225 Difference]: With dead ends: 103 [2024-10-14 12:03:58,736 INFO L226 Difference]: Without dead ends: 50 [2024-10-14 12:03:58,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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-14 12:03:58,747 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 12:03:58,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:03:58,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-14 12:03:58,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-14 12:03:58,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 12:03:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 75 transitions. [2024-10-14 12:03:58,807 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 75 transitions. Word has length 103 [2024-10-14 12:03:58,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:03:58,809 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 75 transitions. [2024-10-14 12:03:58,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 12:03:58,810 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 75 transitions. [2024-10-14 12:03:58,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 12:03:58,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:03:58,813 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:03:58,821 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-14 12:03:59,017 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-14 12:03:59,018 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:03:59,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:03:59,019 INFO L85 PathProgramCache]: Analyzing trace with hash -775336641, now seen corresponding path program 1 times [2024-10-14 12:03:59,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:03:59,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184229229] [2024-10-14 12:03:59,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:03:59,021 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-14 12:03:59,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:03:59,024 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-14 12:03:59,026 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-14 12:03:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:03:59,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 12:03:59,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:03:59,323 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-14 12:03:59,323 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 12:03:59,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 12:03:59,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184229229] [2024-10-14 12:03:59,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1184229229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:03:59,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:03:59,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 12:03:59,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323878273] [2024-10-14 12:03:59,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:03:59,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 12:03:59,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 12:03:59,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 12:03:59,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 12:03:59,329 INFO L87 Difference]: Start difference. First operand 50 states and 75 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:03:59,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:03:59,684 INFO L93 Difference]: Finished difference Result 105 states and 152 transitions. [2024-10-14 12:03:59,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 12:03:59,685 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2024-10-14 12:03:59,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:03:59,687 INFO L225 Difference]: With dead ends: 105 [2024-10-14 12:03:59,688 INFO L226 Difference]: Without dead ends: 56 [2024-10-14 12:03:59,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-14 12:03:59,691 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 75 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 12:03:59,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 86 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 12:03:59,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-14 12:03:59,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2024-10-14 12:03:59,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 12:03:59,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2024-10-14 12:03:59,710 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 103 [2024-10-14 12:03:59,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:03:59,711 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2024-10-14 12:03:59,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:03:59,712 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2024-10-14 12:03:59,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 12:03:59,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:03:59,713 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:03:59,723 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-14 12:03:59,914 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-14 12:03:59,915 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:03:59,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:03:59,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1168363651, now seen corresponding path program 1 times [2024-10-14 12:03:59,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:03:59,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243249328] [2024-10-14 12:03:59,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:03:59,917 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-14 12:03:59,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:03:59,920 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-14 12:03:59,921 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-14 12:04:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:04:00,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 12:04:00,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:04:00,345 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 12:04:00,345 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 12:04:00,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 12:04:00,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [243249328] [2024-10-14 12:04:00,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [243249328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:04:00,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:04:00,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 12:04:00,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349841399] [2024-10-14 12:04:00,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:04:00,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 12:04:00,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 12:04:00,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 12:04:00,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 12:04:00,349 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:04:00,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:04:00,596 INFO L93 Difference]: Finished difference Result 139 states and 192 transitions. [2024-10-14 12:04:00,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 12:04:00,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2024-10-14 12:04:00,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:04:00,599 INFO L225 Difference]: With dead ends: 139 [2024-10-14 12:04:00,600 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 12:04:00,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 12:04:00,606 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 63 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 12:04:00,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 218 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 12:04:00,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 12:04:00,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 52. [2024-10-14 12:04:00,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 12:04:00,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 70 transitions. [2024-10-14 12:04:00,634 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 70 transitions. Word has length 103 [2024-10-14 12:04:00,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:04:00,634 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 70 transitions. [2024-10-14 12:04:00,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:04:00,635 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 70 transitions. [2024-10-14 12:04:00,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 12:04:00,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:04:00,640 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:04:00,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 12:04:00,841 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-14 12:04:00,842 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:04:00,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:04:00,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1548041668, now seen corresponding path program 1 times [2024-10-14 12:04:00,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:04:00,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096374531] [2024-10-14 12:04:00,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:04:00,843 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-14 12:04:00,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:04:00,847 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-14 12:04:00,847 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-14 12:04:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:04:01,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 12:04:01,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:04:01,712 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 12:04:01,712 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 12:04:01,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 12:04:01,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096374531] [2024-10-14 12:04:01,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096374531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:04:01,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:04:01,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 12:04:01,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560420104] [2024-10-14 12:04:01,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:04:01,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 12:04:01,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 12:04:01,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 12:04:01,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 12:04:01,716 INFO L87 Difference]: Start difference. First operand 52 states and 70 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:04:01,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:04:01,981 INFO L93 Difference]: Finished difference Result 160 states and 214 transitions. [2024-10-14 12:04:01,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 12:04:01,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2024-10-14 12:04:01,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:04:01,986 INFO L225 Difference]: With dead ends: 160 [2024-10-14 12:04:01,986 INFO L226 Difference]: Without dead ends: 109 [2024-10-14 12:04:01,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 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-14 12:04:01,989 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 42 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 12:04:01,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 198 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 12:04:01,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-14 12:04:02,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2024-10-14 12:04:02,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 64 states have (on average 1.140625) internal successors, (73), 64 states have internal predecessors, (73), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 12:04:02,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 137 transitions. [2024-10-14 12:04:02,034 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 137 transitions. Word has length 104 [2024-10-14 12:04:02,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:04:02,036 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 137 transitions. [2024-10-14 12:04:02,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:04:02,036 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 137 transitions. [2024-10-14 12:04:02,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 12:04:02,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:04:02,040 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:04:02,048 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 (5)] Ended with exit code 0 [2024-10-14 12:04:02,240 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-14 12:04:02,241 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:04:02,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:04:02,241 INFO L85 PathProgramCache]: Analyzing trace with hash -744858018, now seen corresponding path program 1 times [2024-10-14 12:04:02,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:04:02,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10738564] [2024-10-14 12:04:02,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:04:02,242 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-14 12:04:02,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:04:02,246 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-14 12:04:02,247 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-14 12:04:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:04:02,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 12:04:02,369 INFO L278 TraceCheckSpWp]: Computing forward predicates...