./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-6.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 6cf2561dad1c8b51aa2ba3c0e99715767de125185ed9dd0f295e3fa44621c8c9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:29:28,640 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:29:28,722 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:29:28,728 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:29:28,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:29:28,761 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:29:28,762 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:29:28,762 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:29:28,763 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:29:28,764 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:29:28,765 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:29:28,765 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:29:28,766 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:29:28,766 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:29:28,768 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:29:28,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:29:28,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:29:28,769 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:29:28,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:29:28,773 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:29:28,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:29:28,774 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:29:28,774 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:29:28,774 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:29:28,775 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:29:28,775 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:29:28,775 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:29:28,775 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:29:28,775 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:29:28,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:29:28,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:29:28,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:29:28,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:29:28,777 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:29:28,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:29:28,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:29:28,779 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:29:28,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:29:28,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:29:28,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:29:28,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:29:28,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:29:28,780 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-clean/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-clean/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 -> 6cf2561dad1c8b51aa2ba3c0e99715767de125185ed9dd0f295e3fa44621c8c9 [2024-10-11 11:29:29,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:29:29,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:29:29,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:29:29,063 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:29:29,064 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:29:29,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-6.i [2024-10-11 11:29:30,528 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:29:30,741 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:29:30,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-6.i [2024-10-11 11:29:30,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a7b31b9e4/ece8e9ad30b24edaaa7042449346dcac/FLAG0c768c31b [2024-10-11 11:29:31,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a7b31b9e4/ece8e9ad30b24edaaa7042449346dcac [2024-10-11 11:29:31,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:29:31,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:29:31,110 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:29:31,110 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:29:31,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:29:31,116 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:29:31" (1/1) ... [2024-10-11 11:29:31,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65d650c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:29:31, skipping insertion in model container [2024-10-11 11:29:31,117 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:29:31" (1/1) ... [2024-10-11 11:29:31,141 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:29:31,337 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-6.i[914,927] [2024-10-11 11:29:31,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:29:31,416 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:29:31,429 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-6.i[914,927] [2024-10-11 11:29:31,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:29:31,477 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:29:31,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:29:31 WrapperNode [2024-10-11 11:29:31,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:29:31,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:29:31,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:29:31,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:29:31,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:29:31" (1/1) ... [2024-10-11 11:29:31,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:29:31" (1/1) ... [2024-10-11 11:29:31,531 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2024-10-11 11:29:31,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:29:31,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:29:31,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:29:31,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:29:31,548 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:29:31" (1/1) ... [2024-10-11 11:29:31,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:29:31" (1/1) ... [2024-10-11 11:29:31,550 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:29:31" (1/1) ... [2024-10-11 11:29:31,567 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:29:31,568 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:29:31" (1/1) ... [2024-10-11 11:29:31,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:29:31" (1/1) ... [2024-10-11 11:29:31,576 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:29:31" (1/1) ... [2024-10-11 11:29:31,579 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:29:31" (1/1) ... [2024-10-11 11:29:31,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:29:31" (1/1) ... [2024-10-11 11:29:31,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:29:31" (1/1) ... [2024-10-11 11:29:31,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:29:31,585 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:29:31,585 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:29:31,586 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:29:31,586 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:29:31" (1/1) ... [2024-10-11 11:29:31,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:29:31,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:29:31,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:29:31,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:29:31,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:29:31,683 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:29:31,683 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:29:31,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:29:31,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:29:31,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:29:31,771 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:29:31,773 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:29:32,045 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-11 11:29:32,045 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:29:32,087 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:29:32,087 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:29:32,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:29:32 BoogieIcfgContainer [2024-10-11 11:29:32,088 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:29:32,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:29:32,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:29:32,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:29:32,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:29:31" (1/3) ... [2024-10-11 11:29:32,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92b00a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:29:32, skipping insertion in model container [2024-10-11 11:29:32,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:29:31" (2/3) ... [2024-10-11 11:29:32,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92b00a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:29:32, skipping insertion in model container [2024-10-11 11:29:32,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:29:32" (3/3) ... [2024-10-11 11:29:32,097 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-6.i [2024-10-11 11:29:32,113 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:29:32,113 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:29:32,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:29:32,171 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;@25980239, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:29:32,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:29:32,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 11:29:32,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 11:29:32,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:29:32,188 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:29:32,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:29:32,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:29:32,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1087530442, now seen corresponding path program 1 times [2024-10-11 11:29:32,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:29:32,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829587514] [2024-10-11 11:29:32,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:29:32,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:29:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:32,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:29:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:32,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:29:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:32,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 11:29:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:32,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:29:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:32,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:29:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:32,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:29:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:32,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:29:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:32,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:29:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:32,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:29:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:32,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:29:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:32,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:29:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:32,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:29:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:32,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:29:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:32,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:29:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:32,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:29:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:32,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:29:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:32,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 11:29:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:32,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:29:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:32,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:29:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:32,591 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 11:29:32,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:29:32,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829587514] [2024-10-11 11:29:32,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829587514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:29:32,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:29:32,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:29:32,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335769157] [2024-10-11 11:29:32,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:29:32,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:29:32,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:29:32,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:29:32,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:29:32,625 INFO L87 Difference]: Start difference. First operand has 48 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 11:29:32,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:29:32,679 INFO L93 Difference]: Finished difference Result 95 states and 168 transitions. [2024-10-11 11:29:32,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:29:32,683 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 114 [2024-10-11 11:29:32,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:29:32,690 INFO L225 Difference]: With dead ends: 95 [2024-10-11 11:29:32,690 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 11:29:32,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:29:32,698 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:29:32,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:29:32,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 11:29:32,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-11 11:29:32,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 11:29:32,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 70 transitions. [2024-10-11 11:29:32,768 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 70 transitions. Word has length 114 [2024-10-11 11:29:32,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:29:32,769 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 70 transitions. [2024-10-11 11:29:32,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 11:29:32,770 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 70 transitions. [2024-10-11 11:29:32,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 11:29:32,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:29:32,774 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:29:32,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:29:32,775 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:29:32,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:29:32,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1520950900, now seen corresponding path program 1 times [2024-10-11 11:29:32,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:29:32,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239742347] [2024-10-11 11:29:32,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:29:32,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:29:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:52,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:29:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:52,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:29:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:52,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 11:29:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:52,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:29:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:52,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:29:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:53,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:29:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:53,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:29:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:53,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:29:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:53,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:29:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:53,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:29:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:53,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:29:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:53,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:29:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:53,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:29:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:53,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:29:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:53,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:29:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:53,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:29:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:53,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 11:29:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:53,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:29:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:53,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:29:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:29:54,052 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 11:29:54,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:29:54,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239742347] [2024-10-11 11:29:54,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239742347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:29:54,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:29:54,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 11:29:54,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954037651] [2024-10-11 11:29:54,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:29:54,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 11:29:54,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:29:54,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 11:29:54,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:29:54,059 INFO L87 Difference]: Start difference. First operand 46 states and 70 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 11:30:02,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 11:30:07,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 11:30:09,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:30:09,524 INFO L93 Difference]: Finished difference Result 136 states and 193 transitions. [2024-10-11 11:30:09,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 11:30:09,525 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 114 [2024-10-11 11:30:09,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:30:09,531 INFO L225 Difference]: With dead ends: 136 [2024-10-11 11:30:09,532 INFO L226 Difference]: Without dead ends: 134 [2024-10-11 11:30:09,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2024-10-11 11:30:09,534 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 188 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 95 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:30:09,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 309 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 188 Invalid, 1 Unknown, 0 Unchecked, 10.1s Time] [2024-10-11 11:30:09,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-11 11:30:09,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 94. [2024-10-11 11:30:09,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 11:30:09,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 146 transitions. [2024-10-11 11:30:09,569 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 146 transitions. Word has length 114 [2024-10-11 11:30:09,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:30:09,572 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 146 transitions. [2024-10-11 11:30:09,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 11:30:09,573 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 146 transitions. [2024-10-11 11:30:09,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 11:30:09,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:30:09,576 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:30:09,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:30:09,576 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:30:09,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:30:09,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1520891318, now seen corresponding path program 1 times [2024-10-11 11:30:09,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:30:09,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889573367] [2024-10-11 11:30:09,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:30:09,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:30:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:22,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:30:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:22,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:30:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:22,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 11:30:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:22,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:30:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:22,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:30:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:22,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:30:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:22,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:30:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:22,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:30:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:22,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:30:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:22,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:30:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:22,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:30:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:22,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:30:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:22,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:30:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:22,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:30:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:22,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:30:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:22,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:30:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:22,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 11:30:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:22,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:30:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:22,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:30:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 11:30:22,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:30:22,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889573367] [2024-10-11 11:30:22,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889573367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:30:22,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:30:22,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 11:30:22,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157669134] [2024-10-11 11:30:22,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:30:22,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 11:30:22,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:30:22,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 11:30:22,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:30:22,600 INFO L87 Difference]: Start difference. First operand 94 states and 146 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 11:30:27,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 11:30:31,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:30:31,840 INFO L93 Difference]: Finished difference Result 137 states and 202 transitions. [2024-10-11 11:30:31,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 11:30:31,842 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 114 [2024-10-11 11:30:31,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:30:31,844 INFO L225 Difference]: With dead ends: 137 [2024-10-11 11:30:31,844 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 11:30:31,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-11 11:30:31,845 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 53 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-10-11 11:30:31,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 234 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 1 Unknown, 0 Unchecked, 8.5s Time] [2024-10-11 11:30:31,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 11:30:31,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 97. [2024-10-11 11:30:31,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 11:30:31,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 152 transitions. [2024-10-11 11:30:31,878 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 152 transitions. Word has length 114 [2024-10-11 11:30:31,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:30:31,882 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 152 transitions. [2024-10-11 11:30:31,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 11:30:31,883 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 152 transitions. [2024-10-11 11:30:31,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 11:30:31,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:30:31,884 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:30:31,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:30:31,885 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:30:31,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:30:31,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1519103858, now seen corresponding path program 1 times [2024-10-11 11:30:31,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:30:31,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44053277] [2024-10-11 11:30:31,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:30:31,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:30:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:44,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:30:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:44,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:30:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:44,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 11:30:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:44,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:30:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:44,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:30:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:44,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:30:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:44,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:30:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:44,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:30:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:44,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:30:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:44,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:30:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:44,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:30:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:44,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:30:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:44,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:30:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:44,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:30:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:44,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:30:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:44,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:30:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:44,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 11:30:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:44,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:30:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:44,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:30:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:44,490 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 11:30:44,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:30:44,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44053277] [2024-10-11 11:30:44,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44053277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:30:44,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:30:44,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 11:30:44,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129606820] [2024-10-11 11:30:44,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:30:44,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 11:30:44,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:30:44,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 11:30:44,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:30:44,496 INFO L87 Difference]: Start difference. First operand 97 states and 152 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 11:30:48,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 11:30:51,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 11:30:52,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:30:52,190 INFO L93 Difference]: Finished difference Result 137 states and 203 transitions. [2024-10-11 11:30:52,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 11:30:52,191 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 114 [2024-10-11 11:30:52,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:30:52,193 INFO L225 Difference]: With dead ends: 137 [2024-10-11 11:30:52,193 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 11:30:52,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-11 11:30:52,194 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 41 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:30:52,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 238 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2024-10-11 11:30:52,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 11:30:52,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 52. [2024-10-11 11:30:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 11:30:52,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 80 transitions. [2024-10-11 11:30:52,209 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 80 transitions. Word has length 114 [2024-10-11 11:30:52,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:30:52,209 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 80 transitions. [2024-10-11 11:30:52,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 11:30:52,210 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 80 transitions. [2024-10-11 11:30:52,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 11:30:52,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:30:52,211 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:30:52,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:30:52,212 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:30:52,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:30:52,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1519044276, now seen corresponding path program 1 times [2024-10-11 11:30:52,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:30:52,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669932857] [2024-10-11 11:30:52,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:30:52,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:30:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:58,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:30:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:58,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:30:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:58,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 11:30:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:58,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:30:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:58,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:30:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:58,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:30:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:58,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:30:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:58,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:30:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:58,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:30:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:58,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:30:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:58,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:30:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:58,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:30:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:58,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:30:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:58,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:30:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:58,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:30:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:58,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:30:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:58,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 11:30:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:58,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:30:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:58,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:30:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:58,602 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 11:30:58,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:30:58,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669932857] [2024-10-11 11:30:58,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669932857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:30:58,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:30:58,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 11:30:58,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846726482] [2024-10-11 11:30:58,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:30:58,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 11:30:58,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:30:58,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 11:30:58,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:30:58,605 INFO L87 Difference]: Start difference. First operand 52 states and 80 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 11:30:59,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:30:59,834 INFO L93 Difference]: Finished difference Result 67 states and 98 transitions. [2024-10-11 11:30:59,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 11:30:59,835 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 114 [2024-10-11 11:30:59,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:30:59,836 INFO L225 Difference]: With dead ends: 67 [2024-10-11 11:30:59,836 INFO L226 Difference]: Without dead ends: 65 [2024-10-11 11:30:59,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 11:30:59,837 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 25 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 11:30:59,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 237 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 11:30:59,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-11 11:30:59,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2024-10-11 11:30:59,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 11:30:59,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 78 transitions. [2024-10-11 11:30:59,846 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 78 transitions. Word has length 114 [2024-10-11 11:30:59,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:30:59,847 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 78 transitions. [2024-10-11 11:30:59,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 11:30:59,847 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 78 transitions. [2024-10-11 11:30:59,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 11:30:59,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:30:59,849 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:30:59,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 11:30:59,849 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:30:59,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:30:59,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1376893784, now seen corresponding path program 1 times [2024-10-11 11:30:59,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:30:59,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956669916] [2024-10-11 11:30:59,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:30:59,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:30:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:00,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:31:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:00,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:31:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:00,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 11:31:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:00,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:31:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:00,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:31:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:00,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:31:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:00,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:31:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:00,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:31:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:00,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:31:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:00,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:31:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:00,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:31:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:00,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:31:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:00,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:31:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:00,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:31:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:00,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:31:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:00,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:31:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:00,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 11:31:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:00,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:31:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:00,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:31:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:00,156 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-11 11:31:00,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:31:00,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956669916] [2024-10-11 11:31:00,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956669916] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:31:00,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955647131] [2024-10-11 11:31:00,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:31:00,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:31:00,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:31:00,159 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:31:00,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:31:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:00,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 11:31:00,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:31:00,740 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 150 proven. 48 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-10-11 11:31:00,740 INFO L311 TraceCheckSpWp]: Computing backward predicates...