./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.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 d5b4a8e209cf444024fa31a61bed3ce1f6da7fc096b1acbd25409a9975d7dc6c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:52:06,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:52:06,621 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:52:06,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:52:06,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:52:06,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:52:06,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:52:06,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:52:06,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:52:06,672 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:52:06,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:52:06,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:52:06,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:52:06,674 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:52:06,675 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:52:06,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:52:06,675 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:52:06,676 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:52:06,676 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:52:06,676 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:52:06,676 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:52:06,677 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:52:06,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:52:06,678 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:52:06,678 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:52:06,678 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:52:06,678 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:52:06,679 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:52:06,679 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:52:06,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:52:06,680 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:52:06,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:52:06,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:52:06,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:52:06,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:52:06,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:52:06,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:52:06,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:52:06,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:52:06,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:52:06,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:52:06,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:52:06,683 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 -> d5b4a8e209cf444024fa31a61bed3ce1f6da7fc096b1acbd25409a9975d7dc6c [2024-11-08 23:52:06,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:52:06,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:52:06,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:52:06,962 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:52:06,962 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:52:06,963 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.i [2024-11-08 23:52:08,382 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:52:08,568 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:52:08,569 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.i [2024-11-08 23:52:08,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8288b44b2/24f3b81fd3a74876a52160114e8d3539/FLAGf9fcb066d [2024-11-08 23:52:08,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8288b44b2/24f3b81fd3a74876a52160114e8d3539 [2024-11-08 23:52:08,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:52:08,595 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:52:08,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:52:08,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:52:08,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:52:08,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:52:08" (1/1) ... [2024-11-08 23:52:08,606 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@574dc1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:52:08, skipping insertion in model container [2024-11-08 23:52:08,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:52:08" (1/1) ... [2024-11-08 23:52:08,628 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:52:08,783 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.i[915,928] [2024-11-08 23:52:08,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:52:08,830 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:52:08,842 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.i[915,928] [2024-11-08 23:52:08,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:52:08,875 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:52:08,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:52:08 WrapperNode [2024-11-08 23:52:08,875 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:52:08,876 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:52:08,877 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:52:08,877 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:52:08,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:52:08" (1/1) ... [2024-11-08 23:52:08,890 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:52:08" (1/1) ... [2024-11-08 23:52:08,912 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2024-11-08 23:52:08,913 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:52:08,914 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:52:08,914 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:52:08,914 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:52:08,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:52:08" (1/1) ... [2024-11-08 23:52:08,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:52:08" (1/1) ... [2024-11-08 23:52:08,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:52:08" (1/1) ... [2024-11-08 23:52:08,947 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:52:08,948 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:52:08" (1/1) ... [2024-11-08 23:52:08,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:52:08" (1/1) ... [2024-11-08 23:52:08,955 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:52:08" (1/1) ... [2024-11-08 23:52:08,962 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:52:08" (1/1) ... [2024-11-08 23:52:08,963 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:52:08" (1/1) ... [2024-11-08 23:52:08,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:52:08" (1/1) ... [2024-11-08 23:52:08,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:52:08,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:52:08,967 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:52:08,967 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:52:08,968 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:52:08" (1/1) ... [2024-11-08 23:52:08,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:52:08,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:52:08,994 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:52:08,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:52:09,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:52:09,042 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:52:09,042 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:52:09,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:52:09,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:52:09,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:52:09,101 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:52:09,105 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:52:09,353 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 23:52:09,353 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:52:09,369 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:52:09,372 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:52:09,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:52:09 BoogieIcfgContainer [2024-11-08 23:52:09,372 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:52:09,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:52:09,376 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:52:09,380 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:52:09,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:52:08" (1/3) ... [2024-11-08 23:52:09,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7637a5cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:52:09, skipping insertion in model container [2024-11-08 23:52:09,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:52:08" (2/3) ... [2024-11-08 23:52:09,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7637a5cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:52:09, skipping insertion in model container [2024-11-08 23:52:09,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:52:09" (3/3) ... [2024-11-08 23:52:09,384 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-41.i [2024-11-08 23:52:09,400 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:52:09,401 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:52:09,463 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:52:09,469 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;@57bcc114, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:52:09,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:52:09,474 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.34375) internal successors, (43), 33 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-11-08 23:52:09,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 23:52:09,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:52:09,484 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-11-08 23:52:09,485 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:52:09,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:52:09,489 INFO L85 PathProgramCache]: Analyzing trace with hash 637968881, now seen corresponding path program 1 times [2024-11-08 23:52:09,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:52:09,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819527529] [2024-11-08 23:52:09,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:52:09,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:52:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:09,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:52:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:09,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:52:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:09,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:52:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:09,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:52:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:09,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:52:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:09,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:52:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:09,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:52:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:09,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:52:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:09,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:52:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:09,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:52:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:09,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:52:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:09,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:52:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:09,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:52:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:09,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:52:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:09,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:52:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:09,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:52:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:09,940 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:52:09,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:52:09,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819527529] [2024-11-08 23:52:09,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819527529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:52:09,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:52:09,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:52:09,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858419212] [2024-11-08 23:52:09,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:52:09,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:52:09,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:52:09,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:52:09,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:52:09,979 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.34375) internal successors, (43), 33 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) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-11-08 23:52:10,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:52:10,011 INFO L93 Difference]: Finished difference Result 94 states and 158 transitions. [2024-11-08 23:52:10,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:52:10,013 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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 103 [2024-11-08 23:52:10,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:52:10,021 INFO L225 Difference]: With dead ends: 94 [2024-11-08 23:52:10,022 INFO L226 Difference]: Without dead ends: 46 [2024-11-08 23:52:10,027 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-11-08 23:52:10,031 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:52:10,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:52:10,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-08 23:52:10,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-08 23:52:10,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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-11-08 23:52:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2024-11-08 23:52:10,087 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 103 [2024-11-08 23:52:10,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:52:10,089 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2024-11-08 23:52:10,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-11-08 23:52:10,090 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2024-11-08 23:52:10,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 23:52:10,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:52:10,094 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-11-08 23:52:10,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:52:10,094 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:52:10,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:52:10,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1758183921, now seen corresponding path program 1 times [2024-11-08 23:52:10,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:52:10,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103437367] [2024-11-08 23:52:10,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:52:10,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:52:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:11,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:52:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:11,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:52:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:11,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:52:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:11,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:52:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:11,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:52:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:11,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:52:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:11,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:52:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:11,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:52:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:11,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:52:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:11,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:52:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:11,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:52:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:11,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:52:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:11,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:52:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:11,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:52:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:11,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:52:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:11,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:52:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:11,832 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:52:11,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:52:11,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103437367] [2024-11-08 23:52:11,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103437367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:52:11,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:52:11,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 23:52:11,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108499055] [2024-11-08 23:52:11,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:52:11,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 23:52:11,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:52:11,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 23:52:11,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:52:11,839 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 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-11-08 23:52:12,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:52:12,151 INFO L93 Difference]: Finished difference Result 113 states and 148 transitions. [2024-11-08 23:52:12,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 23:52:12,152 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 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-11-08 23:52:12,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:52:12,155 INFO L225 Difference]: With dead ends: 113 [2024-11-08 23:52:12,155 INFO L226 Difference]: Without dead ends: 111 [2024-11-08 23:52:12,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:52:12,157 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 97 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:52:12,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 325 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:52:12,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-08 23:52:12,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 92. [2024-11-08 23:52:12,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 64 states have internal predecessors, (74), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 23:52:12,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 126 transitions. [2024-11-08 23:52:12,184 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 126 transitions. Word has length 103 [2024-11-08 23:52:12,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:52:12,185 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 126 transitions. [2024-11-08 23:52:12,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 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-11-08 23:52:12,185 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 126 transitions. [2024-11-08 23:52:12,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 23:52:12,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:52:12,187 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-11-08 23:52:12,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:52:12,187 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:52:12,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:52:12,188 INFO L85 PathProgramCache]: Analyzing trace with hash 948837295, now seen corresponding path program 1 times [2024-11-08 23:52:12,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:52:12,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231157202] [2024-11-08 23:52:12,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:52:12,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:52:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:13,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:52:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:13,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:52:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:13,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:52:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:13,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:52:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:13,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:52:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:13,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:52:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:13,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:52:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:13,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:52:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:13,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:52:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:13,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:52:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:13,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:52:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:13,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:52:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:13,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:52:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:13,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:52:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:13,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:52:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:13,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:52:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:13,979 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:52:13,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:52:13,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231157202] [2024-11-08 23:52:13,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231157202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:52:13,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:52:13,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 23:52:13,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272013200] [2024-11-08 23:52:13,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:52:13,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 23:52:13,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:52:13,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 23:52:13,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:52:13,985 INFO L87 Difference]: Start difference. First operand 92 states and 126 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 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-11-08 23:52:14,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:52:14,324 INFO L93 Difference]: Finished difference Result 105 states and 137 transitions. [2024-11-08 23:52:14,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:52:14,325 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 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-11-08 23:52:14,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:52:14,328 INFO L225 Difference]: With dead ends: 105 [2024-11-08 23:52:14,328 INFO L226 Difference]: Without dead ends: 103 [2024-11-08 23:52:14,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:52:14,330 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 32 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:52:14,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 338 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:52:14,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-08 23:52:14,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2024-11-08 23:52:14,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 67 states have internal predecessors, (77), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 23:52:14,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 129 transitions. [2024-11-08 23:52:14,348 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 129 transitions. Word has length 103 [2024-11-08 23:52:14,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:52:14,348 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 129 transitions. [2024-11-08 23:52:14,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 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-11-08 23:52:14,349 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 129 transitions. [2024-11-08 23:52:14,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 23:52:14,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:52:14,351 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-11-08 23:52:14,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:52:14,351 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:52:14,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:52:14,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1365156911, now seen corresponding path program 1 times [2024-11-08 23:52:14,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:52:14,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304517908] [2024-11-08 23:52:14,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:52:14,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:52:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:15,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:52:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:15,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:52:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:15,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:52:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:15,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:52:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:15,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:52:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:15,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:52:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:15,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:52:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:15,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:52:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:15,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:52:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:15,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:52:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:15,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:52:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:15,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:52:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:15,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:52:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:15,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:52:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:15,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:52:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:15,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:52:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:15,155 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:52:15,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:52:15,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304517908] [2024-11-08 23:52:15,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304517908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:52:15,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:52:15,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 23:52:15,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620022413] [2024-11-08 23:52:15,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:52:15,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 23:52:15,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:52:15,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 23:52:15,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:52:15,158 INFO L87 Difference]: Start difference. First operand 95 states and 129 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 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-11-08 23:52:15,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:52:15,362 INFO L93 Difference]: Finished difference Result 118 states and 154 transitions. [2024-11-08 23:52:15,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 23:52:15,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 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-11-08 23:52:15,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:52:15,364 INFO L225 Difference]: With dead ends: 118 [2024-11-08 23:52:15,364 INFO L226 Difference]: Without dead ends: 116 [2024-11-08 23:52:15,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:52:15,366 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 37 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:52:15,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 251 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:52:15,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-08 23:52:15,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 102. [2024-11-08 23:52:15,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 74 states have internal predecessors, (86), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 23:52:15,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 138 transitions. [2024-11-08 23:52:15,383 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 138 transitions. Word has length 103 [2024-11-08 23:52:15,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:52:15,384 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 138 transitions. [2024-11-08 23:52:15,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 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-11-08 23:52:15,384 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 138 transitions. [2024-11-08 23:52:15,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 23:52:15,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:52:15,386 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-11-08 23:52:15,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:52:15,386 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:52:15,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:52:15,387 INFO L85 PathProgramCache]: Analyzing trace with hash 555810285, now seen corresponding path program 1 times [2024-11-08 23:52:15,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:52:15,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158749833] [2024-11-08 23:52:15,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:52:15,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:52:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:52:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:52:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:52:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:52:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:52:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:52:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:52:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:52:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:52:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:52:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:52:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:52:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:52:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:52:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:52:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:52:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,079 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:52:16,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:52:16,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158749833] [2024-11-08 23:52:16,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158749833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:52:16,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:52:16,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 23:52:16,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596233301] [2024-11-08 23:52:16,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:52:16,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 23:52:16,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:52:16,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 23:52:16,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:52:16,082 INFO L87 Difference]: Start difference. First operand 102 states and 138 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 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-11-08 23:52:16,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:52:16,249 INFO L93 Difference]: Finished difference Result 123 states and 159 transitions. [2024-11-08 23:52:16,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 23:52:16,250 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 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-11-08 23:52:16,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:52:16,252 INFO L225 Difference]: With dead ends: 123 [2024-11-08 23:52:16,252 INFO L226 Difference]: Without dead ends: 121 [2024-11-08 23:52:16,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:52:16,253 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 40 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:52:16,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 291 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:52:16,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-08 23:52:16,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 98. [2024-11-08 23:52:16,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 70 states have internal predecessors, (80), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 23:52:16,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2024-11-08 23:52:16,281 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 132 transitions. Word has length 103 [2024-11-08 23:52:16,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:52:16,284 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 132 transitions. [2024-11-08 23:52:16,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 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-11-08 23:52:16,285 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 132 transitions. [2024-11-08 23:52:16,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 23:52:16,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:52:16,288 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-11-08 23:52:16,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 23:52:16,288 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:52:16,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:52:16,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1566433593, now seen corresponding path program 1 times [2024-11-08 23:52:16,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:52:16,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674425225] [2024-11-08 23:52:16,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:52:16,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:52:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:52:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:52:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:52:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:52:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:52:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:52:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:52:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:52:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:52:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:52:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:52:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:52:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:52:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:52:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:52:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:52:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:16,425 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:52:16,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:52:16,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674425225] [2024-11-08 23:52:16,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674425225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:52:16,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:52:16,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:52:16,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788412057] [2024-11-08 23:52:16,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:52:16,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:52:16,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:52:16,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:52:16,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:52:16,428 INFO L87 Difference]: Start difference. First operand 98 states and 132 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-11-08 23:52:16,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:52:16,450 INFO L93 Difference]: Finished difference Result 179 states and 242 transitions. [2024-11-08 23:52:16,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:52:16,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-11-08 23:52:16,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:52:16,452 INFO L225 Difference]: With dead ends: 179 [2024-11-08 23:52:16,452 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 23:52:16,454 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-11-08 23:52:16,454 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:52:16,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:52:16,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 23:52:16,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 23:52:16,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 23:52:16,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 23:52:16,456 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2024-11-08 23:52:16,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:52:16,456 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 23:52:16,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-11-08 23:52:16,457 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 23:52:16,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 23:52:16,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:52:16,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 23:52:16,463 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-08 23:52:16,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 23:52:16,762 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:52:16,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:52:16 BoogieIcfgContainer [2024-11-08 23:52:16,784 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:52:16,784 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:52:16,784 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:52:16,784 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:52:16,785 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:52:09" (3/4) ... [2024-11-08 23:52:16,787 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 23:52:16,791 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-08 23:52:16,796 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-08 23:52:16,797 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 23:52:16,797 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 23:52:16,797 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 23:52:16,884 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 23:52:16,884 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 23:52:16,884 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:52:16,885 INFO L158 Benchmark]: Toolchain (without parser) took 8289.72ms. Allocated memory was 184.5MB in the beginning and 333.4MB in the end (delta: 148.9MB). Free memory was 127.8MB in the beginning and 191.7MB in the end (delta: -64.0MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. [2024-11-08 23:52:16,885 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 184.5MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:52:16,886 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.69ms. Allocated memory is still 184.5MB. Free memory was 127.8MB in the beginning and 114.1MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 23:52:16,886 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.68ms. Allocated memory is still 184.5MB. Free memory was 114.1MB in the beginning and 112.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:52:16,886 INFO L158 Benchmark]: Boogie Preprocessor took 52.43ms. Allocated memory is still 184.5MB. Free memory was 112.0MB in the beginning and 109.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:52:16,887 INFO L158 Benchmark]: RCFGBuilder took 405.39ms. Allocated memory is still 184.5MB. Free memory was 109.9MB in the beginning and 95.3MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:52:16,887 INFO L158 Benchmark]: TraceAbstraction took 7408.84ms. Allocated memory was 184.5MB in the beginning and 333.4MB in the end (delta: 148.9MB). Free memory was 94.7MB in the beginning and 196.9MB in the end (delta: -102.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-08 23:52:16,887 INFO L158 Benchmark]: Witness Printer took 100.22ms. Allocated memory is still 333.4MB. Free memory was 196.9MB in the beginning and 191.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:52:16,888 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.19ms. Allocated memory is still 184.5MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.69ms. Allocated memory is still 184.5MB. Free memory was 127.8MB in the beginning and 114.1MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.68ms. Allocated memory is still 184.5MB. Free memory was 114.1MB in the beginning and 112.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.43ms. Allocated memory is still 184.5MB. Free memory was 112.0MB in the beginning and 109.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 405.39ms. Allocated memory is still 184.5MB. Free memory was 109.9MB in the beginning and 95.3MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7408.84ms. Allocated memory was 184.5MB in the beginning and 333.4MB in the end (delta: 148.9MB). Free memory was 94.7MB in the beginning and 196.9MB in the end (delta: -102.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Witness Printer took 100.22ms. Allocated memory is still 333.4MB. Free memory was 196.9MB in the beginning and 191.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 206 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 206 mSDsluCounter, 1385 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 989 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 361 IncrementalHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 396 mSDtfsCounter, 361 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 261 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=4, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 64 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 619 NumberOfCodeBlocks, 619 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 613 ConstructedInterpolants, 0 QuantifiedInterpolants, 1929 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 2880/2880 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((var_1_8 == 1) && (var_1_9 != 0)) || (var_1_8 == 0)) && ((var_1_8 != 0) || (var_1_9 == 0))) || (var_1_5 == 0)) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) RESULT: Ultimate proved your program to be correct! [2024-11-08 23:52:16,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE