./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount32.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount32.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1f88bd3867028d60c5c1c8fa67c55aaa517a9782eae2d2c8498cbbc5893e8cf0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:57:11,890 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:57:11,960 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 06:57:11,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:57:11,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:57:12,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:57:12,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:57:12,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:57:12,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:57:12,007 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:57:12,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:57:12,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:57:12,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:57:12,014 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:57:12,014 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:57:12,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:57:12,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:57:12,015 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 06:57:12,015 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:57:12,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:57:12,015 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:57:12,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:57:12,016 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:57:12,016 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:57:12,017 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:57:12,017 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:57:12,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:57:12,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:57:12,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:57:12,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:57:12,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:57:12,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:57:12,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:57:12,019 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 06:57:12,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 06:57:12,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:57:12,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:57:12,022 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:57:12,022 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:57:12,022 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1f88bd3867028d60c5c1c8fa67c55aaa517a9782eae2d2c8498cbbc5893e8cf0 [2024-10-11 06:57:12,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:57:12,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:57:12,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:57:12,326 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:57:12,326 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:57:12,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount32.c [2024-10-11 06:57:13,867 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:57:14,040 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:57:14,040 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount32.c [2024-10-11 06:57:14,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/879727b11/6378c6dd8b024427bc904fb4d8761087/FLAG9652abfbc [2024-10-11 06:57:14,060 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/879727b11/6378c6dd8b024427bc904fb4d8761087 [2024-10-11 06:57:14,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:57:14,064 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:57:14,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:57:14,066 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:57:14,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:57:14,074 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:57:14" (1/1) ... [2024-10-11 06:57:14,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30b5fd7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:57:14, skipping insertion in model container [2024-10-11 06:57:14,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:57:14" (1/1) ... [2024-10-11 06:57:14,097 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:57:14,259 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount32.c[1260,1273] [2024-10-11 06:57:14,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:57:14,351 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:57:14,362 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount32.c[1260,1273] [2024-10-11 06:57:14,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:57:14,391 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:57:14,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:57:14 WrapperNode [2024-10-11 06:57:14,392 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:57:14,393 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:57:14,393 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:57:14,394 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:57:14,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:57:14" (1/1) ... [2024-10-11 06:57:14,407 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:57:14" (1/1) ... [2024-10-11 06:57:14,439 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 138 [2024-10-11 06:57:14,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:57:14,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:57:14,441 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:57:14,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:57:14,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:57:14" (1/1) ... [2024-10-11 06:57:14,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:57:14" (1/1) ... [2024-10-11 06:57:14,459 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:57:14" (1/1) ... [2024-10-11 06:57:14,479 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 06:57:14,479 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:57:14" (1/1) ... [2024-10-11 06:57:14,479 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:57:14" (1/1) ... [2024-10-11 06:57:14,487 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:57:14" (1/1) ... [2024-10-11 06:57:14,491 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:57:14" (1/1) ... [2024-10-11 06:57:14,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:57:14" (1/1) ... [2024-10-11 06:57:14,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:57:14" (1/1) ... [2024-10-11 06:57:14,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:57:14,499 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:57:14,499 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:57:14,499 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:57:14,500 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:57:14" (1/1) ... [2024-10-11 06:57:14,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:57:14,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:57:14,540 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 06:57:14,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 06:57:14,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:57:14,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 06:57:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:57:14,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:57:14,676 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:57:14,680 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:57:14,963 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2024-10-11 06:57:14,964 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:57:14,999 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:57:15,000 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:57:15,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:57:15 BoogieIcfgContainer [2024-10-11 06:57:15,000 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:57:15,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:57:15,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:57:15,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:57:15,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:57:14" (1/3) ... [2024-10-11 06:57:15,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c158abf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:57:15, skipping insertion in model container [2024-10-11 06:57:15,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:57:14" (2/3) ... [2024-10-11 06:57:15,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c158abf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:57:15, skipping insertion in model container [2024-10-11 06:57:15,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:57:15" (3/3) ... [2024-10-11 06:57:15,014 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.twocount32.c [2024-10-11 06:57:15,032 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:57:15,033 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:57:15,101 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:57:15,109 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;@4e37e45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:57:15,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:57:15,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 38 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:15,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 06:57:15,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:57:15,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:57:15,125 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:57:15,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:57:15,133 INFO L85 PathProgramCache]: Analyzing trace with hash -726076948, now seen corresponding path program 1 times [2024-10-11 06:57:15,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:57:15,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120858682] [2024-10-11 06:57:15,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:57:15,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:57:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:57:15,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:15,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:57:15,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120858682] [2024-10-11 06:57:15,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120858682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:57:15,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:57:15,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:57:15,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700450959] [2024-10-11 06:57:15,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:57:15,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:57:15,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:57:15,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:57:15,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:57:15,637 INFO L87 Difference]: Start difference. First operand has 39 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 38 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:15,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:57:15,680 INFO L93 Difference]: Finished difference Result 70 states and 102 transitions. [2024-10-11 06:57:15,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:57:15,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 06:57:15,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:57:15,692 INFO L225 Difference]: With dead ends: 70 [2024-10-11 06:57:15,692 INFO L226 Difference]: Without dead ends: 40 [2024-10-11 06:57:15,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:57:15,700 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:57:15,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:57:15,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-11 06:57:15,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-11 06:57:15,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.435897435897436) internal successors, (56), 39 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:15,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2024-10-11 06:57:15,737 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 14 [2024-10-11 06:57:15,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:57:15,737 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2024-10-11 06:57:15,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:15,738 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2024-10-11 06:57:15,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 06:57:15,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:57:15,740 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:57:15,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 06:57:15,741 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:57:15,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:57:15,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1031853690, now seen corresponding path program 1 times [2024-10-11 06:57:15,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:57:15,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275485517] [2024-10-11 06:57:15,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:57:15,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:57:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:57:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:15,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:57:15,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275485517] [2024-10-11 06:57:15,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275485517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:57:15,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:57:15,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:57:15,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817855616] [2024-10-11 06:57:15,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:57:15,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:57:15,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:57:15,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:57:15,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:57:15,910 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:15,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:57:15,952 INFO L93 Difference]: Finished difference Result 73 states and 102 transitions. [2024-10-11 06:57:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:57:15,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 06:57:15,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:57:15,954 INFO L225 Difference]: With dead ends: 73 [2024-10-11 06:57:15,954 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 06:57:15,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:57:15,956 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:57:15,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:57:15,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 06:57:15,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-11 06:57:15,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:15,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2024-10-11 06:57:15,964 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 15 [2024-10-11 06:57:15,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:57:15,966 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2024-10-11 06:57:15,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:15,967 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2024-10-11 06:57:15,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 06:57:15,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:57:15,968 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:57:15,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 06:57:15,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:57:15,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:57:15,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1274308101, now seen corresponding path program 1 times [2024-10-11 06:57:15,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:57:15,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190278358] [2024-10-11 06:57:15,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:57:15,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:57:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:57:16,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:16,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:57:16,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190278358] [2024-10-11 06:57:16,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190278358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:57:16,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:57:16,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:57:16,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439885860] [2024-10-11 06:57:16,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:57:16,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:57:16,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:57:16,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:57:16,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:57:16,297 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:16,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:57:16,366 INFO L93 Difference]: Finished difference Result 86 states and 117 transitions. [2024-10-11 06:57:16,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:57:16,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 06:57:16,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:57:16,369 INFO L225 Difference]: With dead ends: 86 [2024-10-11 06:57:16,369 INFO L226 Difference]: Without dead ends: 53 [2024-10-11 06:57:16,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-11 06:57:16,371 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 18 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:57:16,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 180 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:57:16,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-11 06:57:16,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2024-10-11 06:57:16,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 47 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:16,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 66 transitions. [2024-10-11 06:57:16,382 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 66 transitions. Word has length 16 [2024-10-11 06:57:16,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:57:16,382 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 66 transitions. [2024-10-11 06:57:16,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:16,384 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 66 transitions. [2024-10-11 06:57:16,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 06:57:16,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:57:16,385 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, 1, 1, 1, 1, 1] [2024-10-11 06:57:16,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 06:57:16,386 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:57:16,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:57:16,386 INFO L85 PathProgramCache]: Analyzing trace with hash 660826831, now seen corresponding path program 1 times [2024-10-11 06:57:16,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:57:16,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497643661] [2024-10-11 06:57:16,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:57:16,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:57:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:57:16,984 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:16,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:57:16,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497643661] [2024-10-11 06:57:16,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497643661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:57:16,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:57:16,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:57:16,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180370947] [2024-10-11 06:57:16,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:57:16,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:57:16,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:57:16,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:57:16,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:57:16,987 INFO L87 Difference]: Start difference. First operand 48 states and 66 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:17,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:57:17,171 INFO L93 Difference]: Finished difference Result 98 states and 134 transitions. [2024-10-11 06:57:17,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:57:17,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-11 06:57:17,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:57:17,173 INFO L225 Difference]: With dead ends: 98 [2024-10-11 06:57:17,173 INFO L226 Difference]: Without dead ends: 65 [2024-10-11 06:57:17,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:57:17,175 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 28 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:57:17,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 139 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:57:17,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-11 06:57:17,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2024-10-11 06:57:17,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:17,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2024-10-11 06:57:17,189 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 81 transitions. Word has length 31 [2024-10-11 06:57:17,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:57:17,190 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 81 transitions. [2024-10-11 06:57:17,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:17,190 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2024-10-11 06:57:17,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 06:57:17,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:57:17,191 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, 1, 1, 1, 1, 1, 1] [2024-10-11 06:57:17,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 06:57:17,191 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:57:17,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:57:17,192 INFO L85 PathProgramCache]: Analyzing trace with hash 227347044, now seen corresponding path program 1 times [2024-10-11 06:57:17,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:57:17,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290194423] [2024-10-11 06:57:17,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:57:17,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:57:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:57:17,689 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:17,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:57:17,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290194423] [2024-10-11 06:57:17,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290194423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:57:17,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:57:17,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 06:57:17,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378746562] [2024-10-11 06:57:17,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:57:17,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 06:57:17,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:57:17,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 06:57:17,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:57:17,692 INFO L87 Difference]: Start difference. First operand 60 states and 81 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:17,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:57:17,817 INFO L93 Difference]: Finished difference Result 136 states and 182 transitions. [2024-10-11 06:57:17,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 06:57:17,818 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-10-11 06:57:17,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:57:17,820 INFO L225 Difference]: With dead ends: 136 [2024-10-11 06:57:17,820 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 06:57:17,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:57:17,821 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 50 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:57:17,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 277 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:57:17,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 06:57:17,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2024-10-11 06:57:17,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 96 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:17,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 128 transitions. [2024-10-11 06:57:17,834 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 128 transitions. Word has length 32 [2024-10-11 06:57:17,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:57:17,834 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 128 transitions. [2024-10-11 06:57:17,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:17,834 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 128 transitions. [2024-10-11 06:57:17,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 06:57:17,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:57:17,835 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, 1, 1, 1, 1, 1, 1] [2024-10-11 06:57:17,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 06:57:17,836 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:57:17,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:57:17,836 INFO L85 PathProgramCache]: Analyzing trace with hash -41704899, now seen corresponding path program 1 times [2024-10-11 06:57:17,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:57:17,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646648053] [2024-10-11 06:57:17,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:57:17,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:57:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:57:18,248 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:18,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:57:18,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646648053] [2024-10-11 06:57:18,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646648053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:57:18,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:57:18,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:57:18,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715324546] [2024-10-11 06:57:18,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:57:18,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:57:18,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:57:18,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:57:18,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:57:18,254 INFO L87 Difference]: Start difference. First operand 97 states and 128 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:18,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:57:18,372 INFO L93 Difference]: Finished difference Result 101 states and 132 transitions. [2024-10-11 06:57:18,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:57:18,372 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-10-11 06:57:18,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:57:18,373 INFO L225 Difference]: With dead ends: 101 [2024-10-11 06:57:18,373 INFO L226 Difference]: Without dead ends: 70 [2024-10-11 06:57:18,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:57:18,375 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 20 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:57:18,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 151 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:57:18,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-11 06:57:18,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2024-10-11 06:57:18,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.328358208955224) internal successors, (89), 67 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:18,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 89 transitions. [2024-10-11 06:57:18,387 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 89 transitions. Word has length 32 [2024-10-11 06:57:18,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:57:18,388 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 89 transitions. [2024-10-11 06:57:18,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:18,388 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 89 transitions. [2024-10-11 06:57:18,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 06:57:18,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:57:18,389 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:57:18,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 06:57:18,389 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:57:18,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:57:18,390 INFO L85 PathProgramCache]: Analyzing trace with hash -993759683, now seen corresponding path program 1 times [2024-10-11 06:57:18,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:57:18,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078271974] [2024-10-11 06:57:18,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:57:18,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:57:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:57:18,870 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:18,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:57:18,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078271974] [2024-10-11 06:57:18,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078271974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:57:18,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:57:18,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:57:18,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110066929] [2024-10-11 06:57:18,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:57:18,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:57:18,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:57:18,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:57:18,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:57:18,874 INFO L87 Difference]: Start difference. First operand 68 states and 89 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:18,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:57:18,982 INFO L93 Difference]: Finished difference Result 105 states and 139 transitions. [2024-10-11 06:57:18,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:57:18,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-11 06:57:18,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:57:18,984 INFO L225 Difference]: With dead ends: 105 [2024-10-11 06:57:18,984 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 06:57:18,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:57:18,986 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 13 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:57:18,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 150 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:57:18,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 06:57:18,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-11 06:57:18,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:18,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 88 transitions. [2024-10-11 06:57:18,996 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 88 transitions. Word has length 33 [2024-10-11 06:57:18,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:57:18,996 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 88 transitions. [2024-10-11 06:57:18,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:18,997 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2024-10-11 06:57:18,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 06:57:18,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:57:18,998 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 06:57:18,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 06:57:18,998 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:57:18,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:57:18,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1702841780, now seen corresponding path program 1 times [2024-10-11 06:57:18,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:57:18,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676916703] [2024-10-11 06:57:18,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:57:19,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:57:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:57:19,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:19,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:57:19,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676916703] [2024-10-11 06:57:19,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676916703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:57:19,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:57:19,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:57:19,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312662866] [2024-10-11 06:57:19,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:57:19,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:57:19,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:57:19,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:57:19,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:57:19,472 INFO L87 Difference]: Start difference. First operand 68 states and 88 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:19,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:57:19,622 INFO L93 Difference]: Finished difference Result 107 states and 142 transitions. [2024-10-11 06:57:19,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:57:19,623 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-11 06:57:19,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:57:19,624 INFO L225 Difference]: With dead ends: 107 [2024-10-11 06:57:19,624 INFO L226 Difference]: Without dead ends: 74 [2024-10-11 06:57:19,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:57:19,625 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 25 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:57:19,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 165 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:57:19,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-11 06:57:19,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2024-10-11 06:57:19,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 72 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:19,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 95 transitions. [2024-10-11 06:57:19,630 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 95 transitions. Word has length 33 [2024-10-11 06:57:19,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:57:19,630 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 95 transitions. [2024-10-11 06:57:19,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:19,630 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 95 transitions. [2024-10-11 06:57:19,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 06:57:19,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:57:19,631 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 06:57:19,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 06:57:19,632 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:57:19,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:57:19,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1971893723, now seen corresponding path program 1 times [2024-10-11 06:57:19,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:57:19,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147102720] [2024-10-11 06:57:19,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:57:19,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:57:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:57:19,936 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:19,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:57:19,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147102720] [2024-10-11 06:57:19,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147102720] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 06:57:19,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515769383] [2024-10-11 06:57:19,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:57:19,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:57:19,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:57:19,941 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 06:57:19,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 06:57:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:57:20,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 06:57:20,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:57:20,292 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:20,292 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 06:57:20,539 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:20,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515769383] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 06:57:20,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 06:57:20,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8] total 20 [2024-10-11 06:57:20,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376692153] [2024-10-11 06:57:20,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 06:57:20,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 06:57:20,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:57:20,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 06:57:20,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2024-10-11 06:57:20,543 INFO L87 Difference]: Start difference. First operand 73 states and 95 transitions. Second operand has 21 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 20 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:21,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:57:21,273 INFO L93 Difference]: Finished difference Result 172 states and 228 transitions. [2024-10-11 06:57:21,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 06:57:21,274 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 20 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-11 06:57:21,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:57:21,275 INFO L225 Difference]: With dead ends: 172 [2024-10-11 06:57:21,275 INFO L226 Difference]: Without dead ends: 139 [2024-10-11 06:57:21,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=288, Invalid=1194, Unknown=0, NotChecked=0, Total=1482 [2024-10-11 06:57:21,276 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 266 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 06:57:21,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 494 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 06:57:21,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-11 06:57:21,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 97. [2024-10-11 06:57:21,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 96 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:21,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 128 transitions. [2024-10-11 06:57:21,282 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 128 transitions. Word has length 33 [2024-10-11 06:57:21,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:57:21,283 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 128 transitions. [2024-10-11 06:57:21,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 20 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:21,283 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 128 transitions. [2024-10-11 06:57:21,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 06:57:21,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:57:21,284 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:57:21,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 06:57:21,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:57:21,489 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:57:21,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:57:21,490 INFO L85 PathProgramCache]: Analyzing trace with hash 398622485, now seen corresponding path program 1 times [2024-10-11 06:57:21,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:57:21,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055997837] [2024-10-11 06:57:21,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:57:21,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:57:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:57:21,628 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:21,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:57:21,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055997837] [2024-10-11 06:57:21,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055997837] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 06:57:21,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429117847] [2024-10-11 06:57:21,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:57:21,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:57:21,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:57:21,632 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 06:57:21,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 06:57:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:57:21,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 06:57:21,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:57:21,788 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:21,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 06:57:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:21,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429117847] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 06:57:21,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 06:57:21,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-11 06:57:21,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624636000] [2024-10-11 06:57:21,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 06:57:21,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 06:57:21,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:57:21,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 06:57:21,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 06:57:21,896 INFO L87 Difference]: Start difference. First operand 97 states and 128 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:22,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:57:22,030 INFO L93 Difference]: Finished difference Result 218 states and 292 transitions. [2024-10-11 06:57:22,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 06:57:22,030 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-11 06:57:22,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:57:22,031 INFO L225 Difference]: With dead ends: 218 [2024-10-11 06:57:22,031 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 06:57:22,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-10-11 06:57:22,032 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 34 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:57:22,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 440 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:57:22,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 06:57:22,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 125. [2024-10-11 06:57:22,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.314516129032258) internal successors, (163), 124 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:22,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 163 transitions. [2024-10-11 06:57:22,048 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 163 transitions. Word has length 35 [2024-10-11 06:57:22,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:57:22,048 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 163 transitions. [2024-10-11 06:57:22,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:22,048 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 163 transitions. [2024-10-11 06:57:22,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 06:57:22,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:57:22,049 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:57:22,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 06:57:22,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:57:22,250 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:57:22,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:57:22,251 INFO L85 PathProgramCache]: Analyzing trace with hash 464534301, now seen corresponding path program 1 times [2024-10-11 06:57:22,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:57:22,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501242737] [2024-10-11 06:57:22,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:57:22,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:57:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:57:22,509 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:22,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:57:22,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501242737] [2024-10-11 06:57:22,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501242737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:57:22,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:57:22,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:57:22,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030305285] [2024-10-11 06:57:22,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:57:22,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:57:22,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:57:22,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:57:22,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:57:22,511 INFO L87 Difference]: Start difference. First operand 125 states and 163 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:22,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:57:22,589 INFO L93 Difference]: Finished difference Result 203 states and 268 transitions. [2024-10-11 06:57:22,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:57:22,589 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-10-11 06:57:22,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:57:22,590 INFO L225 Difference]: With dead ends: 203 [2024-10-11 06:57:22,590 INFO L226 Difference]: Without dead ends: 129 [2024-10-11 06:57:22,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:57:22,591 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 26 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:57:22,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 216 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:57:22,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-11 06:57:22,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2024-10-11 06:57:22,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.3095238095238095) internal successors, (165), 126 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:22,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 165 transitions. [2024-10-11 06:57:22,595 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 165 transitions. Word has length 36 [2024-10-11 06:57:22,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:57:22,596 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 165 transitions. [2024-10-11 06:57:22,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 165 transitions. [2024-10-11 06:57:22,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 06:57:22,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:57:22,597 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-10-11 06:57:22,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 06:57:22,597 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:57:22,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:57:22,597 INFO L85 PathProgramCache]: Analyzing trace with hash -834474451, now seen corresponding path program 1 times [2024-10-11 06:57:22,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:57:22,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053342840] [2024-10-11 06:57:22,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:57:22,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:57:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:57:22,849 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:22,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:57:22,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053342840] [2024-10-11 06:57:22,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053342840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:57:22,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:57:22,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 06:57:22,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586687496] [2024-10-11 06:57:22,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:57:22,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 06:57:22,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:57:22,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 06:57:22,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:57:22,853 INFO L87 Difference]: Start difference. First operand 127 states and 165 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:22,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:57:22,905 INFO L93 Difference]: Finished difference Result 220 states and 287 transitions. [2024-10-11 06:57:22,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 06:57:22,906 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-10-11 06:57:22,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:57:22,906 INFO L225 Difference]: With dead ends: 220 [2024-10-11 06:57:22,906 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 06:57:22,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:57:22,907 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 18 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:57:22,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 243 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:57:22,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 06:57:22,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-10-11 06:57:22,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.291044776119403) internal successors, (173), 134 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:22,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 173 transitions. [2024-10-11 06:57:22,914 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 173 transitions. Word has length 36 [2024-10-11 06:57:22,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:57:22,914 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 173 transitions. [2024-10-11 06:57:22,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:22,914 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 173 transitions. [2024-10-11 06:57:22,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 06:57:22,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:57:22,915 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:57:22,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 06:57:22,916 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:57:22,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:57:22,917 INFO L85 PathProgramCache]: Analyzing trace with hash -2022204904, now seen corresponding path program 1 times [2024-10-11 06:57:22,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:57:22,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977592091] [2024-10-11 06:57:22,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:57:22,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:57:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:57:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:23,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:57:23,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977592091] [2024-10-11 06:57:23,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977592091] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 06:57:23,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664398982] [2024-10-11 06:57:23,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:57:23,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:57:23,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:57:23,522 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 06:57:23,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 06:57:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:57:23,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-10-11 06:57:23,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:57:24,411 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:24,412 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 06:57:26,258 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:26,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664398982] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 06:57:26,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 06:57:26,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 12] total 33 [2024-10-11 06:57:26,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638771164] [2024-10-11 06:57:26,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 06:57:26,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-11 06:57:26,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:57:26,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-11 06:57:26,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1008, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 06:57:26,261 INFO L87 Difference]: Start difference. First operand 135 states and 173 transitions. Second operand has 34 states, 34 states have (on average 2.8823529411764706) internal successors, (98), 33 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:27,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:57:27,266 INFO L93 Difference]: Finished difference Result 284 states and 367 transitions. [2024-10-11 06:57:27,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 06:57:27,267 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.8823529411764706) internal successors, (98), 33 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-10-11 06:57:27,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:57:27,269 INFO L225 Difference]: With dead ends: 284 [2024-10-11 06:57:27,269 INFO L226 Difference]: Without dead ends: 212 [2024-10-11 06:57:27,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=219, Invalid=1943, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 06:57:27,270 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 123 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 06:57:27,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 292 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 06:57:27,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-11 06:57:27,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 126. [2024-10-11 06:57:27,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.288) internal successors, (161), 125 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:27,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 161 transitions. [2024-10-11 06:57:27,275 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 161 transitions. Word has length 37 [2024-10-11 06:57:27,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:57:27,275 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 161 transitions. [2024-10-11 06:57:27,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.8823529411764706) internal successors, (98), 33 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:27,276 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 161 transitions. [2024-10-11 06:57:27,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 06:57:27,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:57:27,278 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 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] [2024-10-11 06:57:27,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 06:57:27,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:57:27,483 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:57:27,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:57:27,483 INFO L85 PathProgramCache]: Analyzing trace with hash 25621533, now seen corresponding path program 1 times [2024-10-11 06:57:27,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:57:27,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470409861] [2024-10-11 06:57:27,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:57:27,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:57:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:57:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:27,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:57:27,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470409861] [2024-10-11 06:57:27,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470409861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:57:27,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:57:27,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 06:57:27,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964365619] [2024-10-11 06:57:27,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:57:27,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:57:27,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:57:27,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:57:27,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:57:27,721 INFO L87 Difference]: Start difference. First operand 126 states and 161 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:27,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:57:27,780 INFO L93 Difference]: Finished difference Result 241 states and 313 transitions. [2024-10-11 06:57:27,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:57:27,781 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-11 06:57:27,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:57:27,782 INFO L225 Difference]: With dead ends: 241 [2024-10-11 06:57:27,782 INFO L226 Difference]: Without dead ends: 169 [2024-10-11 06:57:27,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:57:27,783 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 10 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:57:27,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 370 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:57:27,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-11 06:57:27,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161. [2024-10-11 06:57:27,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.2875) internal successors, (206), 160 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 206 transitions. [2024-10-11 06:57:27,787 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 206 transitions. Word has length 51 [2024-10-11 06:57:27,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:57:27,787 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 206 transitions. [2024-10-11 06:57:27,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:27,788 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 206 transitions. [2024-10-11 06:57:27,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 06:57:27,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:57:27,789 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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] [2024-10-11 06:57:27,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 06:57:27,789 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:57:27,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:57:27,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1398546571, now seen corresponding path program 1 times [2024-10-11 06:57:27,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:57:27,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595607929] [2024-10-11 06:57:27,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:57:27,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:57:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:57:28,180 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:28,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:57:28,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595607929] [2024-10-11 06:57:28,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595607929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:57:28,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:57:28,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 06:57:28,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920958895] [2024-10-11 06:57:28,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:57:28,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 06:57:28,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:57:28,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 06:57:28,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 06:57:28,183 INFO L87 Difference]: Start difference. First operand 161 states and 206 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:28,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:57:28,280 INFO L93 Difference]: Finished difference Result 336 states and 425 transitions. [2024-10-11 06:57:28,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 06:57:28,281 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-11 06:57:28,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:57:28,282 INFO L225 Difference]: With dead ends: 336 [2024-10-11 06:57:28,282 INFO L226 Difference]: Without dead ends: 227 [2024-10-11 06:57:28,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 06:57:28,283 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 16 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:57:28,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 442 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:57:28,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-10-11 06:57:28,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 197. [2024-10-11 06:57:28,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.2704081632653061) internal successors, (249), 196 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:28,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 249 transitions. [2024-10-11 06:57:28,291 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 249 transitions. Word has length 51 [2024-10-11 06:57:28,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:57:28,291 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 249 transitions. [2024-10-11 06:57:28,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:28,292 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 249 transitions. [2024-10-11 06:57:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 06:57:28,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:57:28,293 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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] [2024-10-11 06:57:28,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 06:57:28,293 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:57:28,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:57:28,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1093729738, now seen corresponding path program 1 times [2024-10-11 06:57:28,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:57:28,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790730423] [2024-10-11 06:57:28,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:57:28,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:57:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:57:28,688 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:28,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:57:28,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790730423] [2024-10-11 06:57:28,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790730423] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 06:57:28,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216295988] [2024-10-11 06:57:28,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:57:28,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:57:28,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:57:28,691 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 06:57:28,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 06:57:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:57:28,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-10-11 06:57:28,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:57:29,177 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:29,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 06:57:29,669 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:29,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216295988] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 06:57:29,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 06:57:29,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 23 [2024-10-11 06:57:29,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324359371] [2024-10-11 06:57:29,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 06:57:29,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 06:57:29,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:57:29,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 06:57:29,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2024-10-11 06:57:29,672 INFO L87 Difference]: Start difference. First operand 197 states and 249 transitions. Second operand has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 23 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:30,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:57:30,860 INFO L93 Difference]: Finished difference Result 447 states and 568 transitions. [2024-10-11 06:57:30,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 06:57:30,860 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 23 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-11 06:57:30,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:57:30,862 INFO L225 Difference]: With dead ends: 447 [2024-10-11 06:57:30,862 INFO L226 Difference]: Without dead ends: 316 [2024-10-11 06:57:30,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=424, Invalid=1646, Unknown=0, NotChecked=0, Total=2070 [2024-10-11 06:57:30,864 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 278 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 06:57:30,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 192 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 06:57:30,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-10-11 06:57:30,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 201. [2024-10-11 06:57:30,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.275) internal successors, (255), 200 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:30,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 255 transitions. [2024-10-11 06:57:30,872 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 255 transitions. Word has length 52 [2024-10-11 06:57:30,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:57:30,872 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 255 transitions. [2024-10-11 06:57:30,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 23 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:30,872 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 255 transitions. [2024-10-11 06:57:30,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 06:57:30,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:57:30,873 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 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] [2024-10-11 06:57:30,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 06:57:31,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 06:57:31,074 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:57:31,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:57:31,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1679137118, now seen corresponding path program 1 times [2024-10-11 06:57:31,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:57:31,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132755390] [2024-10-11 06:57:31,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:57:31,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:57:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:57:31,285 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 06:57:31,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:57:31,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132755390] [2024-10-11 06:57:31,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132755390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:57:31,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:57:31,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:57:31,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953026973] [2024-10-11 06:57:31,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:57:31,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:57:31,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:57:31,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:57:31,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:57:31,288 INFO L87 Difference]: Start difference. First operand 201 states and 255 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:31,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:57:31,339 INFO L93 Difference]: Finished difference Result 350 states and 449 transitions. [2024-10-11 06:57:31,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:57:31,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-11 06:57:31,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:57:31,341 INFO L225 Difference]: With dead ends: 350 [2024-10-11 06:57:31,341 INFO L226 Difference]: Without dead ends: 193 [2024-10-11 06:57:31,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:57:31,342 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 35 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:57:31,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 123 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:57:31,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-11 06:57:31,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 139. [2024-10-11 06:57:31,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.2463768115942029) internal successors, (172), 138 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:31,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 172 transitions. [2024-10-11 06:57:31,348 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 172 transitions. Word has length 54 [2024-10-11 06:57:31,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:57:31,348 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 172 transitions. [2024-10-11 06:57:31,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:31,349 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 172 transitions. [2024-10-11 06:57:31,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 06:57:31,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:57:31,349 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 06:57:31,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 06:57:31,350 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:57:31,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:57:31,350 INFO L85 PathProgramCache]: Analyzing trace with hash 259618128, now seen corresponding path program 1 times [2024-10-11 06:57:31,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:57:31,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143347705] [2024-10-11 06:57:31,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:57:31,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:57:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:57:32,020 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:32,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:57:32,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143347705] [2024-10-11 06:57:32,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143347705] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 06:57:32,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658182231] [2024-10-11 06:57:32,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:57:32,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:57:32,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:57:32,023 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 06:57:32,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 06:57:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:57:32,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-10-11 06:57:32,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:57:32,901 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:32,901 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 06:57:34,216 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:34,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658182231] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 06:57:34,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 06:57:34,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 16] total 41 [2024-10-11 06:57:34,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10230907] [2024-10-11 06:57:34,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 06:57:34,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-11 06:57:34,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:57:34,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-11 06:57:34,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1500, Unknown=0, NotChecked=0, Total=1722 [2024-10-11 06:57:34,220 INFO L87 Difference]: Start difference. First operand 139 states and 172 transitions. Second operand has 42 states, 42 states have (on average 3.5) internal successors, (147), 41 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:35,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:57:35,310 INFO L93 Difference]: Finished difference Result 433 states and 529 transitions. [2024-10-11 06:57:35,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-11 06:57:35,311 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.5) internal successors, (147), 41 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-10-11 06:57:35,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:57:35,312 INFO L225 Difference]: With dead ends: 433 [2024-10-11 06:57:35,312 INFO L226 Difference]: Without dead ends: 324 [2024-10-11 06:57:35,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1347 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=576, Invalid=3846, Unknown=0, NotChecked=0, Total=4422 [2024-10-11 06:57:35,314 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 380 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 06:57:35,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 481 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 06:57:35,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-11 06:57:35,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 191. [2024-10-11 06:57:35,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 1.236842105263158) internal successors, (235), 190 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 235 transitions. [2024-10-11 06:57:35,330 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 235 transitions. Word has length 57 [2024-10-11 06:57:35,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:57:35,331 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 235 transitions. [2024-10-11 06:57:35,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.5) internal successors, (147), 41 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:35,331 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 235 transitions. [2024-10-11 06:57:35,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 06:57:35,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:57:35,332 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:57:35,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 06:57:35,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 06:57:35,537 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:57:35,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:57:35,537 INFO L85 PathProgramCache]: Analyzing trace with hash -110850863, now seen corresponding path program 1 times [2024-10-11 06:57:35,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:57:35,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604574373] [2024-10-11 06:57:35,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:57:35,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:57:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:57:36,103 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 43 proven. 27 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 06:57:36,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:57:36,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604574373] [2024-10-11 06:57:36,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604574373] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 06:57:36,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740735606] [2024-10-11 06:57:36,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:57:36,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:57:36,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:57:36,108 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 06:57:36,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 06:57:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:57:36,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 103 conjuncts are in the unsatisfiable core [2024-10-11 06:57:36,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:57:37,224 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:37,225 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 06:57:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 23 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:39,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740735606] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 06:57:39,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 06:57:39,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 23, 21] total 50 [2024-10-11 06:57:39,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406776016] [2024-10-11 06:57:39,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 06:57:39,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-10-11 06:57:39,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:57:39,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-10-11 06:57:39,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=2226, Unknown=0, NotChecked=0, Total=2550 [2024-10-11 06:57:39,316 INFO L87 Difference]: Start difference. First operand 191 states and 235 transitions. Second operand has 51 states, 51 states have (on average 4.03921568627451) internal successors, (206), 50 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:43,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:57:43,096 INFO L93 Difference]: Finished difference Result 481 states and 585 transitions. [2024-10-11 06:57:43,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-10-11 06:57:43,097 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 4.03921568627451) internal successors, (206), 50 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-11 06:57:43,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:57:43,099 INFO L225 Difference]: With dead ends: 481 [2024-10-11 06:57:43,099 INFO L226 Difference]: Without dead ends: 320 [2024-10-11 06:57:43,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2073, Invalid=14183, Unknown=0, NotChecked=0, Total=16256 [2024-10-11 06:57:43,104 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 532 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 1884 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 1912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:57:43,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 336 Invalid, 1912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1884 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 06:57:43,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-11 06:57:43,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 201. [2024-10-11 06:57:43,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.23) internal successors, (246), 200 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:43,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 246 transitions. [2024-10-11 06:57:43,118 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 246 transitions. Word has length 76 [2024-10-11 06:57:43,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:57:43,119 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 246 transitions. [2024-10-11 06:57:43,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 4.03921568627451) internal successors, (206), 50 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:43,119 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 246 transitions. [2024-10-11 06:57:43,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 06:57:43,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:57:43,120 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:57:43,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 06:57:43,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:57:43,321 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:57:43,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:57:43,321 INFO L85 PathProgramCache]: Analyzing trace with hash -793398443, now seen corresponding path program 1 times [2024-10-11 06:57:43,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:57:43,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800188161] [2024-10-11 06:57:43,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:57:43,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:57:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:57:44,627 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 36 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:44,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:57:44,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800188161] [2024-10-11 06:57:44,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800188161] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 06:57:44,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388319631] [2024-10-11 06:57:44,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:57:44,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:57:44,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:57:44,630 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 06:57:44,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 06:57:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:57:44,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 93 conjuncts are in the unsatisfiable core [2024-10-11 06:57:44,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:57:47,624 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 23 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:47,624 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 06:57:52,331 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 12 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:57:52,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388319631] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 06:57:52,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 06:57:52,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 24] total 56 [2024-10-11 06:57:52,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079146937] [2024-10-11 06:57:52,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 06:57:52,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-10-11 06:57:52,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:57:52,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-10-11 06:57:52,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=2700, Unknown=0, NotChecked=0, Total=3192 [2024-10-11 06:57:52,335 INFO L87 Difference]: Start difference. First operand 201 states and 246 transitions. Second operand has 57 states, 57 states have (on average 3.7719298245614037) internal successors, (215), 56 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:57:57,800 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-10-11 06:58:05,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:58:05,862 INFO L93 Difference]: Finished difference Result 685 states and 830 transitions. [2024-10-11 06:58:05,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-11 06:58:05,862 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 3.7719298245614037) internal successors, (215), 56 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-11 06:58:05,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:58:05,865 INFO L225 Difference]: With dead ends: 685 [2024-10-11 06:58:05,865 INFO L226 Difference]: Without dead ends: 503 [2024-10-11 06:58:05,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 114 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2467 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=1285, Invalid=6723, Unknown=2, NotChecked=0, Total=8010 [2024-10-11 06:58:05,868 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 627 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-11 06:58:05,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 543 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 796 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-10-11 06:58:05,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-10-11 06:58:05,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 265. [2024-10-11 06:58:05,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.2159090909090908) internal successors, (321), 264 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:58:05,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 321 transitions. [2024-10-11 06:58:05,881 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 321 transitions. Word has length 77 [2024-10-11 06:58:05,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:58:05,882 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 321 transitions. [2024-10-11 06:58:05,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 3.7719298245614037) internal successors, (215), 56 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:58:05,882 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 321 transitions. [2024-10-11 06:58:05,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 06:58:05,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:58:05,883 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:58:05,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 06:58:06,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 06:58:06,084 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:58:06,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:58:06,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1204235320, now seen corresponding path program 2 times [2024-10-11 06:58:06,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:58:06,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010697618] [2024-10-11 06:58:06,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:58:06,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:58:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 06:58:06,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 06:58:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 06:58:06,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 06:58:06,375 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 06:58:06,376 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 06:58:06,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 06:58:06,380 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:58:06,444 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 06:58:06,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:58:06 BoogieIcfgContainer [2024-10-11 06:58:06,449 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 06:58:06,449 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 06:58:06,449 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 06:58:06,450 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 06:58:06,450 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:57:15" (3/4) ... [2024-10-11 06:58:06,452 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 06:58:06,453 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 06:58:06,453 INFO L158 Benchmark]: Toolchain (without parser) took 52389.12ms. Allocated memory was 172.0MB in the beginning and 461.4MB in the end (delta: 289.4MB). Free memory was 103.8MB in the beginning and 165.8MB in the end (delta: -62.0MB). Peak memory consumption was 229.1MB. Max. memory is 16.1GB. [2024-10-11 06:58:06,454 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 102.8MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:58:06,454 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.09ms. Allocated memory is still 172.0MB. Free memory was 103.7MB in the beginning and 142.2MB in the end (delta: -38.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 06:58:06,454 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.71ms. Allocated memory is still 172.0MB. Free memory was 142.2MB in the beginning and 138.8MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 06:58:06,455 INFO L158 Benchmark]: Boogie Preprocessor took 57.45ms. Allocated memory is still 172.0MB. Free memory was 138.8MB in the beginning and 136.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 06:58:06,455 INFO L158 Benchmark]: RCFGBuilder took 501.68ms. Allocated memory is still 172.0MB. Free memory was 136.7MB in the beginning and 115.0MB in the end (delta: 21.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 06:58:06,456 INFO L158 Benchmark]: TraceAbstraction took 51445.82ms. Allocated memory was 172.0MB in the beginning and 461.4MB in the end (delta: 289.4MB). Free memory was 114.3MB in the beginning and 166.9MB in the end (delta: -52.6MB). Peak memory consumption was 238.1MB. Max. memory is 16.1GB. [2024-10-11 06:58:06,459 INFO L158 Benchmark]: Witness Printer took 3.73ms. Allocated memory is still 461.4MB. Free memory was 166.9MB in the beginning and 165.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 06:58:06,460 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 102.8MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.09ms. Allocated memory is still 172.0MB. Free memory was 103.7MB in the beginning and 142.2MB in the end (delta: -38.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.71ms. Allocated memory is still 172.0MB. Free memory was 142.2MB in the beginning and 138.8MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.45ms. Allocated memory is still 172.0MB. Free memory was 138.8MB in the beginning and 136.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 501.68ms. Allocated memory is still 172.0MB. Free memory was 136.7MB in the beginning and 115.0MB in the end (delta: 21.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 51445.82ms. Allocated memory was 172.0MB in the beginning and 461.4MB in the end (delta: 289.4MB). Free memory was 114.3MB in the beginning and 166.9MB in the end (delta: -52.6MB). Peak memory consumption was 238.1MB. Max. memory is 16.1GB. * Witness Printer took 3.73ms. Allocated memory is still 461.4MB. Free memory was 166.9MB in the beginning and 165.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 22]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 82. Possible FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 32); [L31] const SORT_2 msb_SORT_2 = (SORT_2)1 << (32 - 1); [L33] const SORT_2 var_4 = 0; [L34] const SORT_2 var_9 = 1; [L35] const SORT_2 var_16 = 3; [L37] SORT_1 input_3; [L39] EXPR __VERIFIER_nondet_uint() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=-1, var_16=3, var_4=0, var_9=1] [L39] SORT_2 state_5 = __VERIFIER_nondet_uint() & mask_SORT_2; [L40] EXPR __VERIFIER_nondet_uint() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=-1, var_16=3, var_4=0, var_9=1] [L40] SORT_2 state_6 = __VERIFIER_nondet_uint() & mask_SORT_2; [L42] SORT_2 init_7_arg_1 = var_4; [L43] state_5 = init_7_arg_1 [L44] SORT_2 init_8_arg_1 = var_4; [L45] state_6 = init_8_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=-1, state_5=0, state_6=0, var_16=3, var_9=1] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=-1, state_5=0, state_6=0, var_16=3, var_9=1] [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=0, state_6=0, var_16=3, var_19_arg_0=0, var_19_arg_1=0, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=0, state_6=0, var_16=3, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=0, state_6=0, var_16=3, var_9=1] [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L22] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_6=0, var_12=1, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_6=0, var_16=3, var_9=1] [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; VAL [mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-8589934591, state_6=0, var_11=1, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-8589934591, state_6=0, var_11=1, var_16=3, var_9=1] [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; VAL [mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-8589934591, var_13=1, var_16=3, var_9=1] [L82] EXPR var_13 & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-8589934591, var_16=3, var_9=1] [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=-1, state_5=-8589934591, state_6=4294967297, var_16=3, var_9=1] [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=-8589934591, state_6=4294967297, var_16=3, var_19_arg_0=0, var_19_arg_1=0, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=-8589934591, state_6=4294967297, var_16=3, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=-8589934591, state_6=4294967297, var_16=3, var_9=1] [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L22] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_6=4294967297, var_12=-8589934590, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_6=4294967297, var_16=3, var_9=1] [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; VAL [mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-4294967294, state_6=4294967297, var_11=4294967298, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-4294967294, state_6=4294967297, var_11=4294967298, var_16=3, var_9=1] [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; VAL [mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-4294967294, var_13=4294967298, var_16=3, var_9=1] [L82] EXPR var_13 & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=-4294967294, var_16=3, var_9=1] [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=-1, state_5=-4294967294, state_6=8589934594, var_16=3, var_9=1] [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=-4294967294, state_6=8589934594, var_16=3, var_19_arg_0=0, var_19_arg_1=0, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=-4294967294, state_6=8589934594, var_16=3, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=-4294967294, state_6=8589934594, var_16=3, var_9=1] [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L22] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_6=8589934594, var_12=-4294967293, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_6=8589934594, var_16=3, var_9=1] [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; VAL [mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=3, state_6=8589934594, var_11=8589934595, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=3, state_6=8589934594, var_11=8589934595, var_16=3, var_9=1] [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; VAL [mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=3, var_13=8589934595, var_16=3, var_9=1] [L82] EXPR var_13 & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=-1, next_14_arg_1=3, var_16=3, var_9=1] [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=-1, state_5=3, state_6=-4294967293, var_16=3, var_9=1] [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=3, state_6=-4294967293, var_16=3, var_19_arg_0=1, var_19_arg_1=1, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=3, state_6=-4294967293, var_16=3, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=-1, state_5=3, state_6=-4294967293, var_16=3, var_9=1] [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L22] COND TRUE !(cond) [L22] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 51.3s, OverallIterations: 21, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 22.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 2499 SdHoareTripleChecker+Valid, 8.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2499 mSDsluCounter, 5527 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4726 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6877 IncrementalHoareTripleChecker+Invalid, 6981 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 801 mSDtfsCounter, 6877 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1079 GetRequests, 589 SyntacticMatches, 10 SemanticMatches, 480 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9415 ImplicationChecksByTransitivity, 22.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=265occurred in iteration=20, InterpolantAutomatonStates: 327, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 852 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 24.3s InterpolantComputationTime, 1247 NumberOfCodeBlocks, 1247 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1501 ConstructedInterpolants, 0 QuantifiedInterpolants, 23113 SizeOfPredicates, 48 NumberOfNonLiveVariables, 1870 ConjunctsInSsa, 454 ConjunctsInUnsatCore, 34 InterpolantComputations, 13 PerfectInterpolantSequences, 454/918 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 06:58:06,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount32.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1f88bd3867028d60c5c1c8fa67c55aaa517a9782eae2d2c8498cbbc5893e8cf0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:58:08,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:58:08,963 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-11 06:58:08,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:58:08,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:58:09,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:58:09,014 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:58:09,015 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:58:09,015 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:58:09,017 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:58:09,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:58:09,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:58:09,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:58:09,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:58:09,019 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:58:09,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:58:09,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:58:09,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:58:09,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:58:09,023 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:58:09,023 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:58:09,026 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 06:58:09,026 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 06:58:09,027 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:58:09,027 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 06:58:09,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:58:09,028 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:58:09,028 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:58:09,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:58:09,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:58:09,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:58:09,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:58:09,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:58:09,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:58:09,031 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:58:09,031 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 06:58:09,032 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 06:58:09,032 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:58:09,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:58:09,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:58:09,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:58:09,033 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 06:58:09,034 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1f88bd3867028d60c5c1c8fa67c55aaa517a9782eae2d2c8498cbbc5893e8cf0 [2024-10-11 06:58:09,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:58:09,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:58:09,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:58:09,460 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:58:09,461 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:58:09,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount32.c [2024-10-11 06:58:11,110 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:58:11,317 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:58:11,318 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount32.c [2024-10-11 06:58:11,332 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ef7ebee91/b44af4227c144ad7bdd0a012c7bc6ad1/FLAG24ef477f3 [2024-10-11 06:58:11,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ef7ebee91/b44af4227c144ad7bdd0a012c7bc6ad1 [2024-10-11 06:58:11,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:58:11,362 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:58:11,364 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:58:11,365 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:58:11,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:58:11,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:58:11" (1/1) ... [2024-10-11 06:58:11,372 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54a675f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11, skipping insertion in model container [2024-10-11 06:58:11,372 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:58:11" (1/1) ... [2024-10-11 06:58:11,397 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:58:11,581 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount32.c[1260,1273] [2024-10-11 06:58:11,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:58:11,635 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:58:11,651 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount32.c[1260,1273] [2024-10-11 06:58:11,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:58:11,698 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:58:11,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11 WrapperNode [2024-10-11 06:58:11,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:58:11,700 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:58:11,700 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:58:11,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:58:11,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11" (1/1) ... [2024-10-11 06:58:11,718 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11" (1/1) ... [2024-10-11 06:58:11,743 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2024-10-11 06:58:11,743 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:58:11,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:58:11,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:58:11,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:58:11,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11" (1/1) ... [2024-10-11 06:58:11,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11" (1/1) ... [2024-10-11 06:58:11,760 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11" (1/1) ... [2024-10-11 06:58:11,787 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 06:58:11,789 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11" (1/1) ... [2024-10-11 06:58:11,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11" (1/1) ... [2024-10-11 06:58:11,796 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11" (1/1) ... [2024-10-11 06:58:11,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11" (1/1) ... [2024-10-11 06:58:11,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11" (1/1) ... [2024-10-11 06:58:11,808 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11" (1/1) ... [2024-10-11 06:58:11,811 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:58:11,813 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:58:11,813 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:58:11,813 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:58:11,814 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11" (1/1) ... [2024-10-11 06:58:11,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:58:11,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:58:11,853 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 06:58:11,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 06:58:11,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:58:11,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 06:58:11,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:58:11,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:58:12,012 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:58:12,015 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:58:12,221 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-11 06:58:12,221 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:58:12,279 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:58:12,279 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:58:12,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:58:12 BoogieIcfgContainer [2024-10-11 06:58:12,280 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:58:12,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:58:12,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:58:12,285 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:58:12,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:58:11" (1/3) ... [2024-10-11 06:58:12,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19634c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:58:12, skipping insertion in model container [2024-10-11 06:58:12,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11" (2/3) ... [2024-10-11 06:58:12,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19634c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:58:12, skipping insertion in model container [2024-10-11 06:58:12,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:58:12" (3/3) ... [2024-10-11 06:58:12,290 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.twocount32.c [2024-10-11 06:58:12,309 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:58:12,309 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:58:12,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:58:12,368 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;@479ebf40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:58:12,369 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:58:12,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:58:12,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 06:58:12,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:58:12,381 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 06:58:12,382 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:58:12,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:58:12,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-11 06:58:12,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:58:12,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308293356] [2024-10-11 06:58:12,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:58:12,422 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:58:12,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:58:12,426 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 06:58:12,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 06:58:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:58:12,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 06:58:12,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:58:12,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:58:12,731 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 06:58:12,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 06:58:12,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308293356] [2024-10-11 06:58:12,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308293356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:58:12,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:58:12,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 06:58:12,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020630000] [2024-10-11 06:58:12,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:58:12,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:58:12,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 06:58:12,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:58:12,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:58:12,782 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:58:12,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:58:12,863 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-11 06:58:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:58:12,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 06:58:12,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:58:12,876 INFO L225 Difference]: With dead ends: 15 [2024-10-11 06:58:12,876 INFO L226 Difference]: Without dead ends: 9 [2024-10-11 06:58:12,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:58:12,885 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:58:12,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:58:12,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-11 06:58:12,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-11 06:58:12,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:58:12,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-11 06:58:12,918 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-11 06:58:12,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:58:12,919 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-11 06:58:12,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:58:12,920 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-11 06:58:12,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 06:58:12,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:58:12,921 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 06:58:12,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 06:58:13,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:58:13,124 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:58:13,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:58:13,125 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-11 06:58:13,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:58:13,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230964900] [2024-10-11 06:58:13,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:58:13,128 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:58:13,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:58:13,132 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 06:58:13,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 06:58:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:58:13,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 06:58:13,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:58:13,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:58:13,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 06:58:14,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:58:14,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 06:58:14,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1230964900] [2024-10-11 06:58:14,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1230964900] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 06:58:14,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 06:58:14,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-11 06:58:14,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418797684] [2024-10-11 06:58:14,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 06:58:14,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 06:58:15,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 06:58:15,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 06:58:15,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:58:15,001 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:58:16,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:58:16,068 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2024-10-11 06:58:16,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 06:58:16,069 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 06:58:16,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:58:16,070 INFO L225 Difference]: With dead ends: 17 [2024-10-11 06:58:16,070 INFO L226 Difference]: Without dead ends: 15 [2024-10-11 06:58:16,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-10-11 06:58:16,071 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 06:58:16,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 9 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 06:58:16,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-11 06:58:16,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-10-11 06:58:16,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:58:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-11 06:58:16,076 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2024-10-11 06:58:16,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:58:16,077 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-11 06:58:16,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:58:16,077 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-11 06:58:16,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 06:58:16,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:58:16,078 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2024-10-11 06:58:16,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 06:58:16,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:58:16,282 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:58:16,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:58:16,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1748931734, now seen corresponding path program 2 times [2024-10-11 06:58:16,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:58:16,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824828133] [2024-10-11 06:58:16,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 06:58:16,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:58:16,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:58:16,287 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 06:58:16,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 06:58:16,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 06:58:16,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 06:58:16,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 06:58:16,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:58:20,369 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:58:20,369 INFO L311 TraceCheckSpWp]: Computing backward predicates...