./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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/nla-digbench-scaling/dijkstra-u_valuebound5.c -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 b5a1422c7f1124202863875c2296d538cebfb680907647840c96a830e98d336c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:30:30,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:30:30,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:30:30,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:30:30,381 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:30:30,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:30:30,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:30:30,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:30:30,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:30:30,415 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:30:30,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:30:30,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:30:30,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:30:30,417 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:30:30,418 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:30:30,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:30:30,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:30:30,419 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:30:30,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:30:30,423 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:30:30,423 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:30:30,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:30:30,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:30:30,424 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:30:30,425 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:30:30,430 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:30:30,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:30:30,431 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:30:30,432 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:30:30,432 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:30:30,432 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:30:30,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:30:30,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:30:30,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:30:30,434 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:30:30,434 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:30:30,434 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:30:30,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:30:30,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:30:30,435 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:30:30,435 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:30:30,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:30:30,436 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 -> b5a1422c7f1124202863875c2296d538cebfb680907647840c96a830e98d336c [2024-11-09 22:30:30,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:30:30,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:30:30,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:30:30,713 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:30:30,714 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:30:30,715 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound5.c [2024-11-09 22:30:32,147 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:30:32,348 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:30:32,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound5.c [2024-11-09 22:30:32,360 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a7c716c6/7544151cc22541a3a7e5cc7e374b9893/FLAG23d2a5efc [2024-11-09 22:30:32,723 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a7c716c6/7544151cc22541a3a7e5cc7e374b9893 [2024-11-09 22:30:32,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:30:32,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:30:32,727 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:30:32,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:30:32,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:30:32,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:30:32" (1/1) ... [2024-11-09 22:30:32,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53446e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:30:32, skipping insertion in model container [2024-11-09 22:30:32,735 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:30:32" (1/1) ... [2024-11-09 22:30:32,755 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:30:32,922 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/nla-digbench-scaling/dijkstra-u_valuebound5.c[525,538] [2024-11-09 22:30:32,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:30:32,966 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:30:32,975 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/nla-digbench-scaling/dijkstra-u_valuebound5.c[525,538] [2024-11-09 22:30:32,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:30:33,003 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:30:33,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:30:33 WrapperNode [2024-11-09 22:30:33,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:30:33,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:30:33,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:30:33,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:30:33,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:30:33" (1/1) ... [2024-11-09 22:30:33,016 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:30:33" (1/1) ... [2024-11-09 22:30:33,038 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 51 [2024-11-09 22:30:33,038 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:30:33,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:30:33,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:30:33,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:30:33,050 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:30:33" (1/1) ... [2024-11-09 22:30:33,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:30:33" (1/1) ... [2024-11-09 22:30:33,052 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:30:33" (1/1) ... [2024-11-09 22:30:33,064 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-09 22:30:33,064 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:30:33" (1/1) ... [2024-11-09 22:30:33,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:30:33" (1/1) ... [2024-11-09 22:30:33,067 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:30:33" (1/1) ... [2024-11-09 22:30:33,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:30:33" (1/1) ... [2024-11-09 22:30:33,069 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:30:33" (1/1) ... [2024-11-09 22:30:33,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:30:33" (1/1) ... [2024-11-09 22:30:33,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:30:33,075 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:30:33,075 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:30:33,075 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:30:33,076 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:30:33" (1/1) ... [2024-11-09 22:30:33,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:30:33,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:30:33,117 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-09 22:30:33,123 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-09 22:30:33,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:30:33,169 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 22:30:33,170 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 22:30:33,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:30:33,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:30:33,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:30:33,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 22:30:33,172 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 22:30:33,242 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:30:33,247 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:30:33,454 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-09 22:30:33,454 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:30:33,473 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:30:33,473 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:30:33,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:30:33 BoogieIcfgContainer [2024-11-09 22:30:33,474 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:30:33,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:30:33,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:30:33,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:30:33,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:30:32" (1/3) ... [2024-11-09 22:30:33,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b1179b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:30:33, skipping insertion in model container [2024-11-09 22:30:33,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:30:33" (2/3) ... [2024-11-09 22:30:33,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b1179b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:30:33, skipping insertion in model container [2024-11-09 22:30:33,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:30:33" (3/3) ... [2024-11-09 22:30:33,484 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound5.c [2024-11-09 22:30:33,501 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:30:33,502 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 22:30:33,561 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:30:33,567 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;@2baaa137, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:30:33,569 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 22:30:33,573 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 22:30:33,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 22:30:33,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:30:33,581 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:30:33,581 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:30:33,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:30:33,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1944071338, now seen corresponding path program 1 times [2024-11-09 22:30:33,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:30:33,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465958693] [2024-11-09 22:30:33,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:30:33,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:30:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:30:33,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:30:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:30:33,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:30:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:30:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:30:33,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:30:33,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465958693] [2024-11-09 22:30:33,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465958693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:30:33,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:30:33,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 22:30:33,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590415971] [2024-11-09 22:30:33,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:30:33,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 22:30:33,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:30:33,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 22:30:33,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:30:33,783 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:30:33,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:30:33,811 INFO L93 Difference]: Finished difference Result 69 states and 113 transitions. [2024-11-09 22:30:33,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 22:30:33,814 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-11-09 22:30:33,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:30:33,822 INFO L225 Difference]: With dead ends: 69 [2024-11-09 22:30:33,822 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 22:30:33,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-09 22:30:33,831 INFO L432 NwaCegarLoop]: 47 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, 47 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-09 22:30:33,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:30:33,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 22:30:33,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-09 22:30:33,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 22:30:33,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2024-11-09 22:30:33,882 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 20 [2024-11-09 22:30:33,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:30:33,883 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2024-11-09 22:30:33,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:30:33,884 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2024-11-09 22:30:33,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 22:30:33,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:30:33,885 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:30:33,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:30:33,886 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:30:33,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:30:33,887 INFO L85 PathProgramCache]: Analyzing trace with hash -242934201, now seen corresponding path program 1 times [2024-11-09 22:30:33,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:30:33,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363377644] [2024-11-09 22:30:33,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:30:33,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:30:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:30:34,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:30:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:30:34,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:30:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:30:34,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:30:34,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:30:34,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363377644] [2024-11-09 22:30:34,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363377644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:30:34,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:30:34,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 22:30:34,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120244440] [2024-11-09 22:30:34,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:30:34,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 22:30:34,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:30:34,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 22:30:34,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:30:34,491 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:30:34,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:30:34,874 INFO L93 Difference]: Finished difference Result 68 states and 96 transitions. [2024-11-09 22:30:34,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 22:30:34,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-09 22:30:34,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:30:34,878 INFO L225 Difference]: With dead ends: 68 [2024-11-09 22:30:34,878 INFO L226 Difference]: Without dead ends: 48 [2024-11-09 22:30:34,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 22:30:34,882 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 22:30:34,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 174 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 22:30:34,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-09 22:30:34,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-09 22:30:34,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 22:30:34,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2024-11-09 22:30:34,910 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 23 [2024-11-09 22:30:34,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:30:34,911 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2024-11-09 22:30:34,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:30:34,912 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2024-11-09 22:30:34,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 22:30:34,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:30:34,913 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:30:34,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:30:34,914 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:30:34,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:30:34,915 INFO L85 PathProgramCache]: Analyzing trace with hash -756934275, now seen corresponding path program 1 times [2024-11-09 22:30:34,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:30:34,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823771629] [2024-11-09 22:30:34,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:30:34,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:30:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:30:35,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:30:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:30:35,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:30:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:30:35,326 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:30:35,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:30:35,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823771629] [2024-11-09 22:30:35,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823771629] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:30:35,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065285535] [2024-11-09 22:30:35,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:30:35,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:30:35,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:30:35,331 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:30:35,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 22:30:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:30:35,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 22:30:35,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:30:35,568 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:30:35,569 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:30:35,777 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:30:35,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065285535] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:30:35,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:30:35,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-11-09 22:30:35,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880271373] [2024-11-09 22:30:35,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:30:35,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 22:30:35,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:30:35,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 22:30:35,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-11-09 22:30:35,782 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 13 states have internal predecessors, (38), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:30:41,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 22:30:41,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:30:41,730 INFO L93 Difference]: Finished difference Result 125 states and 191 transitions. [2024-11-09 22:30:41,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 22:30:41,731 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 13 states have internal predecessors, (38), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-09 22:30:41,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:30:41,734 INFO L225 Difference]: With dead ends: 125 [2024-11-09 22:30:41,734 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 22:30:41,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2024-11-09 22:30:41,736 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 30 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 92 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-09 22:30:41,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 308 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 233 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2024-11-09 22:30:41,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 22:30:41,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 71. [2024-11-09 22:30:41,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 41 states have (on average 1.170731707317073) internal successors, (48), 44 states have internal predecessors, (48), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 22:30:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 97 transitions. [2024-11-09 22:30:41,756 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 97 transitions. Word has length 26 [2024-11-09 22:30:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:30:41,756 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 97 transitions. [2024-11-09 22:30:41,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 13 states have internal predecessors, (38), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:30:41,757 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 97 transitions. [2024-11-09 22:30:41,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 22:30:41,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:30:41,758 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:30:41,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 22:30:41,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:30:41,962 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:30:41,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:30:41,963 INFO L85 PathProgramCache]: Analyzing trace with hash 607497479, now seen corresponding path program 1 times [2024-11-09 22:30:41,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:30:41,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920698622] [2024-11-09 22:30:41,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:30:41,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:30:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:30:41,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1820411010] [2024-11-09 22:30:41,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:30:41,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:30:41,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:30:41,989 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:30:41,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 22:30:42,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:30:42,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 22:30:42,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:30:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 22:30:42,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:30:42,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:30:42,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920698622] [2024-11-09 22:30:42,116 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:30:42,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820411010] [2024-11-09 22:30:42,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820411010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:30:42,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:30:42,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:30:42,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835654004] [2024-11-09 22:30:42,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:30:42,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:30:42,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:30:42,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:30:42,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:30:42,121 INFO L87 Difference]: Start difference. First operand 71 states and 97 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 22:30:43,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:30:43,085 INFO L93 Difference]: Finished difference Result 97 states and 134 transitions. [2024-11-09 22:30:43,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:30:43,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2024-11-09 22:30:43,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:30:43,087 INFO L225 Difference]: With dead ends: 97 [2024-11-09 22:30:43,087 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 22:30:43,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:30:43,089 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 22:30:43,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 141 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 22:30:43,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 22:30:43,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-09 22:30:43,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 49 states have (on average 1.163265306122449) internal successors, (57), 51 states have internal predecessors, (57), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-09 22:30:43,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 129 transitions. [2024-11-09 22:30:43,111 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 129 transitions. Word has length 33 [2024-11-09 22:30:43,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:30:43,112 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 129 transitions. [2024-11-09 22:30:43,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 22:30:43,113 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2024-11-09 22:30:43,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 22:30:43,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:30:43,115 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:30:43,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 22:30:43,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-09 22:30:43,316 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:30:43,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:30:43,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1281427681, now seen corresponding path program 1 times [2024-11-09 22:30:43,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:30:43,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795341807] [2024-11-09 22:30:43,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:30:43,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:30:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:30:43,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [251760263] [2024-11-09 22:30:43,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:30:43,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:30:43,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:30:43,345 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:30:43,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 22:30:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:30:43,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 22:30:43,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:30:43,562 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:30:43,562 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:30:44,240 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:30:44,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:30:44,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795341807] [2024-11-09 22:30:44,241 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:30:44,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251760263] [2024-11-09 22:30:44,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251760263] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:30:44,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:30:44,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-11-09 22:30:44,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784523963] [2024-11-09 22:30:44,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:30:44,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 22:30:44,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:30:44,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 22:30:44,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-09 22:30:44,243 INFO L87 Difference]: Start difference. First operand 93 states and 129 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 22:30:50,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 22:30:51,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 22:30:54,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 22:30:58,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 22:31:02,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 22:31:06,486 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-11-09 22:31:09,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 22:31:14,188 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-11-09 22:31:18,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 22:31:22,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 22:31:26,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 22:31:30,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 22:31:34,383 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-11-09 22:31:36,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:31:36,830 INFO L93 Difference]: Finished difference Result 168 states and 238 transitions. [2024-11-09 22:31:36,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 22:31:36,830 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2024-11-09 22:31:36,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:31:36,832 INFO L225 Difference]: With dead ends: 168 [2024-11-09 22:31:36,832 INFO L226 Difference]: Without dead ends: 142 [2024-11-09 22:31:36,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-09 22:31:36,834 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 31 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 70 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.5s IncrementalHoareTripleChecker+Time [2024-11-09 22:31:36,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 318 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 190 Invalid, 10 Unknown, 0 Unchecked, 50.5s Time] [2024-11-09 22:31:36,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-09 22:31:36,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 136. [2024-11-09 22:31:36,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 71 states have (on average 1.1549295774647887) internal successors, (82), 74 states have internal predecessors, (82), 55 states have call successors, (55), 9 states have call predecessors, (55), 9 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-09 22:31:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 190 transitions. [2024-11-09 22:31:36,863 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 190 transitions. Word has length 34 [2024-11-09 22:31:36,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:31:36,863 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 190 transitions. [2024-11-09 22:31:36,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 22:31:36,864 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 190 transitions. [2024-11-09 22:31:36,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 22:31:36,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:31:36,865 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:31:36,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 22:31:37,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:31:37,066 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:31:37,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:31:37,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1421249943, now seen corresponding path program 1 times [2024-11-09 22:31:37,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:31:37,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426868753] [2024-11-09 22:31:37,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:31:37,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:31:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:31:37,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:31:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:31:37,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:31:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:31:37,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 22:31:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:31:37,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 22:31:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:31:37,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 22:31:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:31:37,322 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 22:31:37,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:31:37,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426868753] [2024-11-09 22:31:37,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426868753] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:31:37,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379288606] [2024-11-09 22:31:37,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:31:37,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:31:37,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:31:37,326 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:31:37,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 22:31:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:31:37,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 22:31:37,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:31:37,492 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 22:31:37,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:31:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 22:31:37,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379288606] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:31:37,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:31:37,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-09 22:31:37,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145939160] [2024-11-09 22:31:37,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:31:37,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 22:31:37,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:31:37,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 22:31:37,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-09 22:31:37,685 INFO L87 Difference]: Start difference. First operand 136 states and 190 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-09 22:31:39,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 22:31:40,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:31:40,297 INFO L93 Difference]: Finished difference Result 191 states and 266 transitions. [2024-11-09 22:31:40,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 22:31:40,298 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 47 [2024-11-09 22:31:40,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:31:40,299 INFO L225 Difference]: With dead ends: 191 [2024-11-09 22:31:40,300 INFO L226 Difference]: Without dead ends: 145 [2024-11-09 22:31:40,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2024-11-09 22:31:40,301 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 88 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-09 22:31:40,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 391 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-09 22:31:40,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-09 22:31:40,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2024-11-09 22:31:40,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 71 states have internal predecessors, (74), 55 states have call successors, (55), 9 states have call predecessors, (55), 9 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-09 22:31:40,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 182 transitions. [2024-11-09 22:31:40,339 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 182 transitions. Word has length 47 [2024-11-09 22:31:40,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:31:40,340 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 182 transitions. [2024-11-09 22:31:40,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-09 22:31:40,340 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 182 transitions. [2024-11-09 22:31:40,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 22:31:40,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:31:40,342 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-09 22:31:40,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 22:31:40,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:31:40,543 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:31:40,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:31:40,543 INFO L85 PathProgramCache]: Analyzing trace with hash 530225078, now seen corresponding path program 1 times [2024-11-09 22:31:40,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:31:40,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123479056] [2024-11-09 22:31:40,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:31:40,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:31:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:31:40,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1623070806] [2024-11-09 22:31:40,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:31:40,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:31:40,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:31:40,584 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:31:40,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 22:31:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:31:40,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 22:31:40,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:31:40,758 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 22:31:40,759 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:31:40,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:31:40,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123479056] [2024-11-09 22:31:40,759 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:31:40,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623070806] [2024-11-09 22:31:40,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623070806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:31:40,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:31:40,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:31:40,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042201001] [2024-11-09 22:31:40,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:31:40,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:31:40,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:31:40,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:31:40,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:31:40,762 INFO L87 Difference]: Start difference. First operand 132 states and 182 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 22:31:41,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:31:41,028 INFO L93 Difference]: Finished difference Result 143 states and 194 transitions. [2024-11-09 22:31:41,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:31:41,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 59 [2024-11-09 22:31:41,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:31:41,031 INFO L225 Difference]: With dead ends: 143 [2024-11-09 22:31:41,032 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 22:31:41,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:31:41,033 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 5 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:31:41,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 123 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 22:31:41,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 22:31:41,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-09 22:31:41,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 62 states have (on average 1.096774193548387) internal successors, (68), 65 states have internal predecessors, (68), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-09 22:31:41,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 162 transitions. [2024-11-09 22:31:41,061 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 162 transitions. Word has length 59 [2024-11-09 22:31:41,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:31:41,061 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 162 transitions. [2024-11-09 22:31:41,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 22:31:41,061 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 162 transitions. [2024-11-09 22:31:41,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 22:31:41,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:31:41,067 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-09 22:31:41,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 22:31:41,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:31:41,268 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:31:41,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:31:41,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1426900463, now seen corresponding path program 1 times [2024-11-09 22:31:41,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:31:41,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665052794] [2024-11-09 22:31:41,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:31:41,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:31:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:31:42,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:31:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:31:42,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:31:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:31:42,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 22:31:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:31:42,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 22:31:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:31:42,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 22:31:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:31:42,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 22:31:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:31:42,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 22:31:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:31:42,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 22:31:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:31:42,231 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-09 22:31:42,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:31:42,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665052794] [2024-11-09 22:31:42,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665052794] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:31:42,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362081950] [2024-11-09 22:31:42,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:31:42,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:31:42,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:31:42,235 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:31:42,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 22:31:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:31:42,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 22:31:42,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:31:43,033 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 23 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 22:31:43,034 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:32:03,940 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)