./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.cav14_example_v.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fb8ca5e5ce2ed40fdd0ad3d69b0bd96c83a6daf11d842e9766da8dc50e36012a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 06:04:21,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 06:04:21,518 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-14 06:04:21,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 06:04:21,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 06:04:21,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 06:04:21,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 06:04:21,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 06:04:21,552 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 06:04:21,552 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 06:04:21,553 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 06:04:21,553 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 06:04:21,554 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 06:04:21,556 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 06:04:21,556 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 06:04:21,557 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 06:04:21,557 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 06:04:21,557 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 06:04:21,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 06:04:21,558 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 06:04:21,558 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 06:04:21,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 06:04:21,563 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 06:04:21,563 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 06:04:21,563 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 06:04:21,564 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 06:04:21,564 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 06:04:21,564 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 06:04:21,564 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 06:04:21,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:04:21,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 06:04:21,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 06:04:21,565 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 06:04:21,565 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 06:04:21,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 06:04:21,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 06:04:21,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 06:04:21,566 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 06:04:21,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 06:04:21,567 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fb8ca5e5ce2ed40fdd0ad3d69b0bd96c83a6daf11d842e9766da8dc50e36012a [2024-10-14 06:04:21,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 06:04:21,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 06:04:21,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 06:04:21,937 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 06:04:21,938 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 06:04:21,939 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c [2024-10-14 06:04:23,503 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 06:04:23,760 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 06:04:23,760 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c [2024-10-14 06:04:23,770 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a02783c9a/59ac1c3e0bf54beebbab0526e786c32c/FLAGb2ba20dde [2024-10-14 06:04:23,786 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a02783c9a/59ac1c3e0bf54beebbab0526e786c32c [2024-10-14 06:04:23,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 06:04:23,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 06:04:23,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 06:04:23,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 06:04:23,801 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 06:04:23,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:04:23" (1/1) ... [2024-10-14 06:04:23,804 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2796eb27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:23, skipping insertion in model container [2024-10-14 06:04:23,804 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:04:23" (1/1) ... [2024-10-14 06:04:23,832 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 06:04:23,995 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.cav14_example_v.c[1255,1268] [2024-10-14 06:04:24,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:04:24,094 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 06:04:24,108 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.cav14_example_v.c[1255,1268] [2024-10-14 06:04:24,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:04:24,179 INFO L204 MainTranslator]: Completed translation [2024-10-14 06:04:24,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:24 WrapperNode [2024-10-14 06:04:24,180 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 06:04:24,181 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 06:04:24,182 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 06:04:24,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 06:04:24,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:24" (1/1) ... [2024-10-14 06:04:24,202 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:24" (1/1) ... [2024-10-14 06:04:24,258 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 188 [2024-10-14 06:04:24,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 06:04:24,260 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 06:04:24,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 06:04:24,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 06:04:24,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:24" (1/1) ... [2024-10-14 06:04:24,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:24" (1/1) ... [2024-10-14 06:04:24,295 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:24" (1/1) ... [2024-10-14 06:04:24,326 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 06:04:24,327 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:24" (1/1) ... [2024-10-14 06:04:24,327 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:24" (1/1) ... [2024-10-14 06:04:24,347 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:24" (1/1) ... [2024-10-14 06:04:24,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:24" (1/1) ... [2024-10-14 06:04:24,359 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:24" (1/1) ... [2024-10-14 06:04:24,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:24" (1/1) ... [2024-10-14 06:04:24,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 06:04:24,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 06:04:24,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 06:04:24,374 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 06:04:24,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:24" (1/1) ... [2024-10-14 06:04:24,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:04:24,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:04:24,415 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 06:04:24,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 06:04:24,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 06:04:24,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 06:04:24,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 06:04:24,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 06:04:24,554 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 06:04:24,556 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 06:04:25,000 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-10-14 06:04:25,001 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 06:04:25,035 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 06:04:25,036 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 06:04:25,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:04:25 BoogieIcfgContainer [2024-10-14 06:04:25,037 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 06:04:25,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 06:04:25,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 06:04:25,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 06:04:25,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:04:23" (1/3) ... [2024-10-14 06:04:25,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa20c3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:04:25, skipping insertion in model container [2024-10-14 06:04:25,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:04:24" (2/3) ... [2024-10-14 06:04:25,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa20c3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:04:25, skipping insertion in model container [2024-10-14 06:04:25,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:04:25" (3/3) ... [2024-10-14 06:04:25,050 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cav14_example_v.c [2024-10-14 06:04:25,068 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 06:04:25,069 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 06:04:25,133 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 06:04:25,140 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;@286e619, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 06:04:25,140 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 06:04:25,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 45 states have (on average 1.511111111111111) internal successors, (68), 46 states have internal predecessors, (68), 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-14 06:04:25,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 06:04:25,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:04:25,157 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:04:25,159 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:04:25,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:04:25,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1952044744, now seen corresponding path program 1 times [2024-10-14 06:04:25,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:04:25,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848788517] [2024-10-14 06:04:25,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:04:25,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:04:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:04:25,751 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-14 06:04:25,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:04:25,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848788517] [2024-10-14 06:04:25,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848788517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:04:25,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:04:25,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:04:25,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20605372] [2024-10-14 06:04:25,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:04:25,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:04:25,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:04:25,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:04:25,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:04:25,789 INFO L87 Difference]: Start difference. First operand has 47 states, 45 states have (on average 1.511111111111111) internal successors, (68), 46 states have internal predecessors, (68), 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.0) internal successors, (12), 4 states have internal predecessors, (12), 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-14 06:04:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:04:25,840 INFO L93 Difference]: Finished difference Result 86 states and 126 transitions. [2024-10-14 06:04:25,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:04:25,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2024-10-14 06:04:25,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:04:25,854 INFO L225 Difference]: With dead ends: 86 [2024-10-14 06:04:25,854 INFO L226 Difference]: Without dead ends: 48 [2024-10-14 06:04:25,857 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-14 06:04:25,863 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 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-14 06:04:25,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:04:25,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-14 06:04:25,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-14 06:04:25,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.446808510638298) internal successors, (68), 47 states have internal predecessors, (68), 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-14 06:04:25,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2024-10-14 06:04:25,905 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 12 [2024-10-14 06:04:25,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:04:25,907 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2024-10-14 06:04:25,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-14 06:04:25,907 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2024-10-14 06:04:25,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 06:04:25,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:04:25,908 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:04:25,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 06:04:25,908 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:04:25,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:04:25,909 INFO L85 PathProgramCache]: Analyzing trace with hash 385540125, now seen corresponding path program 1 times [2024-10-14 06:04:25,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:04:25,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194341330] [2024-10-14 06:04:25,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:04:25,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:04:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:04:26,086 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-14 06:04:26,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:04:26,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194341330] [2024-10-14 06:04:26,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194341330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:04:26,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:04:26,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:04:26,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986514403] [2024-10-14 06:04:26,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:04:26,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:04:26,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:04:26,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:04:26,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:04:26,095 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-14 06:04:26,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:04:26,133 INFO L93 Difference]: Finished difference Result 89 states and 126 transitions. [2024-10-14 06:04:26,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:04:26,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 13 [2024-10-14 06:04:26,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:04:26,134 INFO L225 Difference]: With dead ends: 89 [2024-10-14 06:04:26,135 INFO L226 Difference]: Without dead ends: 50 [2024-10-14 06:04:26,135 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-14 06:04:26,136 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 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-14 06:04:26,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:04:26,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-14 06:04:26,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-14 06:04:26,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 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-14 06:04:26,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2024-10-14 06:04:26,148 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 13 [2024-10-14 06:04:26,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:04:26,148 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2024-10-14 06:04:26,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-14 06:04:26,148 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2024-10-14 06:04:26,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 06:04:26,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:04:26,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:04:26,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 06:04:26,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:04:26,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:04:26,153 INFO L85 PathProgramCache]: Analyzing trace with hash -2031123903, now seen corresponding path program 1 times [2024-10-14 06:04:26,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:04:26,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238165714] [2024-10-14 06:04:26,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:04:26,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:04:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:04:26,500 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-14 06:04:26,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:04:26,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238165714] [2024-10-14 06:04:26,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238165714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:04:26,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:04:26,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:04:26,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853411324] [2024-10-14 06:04:26,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:04:26,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:04:26,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:04:26,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:04:26,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:04:26,507 INFO L87 Difference]: Start difference. First operand 50 states and 70 transitions. Second operand has 5 states, 5 states have (on average 2.8) 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-14 06:04:26,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:04:26,622 INFO L93 Difference]: Finished difference Result 118 states and 165 transitions. [2024-10-14 06:04:26,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 06:04:26,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) 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-14 06:04:26,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:04:26,626 INFO L225 Difference]: With dead ends: 118 [2024-10-14 06:04:26,626 INFO L226 Difference]: Without dead ends: 77 [2024-10-14 06:04:26,627 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-14 06:04:26,628 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 44 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:04:26,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 216 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:04:26,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-14 06:04:26,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 52. [2024-10-14 06:04:26,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 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-14 06:04:26,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 72 transitions. [2024-10-14 06:04:26,638 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 72 transitions. Word has length 14 [2024-10-14 06:04:26,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:04:26,638 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 72 transitions. [2024-10-14 06:04:26,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) 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-14 06:04:26,638 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2024-10-14 06:04:26,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 06:04:26,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:04:26,640 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:04:26,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 06:04:26,640 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:04:26,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:04:26,641 INFO L85 PathProgramCache]: Analyzing trace with hash -849728661, now seen corresponding path program 1 times [2024-10-14 06:04:26,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:04:26,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027493217] [2024-10-14 06:04:26,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:04:26,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:04:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:04:27,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:04:27,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:04:27,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027493217] [2024-10-14 06:04:27,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027493217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:04:27,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:04:27,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 06:04:27,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494244504] [2024-10-14 06:04:27,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:04:27,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 06:04:27,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:04:27,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 06:04:27,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 06:04:27,411 INFO L87 Difference]: Start difference. First operand 52 states and 72 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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-14 06:04:27,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:04:27,581 INFO L93 Difference]: Finished difference Result 143 states and 200 transitions. [2024-10-14 06:04:27,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 06:04:27,582 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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-14 06:04:27,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:04:27,584 INFO L225 Difference]: With dead ends: 143 [2024-10-14 06:04:27,584 INFO L226 Difference]: Without dead ends: 102 [2024-10-14 06:04:27,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-14 06:04:27,585 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 60 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:04:27,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 513 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:04:27,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-14 06:04:27,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 63. [2024-10-14 06:04:27,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 62 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-14 06:04:27,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2024-10-14 06:04:27,601 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 33 [2024-10-14 06:04:27,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:04:27,601 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2024-10-14 06:04:27,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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-14 06:04:27,601 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2024-10-14 06:04:27,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 06:04:27,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:04:27,604 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:04:27,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 06:04:27,604 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:04:27,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:04:27,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1621245414, now seen corresponding path program 1 times [2024-10-14 06:04:27,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:04:27,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069270835] [2024-10-14 06:04:27,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:04:27,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:04:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:04:28,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:04:28,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:04:28,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069270835] [2024-10-14 06:04:28,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069270835] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 06:04:28,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173704690] [2024-10-14 06:04:28,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:04:28,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:04:28,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:04:28,113 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 06:04:28,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 06:04:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:04:28,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-14 06:04:28,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:04:28,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:04:28,673 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 06:04:28,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173704690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:04:28,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 06:04:28,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2024-10-14 06:04:28,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598388196] [2024-10-14 06:04:28,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:04:28,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 06:04:28,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:04:28,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 06:04:28,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-14 06:04:28,676 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 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-14 06:04:28,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:04:28,882 INFO L93 Difference]: Finished difference Result 159 states and 223 transitions. [2024-10-14 06:04:28,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 06:04:28,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 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 34 [2024-10-14 06:04:28,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:04:28,886 INFO L225 Difference]: With dead ends: 159 [2024-10-14 06:04:28,886 INFO L226 Difference]: Without dead ends: 105 [2024-10-14 06:04:28,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-10-14 06:04:28,888 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 117 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:04:28,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 195 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:04:28,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-14 06:04:28,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2024-10-14 06:04:28,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 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-14 06:04:28,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 126 transitions. [2024-10-14 06:04:28,898 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 126 transitions. Word has length 34 [2024-10-14 06:04:28,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:04:28,899 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 126 transitions. [2024-10-14 06:04:28,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 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-14 06:04:28,899 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 126 transitions. [2024-10-14 06:04:28,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-14 06:04:28,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:04:28,901 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:04:28,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 06:04:29,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:04:29,106 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:04:29,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:04:29,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1993897390, now seen corresponding path program 1 times [2024-10-14 06:04:29,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:04:29,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759266534] [2024-10-14 06:04:29,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:04:29,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:04:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:04:29,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:04:29,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:04:29,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759266534] [2024-10-14 06:04:29,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759266534] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 06:04:29,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747809053] [2024-10-14 06:04:29,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:04:29,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:04:29,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:04:29,677 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 06:04:29,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 06:04:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:04:29,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-14 06:04:29,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:04:29,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:04:29,996 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 06:04:29,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747809053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:04:29,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 06:04:29,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2024-10-14 06:04:29,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856975706] [2024-10-14 06:04:29,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:04:29,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 06:04:29,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:04:29,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 06:04:29,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-14 06:04:29,999 INFO L87 Difference]: Start difference. First operand 93 states and 126 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 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-14 06:04:30,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:04:30,174 INFO L93 Difference]: Finished difference Result 182 states and 248 transitions. [2024-10-14 06:04:30,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 06:04:30,175 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 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-14 06:04:30,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:04:30,176 INFO L225 Difference]: With dead ends: 182 [2024-10-14 06:04:30,176 INFO L226 Difference]: Without dead ends: 108 [2024-10-14 06:04:30,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-10-14 06:04:30,178 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 128 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:04:30,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 194 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:04:30,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-14 06:04:30,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2024-10-14 06:04:30,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.3473684210526315) internal successors, (128), 95 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-14 06:04:30,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 128 transitions. [2024-10-14 06:04:30,185 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 128 transitions. Word has length 35 [2024-10-14 06:04:30,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:04:30,186 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 128 transitions. [2024-10-14 06:04:30,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 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-14 06:04:30,186 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 128 transitions. [2024-10-14 06:04:30,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 06:04:30,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:04:30,187 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:04:30,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 06:04:30,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 06:04:30,389 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:04:30,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:04:30,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1235051301, now seen corresponding path program 1 times [2024-10-14 06:04:30,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:04:30,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770151339] [2024-10-14 06:04:30,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:04:30,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:04:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:04:31,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:04:31,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:04:31,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770151339] [2024-10-14 06:04:31,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770151339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:04:31,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:04:31,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:04:31,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533322846] [2024-10-14 06:04:31,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:04:31,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 06:04:31,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:04:31,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 06:04:31,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 06:04:31,168 INFO L87 Difference]: Start difference. First operand 96 states and 128 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 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-14 06:04:31,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:04:31,267 INFO L93 Difference]: Finished difference Result 166 states and 226 transitions. [2024-10-14 06:04:31,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 06:04:31,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 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-14 06:04:31,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:04:31,270 INFO L225 Difference]: With dead ends: 166 [2024-10-14 06:04:31,270 INFO L226 Difference]: Without dead ends: 112 [2024-10-14 06:04:31,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 06:04:31,271 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 31 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:04:31,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 169 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:04:31,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-14 06:04:31,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-10-14 06:04:31,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.3545454545454545) internal successors, (149), 110 states have internal predecessors, (149), 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-14 06:04:31,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 149 transitions. [2024-10-14 06:04:31,287 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 149 transitions. Word has length 36 [2024-10-14 06:04:31,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:04:31,287 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 149 transitions. [2024-10-14 06:04:31,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 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-14 06:04:31,291 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 149 transitions. [2024-10-14 06:04:31,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 06:04:31,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:04:31,292 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:04:31,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 06:04:31,292 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:04:31,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:04:31,293 INFO L85 PathProgramCache]: Analyzing trace with hash 772222476, now seen corresponding path program 1 times [2024-10-14 06:04:31,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:04:31,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824403538] [2024-10-14 06:04:31,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:04:31,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:04:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:04:32,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:04:32,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:04:32,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824403538] [2024-10-14 06:04:32,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824403538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:04:32,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:04:32,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 06:04:32,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641799928] [2024-10-14 06:04:32,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:04:32,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 06:04:32,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:04:32,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 06:04:32,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 06:04:32,037 INFO L87 Difference]: Start difference. First operand 111 states and 149 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-14 06:04:32,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:04:32,257 INFO L93 Difference]: Finished difference Result 184 states and 249 transitions. [2024-10-14 06:04:32,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 06:04:32,258 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-14 06:04:32,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:04:32,259 INFO L225 Difference]: With dead ends: 184 [2024-10-14 06:04:32,259 INFO L226 Difference]: Without dead ends: 114 [2024-10-14 06:04:32,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-14 06:04:32,260 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 44 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:04:32,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 210 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:04:32,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-14 06:04:32,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-10-14 06:04:32,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.3482142857142858) internal successors, (151), 112 states have internal predecessors, (151), 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-14 06:04:32,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 151 transitions. [2024-10-14 06:04:32,278 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 151 transitions. Word has length 36 [2024-10-14 06:04:32,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:04:32,278 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 151 transitions. [2024-10-14 06:04:32,278 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-14 06:04:32,278 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 151 transitions. [2024-10-14 06:04:32,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 06:04:32,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:04:32,280 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:04:32,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 06:04:32,280 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:04:32,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:04:32,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1781504483, now seen corresponding path program 1 times [2024-10-14 06:04:32,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:04:32,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921780183] [2024-10-14 06:04:32,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:04:32,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:04:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:04:32,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:04:32,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:04:32,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921780183] [2024-10-14 06:04:32,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921780183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:04:32,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:04:32,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 06:04:32,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955930740] [2024-10-14 06:04:32,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:04:32,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 06:04:32,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:04:32,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 06:04:32,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 06:04:32,807 INFO L87 Difference]: Start difference. First operand 113 states and 151 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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-14 06:04:32,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:04:32,913 INFO L93 Difference]: Finished difference Result 207 states and 282 transitions. [2024-10-14 06:04:32,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 06:04:32,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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-14 06:04:32,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:04:32,915 INFO L225 Difference]: With dead ends: 207 [2024-10-14 06:04:32,915 INFO L226 Difference]: Without dead ends: 153 [2024-10-14 06:04:32,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-14 06:04:32,916 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 58 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:04:32,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 438 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:04:32,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-14 06:04:32,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 116. [2024-10-14 06:04:32,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.3478260869565217) internal successors, (155), 115 states have internal predecessors, (155), 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-14 06:04:32,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 155 transitions. [2024-10-14 06:04:32,927 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 155 transitions. Word has length 37 [2024-10-14 06:04:32,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:04:32,928 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 155 transitions. [2024-10-14 06:04:32,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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-14 06:04:32,928 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 155 transitions. [2024-10-14 06:04:32,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 06:04:32,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:04:32,930 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:04:32,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 06:04:32,932 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:04:32,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:04:32,932 INFO L85 PathProgramCache]: Analyzing trace with hash 152508028, now seen corresponding path program 1 times [2024-10-14 06:04:32,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:04:32,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025207194] [2024-10-14 06:04:32,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:04:32,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:04:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:04:33,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:04:33,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:04:33,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025207194] [2024-10-14 06:04:33,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025207194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:04:33,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:04:33,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:04:33,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6213986] [2024-10-14 06:04:33,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:04:33,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:04:33,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:04:33,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:04:33,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:04:33,326 INFO L87 Difference]: Start difference. First operand 116 states and 155 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 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-14 06:04:33,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:04:33,376 INFO L93 Difference]: Finished difference Result 188 states and 253 transitions. [2024-10-14 06:04:33,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 06:04:33,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 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-14 06:04:33,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:04:33,378 INFO L225 Difference]: With dead ends: 188 [2024-10-14 06:04:33,378 INFO L226 Difference]: Without dead ends: 92 [2024-10-14 06:04:33,378 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-14 06:04:33,379 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 26 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:04:33,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 217 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:04:33,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-14 06:04:33,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-14 06:04:33,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 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-14 06:04:33,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2024-10-14 06:04:33,390 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 122 transitions. Word has length 37 [2024-10-14 06:04:33,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:04:33,390 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 122 transitions. [2024-10-14 06:04:33,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 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-14 06:04:33,392 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 122 transitions. [2024-10-14 06:04:33,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 06:04:33,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:04:33,393 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1] [2024-10-14 06:04:33,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 06:04:33,394 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:04:33,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:04:33,397 INFO L85 PathProgramCache]: Analyzing trace with hash -201556252, now seen corresponding path program 1 times [2024-10-14 06:04:33,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:04:33,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952664681] [2024-10-14 06:04:33,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:04:33,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:04:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:04:34,054 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:04:34,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:04:34,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952664681] [2024-10-14 06:04:34,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952664681] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 06:04:34,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278023911] [2024-10-14 06:04:34,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:04:34,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:04:34,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:04:34,057 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 06:04:34,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 06:04:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:04:34,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-10-14 06:04:34,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:04:34,748 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:04:34,751 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 06:04:35,278 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:04:35,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278023911] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 06:04:35,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 06:04:35,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 27 [2024-10-14 06:04:35,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204384656] [2024-10-14 06:04:35,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 06:04:35,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-14 06:04:35,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:04:35,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-14 06:04:35,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2024-10-14 06:04:35,282 INFO L87 Difference]: Start difference. First operand 92 states and 122 transitions. Second operand has 28 states, 28 states have (on average 5.178571428571429) internal successors, (145), 27 states have internal predecessors, (145), 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-14 06:04:36,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:04:36,224 INFO L93 Difference]: Finished difference Result 201 states and 273 transitions. [2024-10-14 06:04:36,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 06:04:36,225 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.178571428571429) internal successors, (145), 27 states have internal predecessors, (145), 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 55 [2024-10-14 06:04:36,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:04:36,227 INFO L225 Difference]: With dead ends: 201 [2024-10-14 06:04:36,228 INFO L226 Difference]: Without dead ends: 145 [2024-10-14 06:04:36,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=356, Invalid=1806, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 06:04:36,229 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 335 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 06:04:36,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 258 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 06:04:36,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-14 06:04:36,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 116. [2024-10-14 06:04:36,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.3217391304347825) internal successors, (152), 115 states have internal predecessors, (152), 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-14 06:04:36,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 152 transitions. [2024-10-14 06:04:36,242 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 152 transitions. Word has length 55 [2024-10-14 06:04:36,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:04:36,242 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 152 transitions. [2024-10-14 06:04:36,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.178571428571429) internal successors, (145), 27 states have internal predecessors, (145), 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-14 06:04:36,243 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 152 transitions. [2024-10-14 06:04:36,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 06:04:36,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:04:36,244 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 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-14 06:04:36,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 06:04:36,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:04:36,446 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:04:36,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:04:36,446 INFO L85 PathProgramCache]: Analyzing trace with hash -842752749, now seen corresponding path program 1 times [2024-10-14 06:04:36,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:04:36,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408431093] [2024-10-14 06:04:36,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:04:36,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:04:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:04:37,230 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-14 06:04:37,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:04:37,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408431093] [2024-10-14 06:04:37,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408431093] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 06:04:37,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620766104] [2024-10-14 06:04:37,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:04:37,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:04:37,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:04:37,233 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 06:04:37,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 06:04:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:04:37,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-10-14 06:04:37,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:04:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:04:38,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 06:04:39,620 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-14 06:04:39,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620766104] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 06:04:39,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 06:04:39,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 19] total 36 [2024-10-14 06:04:39,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748824095] [2024-10-14 06:04:39,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 06:04:39,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-14 06:04:39,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:04:39,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-14 06:04:39,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1155, Unknown=0, NotChecked=0, Total=1332 [2024-10-14 06:04:39,626 INFO L87 Difference]: Start difference. First operand 116 states and 152 transitions. Second operand has 37 states, 37 states have (on average 4.135135135135135) internal successors, (153), 36 states have internal predecessors, (153), 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-14 06:04:41,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:04:41,819 INFO L93 Difference]: Finished difference Result 271 states and 362 transitions. [2024-10-14 06:04:41,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-14 06:04:41,819 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 4.135135135135135) internal successors, (153), 36 states have internal predecessors, (153), 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 56 [2024-10-14 06:04:41,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:04:41,820 INFO L225 Difference]: With dead ends: 271 [2024-10-14 06:04:41,821 INFO L226 Difference]: Without dead ends: 157 [2024-10-14 06:04:41,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=741, Invalid=5111, Unknown=0, NotChecked=0, Total=5852 [2024-10-14 06:04:41,823 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 483 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 06:04:41,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 689 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 06:04:41,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-14 06:04:41,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 137. [2024-10-14 06:04:41,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.3161764705882353) internal successors, (179), 136 states have internal predecessors, (179), 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-14 06:04:41,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 179 transitions. [2024-10-14 06:04:41,829 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 179 transitions. Word has length 56 [2024-10-14 06:04:41,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:04:41,830 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 179 transitions. [2024-10-14 06:04:41,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.135135135135135) internal successors, (153), 36 states have internal predecessors, (153), 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-14 06:04:41,830 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 179 transitions. [2024-10-14 06:04:41,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 06:04:41,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:04:41,831 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:04:41,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 06:04:42,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:04:42,036 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:04:42,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:04:42,036 INFO L85 PathProgramCache]: Analyzing trace with hash -497349561, now seen corresponding path program 1 times [2024-10-14 06:04:42,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:04:42,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799076303] [2024-10-14 06:04:42,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:04:42,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:04:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:04:43,577 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:04:43,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:04:43,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799076303] [2024-10-14 06:04:43,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799076303] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 06:04:43,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923244572] [2024-10-14 06:04:43,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:04:43,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:04:43,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:04:43,581 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 06:04:43,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 06:04:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:04:43,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 130 conjuncts are in the unsatisfiable core [2024-10-14 06:04:43,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:04:44,777 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:04:44,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 06:04:49,408 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:04:49,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923244572] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 06:04:49,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 06:04:49,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 24] total 49 [2024-10-14 06:04:49,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125591026] [2024-10-14 06:04:49,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 06:04:49,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 06:04:49,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:04:49,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 06:04:49,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2222, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 06:04:49,412 INFO L87 Difference]: Start difference. First operand 137 states and 179 transitions. Second operand has 50 states, 50 states have (on average 2.98) internal successors, (149), 49 states have internal predecessors, (149), 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-14 06:04:53,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:04:53,050 INFO L93 Difference]: Finished difference Result 473 states and 633 transitions. [2024-10-14 06:04:53,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-14 06:04:53,051 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.98) internal successors, (149), 49 states have internal predecessors, (149), 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-14 06:04:53,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:04:53,052 INFO L225 Difference]: With dead ends: 473 [2024-10-14 06:04:53,053 INFO L226 Difference]: Without dead ends: 374 [2024-10-14 06:04:53,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=703, Invalid=6779, Unknown=0, NotChecked=0, Total=7482 [2024-10-14 06:04:53,058 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 927 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 06:04:53,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 948 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 06:04:53,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-14 06:04:53,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 274. [2024-10-14 06:04:53,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 1.3333333333333333) internal successors, (364), 273 states have internal predecessors, (364), 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-14 06:04:53,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 364 transitions. [2024-10-14 06:04:53,069 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 364 transitions. Word has length 57 [2024-10-14 06:04:53,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:04:53,071 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 364 transitions. [2024-10-14 06:04:53,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.98) internal successors, (149), 49 states have internal predecessors, (149), 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-14 06:04:53,072 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 364 transitions. [2024-10-14 06:04:53,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 06:04:53,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:04:53,073 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2024-10-14 06:04:53,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 06:04:53,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-14 06:04:53,274 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:04:53,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:04:53,275 INFO L85 PathProgramCache]: Analyzing trace with hash 308681452, now seen corresponding path program 1 times [2024-10-14 06:04:53,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:04:53,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161967415] [2024-10-14 06:04:53,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:04:53,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:04:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:04:53,788 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 06:04:53,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:04:53,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161967415] [2024-10-14 06:04:53,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161967415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:04:53,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:04:53,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:04:53,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765069107] [2024-10-14 06:04:53,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:04:53,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:04:53,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:04:53,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:04:53,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:04:53,790 INFO L87 Difference]: Start difference. First operand 274 states and 364 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 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-14 06:04:53,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:04:53,839 INFO L93 Difference]: Finished difference Result 377 states and 501 transitions. [2024-10-14 06:04:53,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 06:04:53,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 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 58 [2024-10-14 06:04:53,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:04:53,841 INFO L225 Difference]: With dead ends: 377 [2024-10-14 06:04:53,841 INFO L226 Difference]: Without dead ends: 130 [2024-10-14 06:04:53,842 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-14 06:04:53,842 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 13 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:04:53,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 217 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:04:53,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-14 06:04:53,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-14 06:04:53,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.302325581395349) internal successors, (168), 129 states have internal predecessors, (168), 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-14 06:04:53,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 168 transitions. [2024-10-14 06:04:53,848 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 168 transitions. Word has length 58 [2024-10-14 06:04:53,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:04:53,848 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 168 transitions. [2024-10-14 06:04:53,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 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-14 06:04:53,848 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 168 transitions. [2024-10-14 06:04:53,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 06:04:53,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:04:53,849 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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, 1] [2024-10-14 06:04:53,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 06:04:53,849 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:04:53,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:04:53,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1989214162, now seen corresponding path program 1 times [2024-10-14 06:04:53,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:04:53,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870493170] [2024-10-14 06:04:53,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:04:53,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:04:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:04:54,760 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:04:54,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:04:54,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870493170] [2024-10-14 06:04:54,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870493170] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 06:04:54,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464491874] [2024-10-14 06:04:54,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:04:54,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:04:54,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:04:54,763 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 06:04:54,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 06:04:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:04:55,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-10-14 06:04:55,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:04:55,636 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:04:55,636 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 06:04:56,603 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:04:56,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464491874] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 06:04:56,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 06:04:56,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 32 [2024-10-14 06:04:56,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491705314] [2024-10-14 06:04:56,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 06:04:56,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-14 06:04:56,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:04:56,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-14 06:04:56,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=903, Unknown=0, NotChecked=0, Total=1056 [2024-10-14 06:04:56,607 INFO L87 Difference]: Start difference. First operand 130 states and 168 transitions. Second operand has 33 states, 33 states have (on average 4.757575757575758) internal successors, (157), 32 states have internal predecessors, (157), 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-14 06:04:57,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:04:57,885 INFO L93 Difference]: Finished difference Result 410 states and 548 transitions. [2024-10-14 06:04:57,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-14 06:04:57,885 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.757575757575758) internal successors, (157), 32 states have internal predecessors, (157), 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 59 [2024-10-14 06:04:57,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:04:57,887 INFO L225 Difference]: With dead ends: 410 [2024-10-14 06:04:57,887 INFO L226 Difference]: Without dead ends: 311 [2024-10-14 06:04:57,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=560, Invalid=3346, Unknown=0, NotChecked=0, Total=3906 [2024-10-14 06:04:57,889 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 1217 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 06:04:57,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 468 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 06:04:57,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-14 06:04:57,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 233. [2024-10-14 06:04:57,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.3189655172413792) internal successors, (306), 232 states have internal predecessors, (306), 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-14 06:04:57,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 306 transitions. [2024-10-14 06:04:57,898 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 306 transitions. Word has length 59 [2024-10-14 06:04:57,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:04:57,898 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 306 transitions. [2024-10-14 06:04:57,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.757575757575758) internal successors, (157), 32 states have internal predecessors, (157), 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-14 06:04:57,898 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 306 transitions. [2024-10-14 06:04:57,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 06:04:57,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:04:57,899 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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, 1, 1] [2024-10-14 06:04:57,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-14 06:04:58,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 06:04:58,101 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:04:58,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:04:58,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1744636165, now seen corresponding path program 1 times [2024-10-14 06:04:58,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:04:58,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666628903] [2024-10-14 06:04:58,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:04:58,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:04:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:05:00,109 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:05:00,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:05:00,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666628903] [2024-10-14 06:05:00,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666628903] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 06:05:00,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477916891] [2024-10-14 06:05:00,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:05:00,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:05:00,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:05:00,117 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 06:05:00,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 06:05:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:05:00,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 139 conjuncts are in the unsatisfiable core [2024-10-14 06:05:00,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:05:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:05:01,546 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 06:05:05,545 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:05:05,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477916891] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 06:05:05,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 06:05:05,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 23] total 53 [2024-10-14 06:05:05,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862139094] [2024-10-14 06:05:05,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 06:05:05,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-10-14 06:05:05,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:05:05,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-10-14 06:05:05,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=2455, Unknown=0, NotChecked=0, Total=2862 [2024-10-14 06:05:05,549 INFO L87 Difference]: Start difference. First operand 233 states and 306 transitions. Second operand has 54 states, 54 states have (on average 3.0925925925925926) internal successors, (167), 53 states have internal predecessors, (167), 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-14 06:05:09,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:05:09,230 INFO L93 Difference]: Finished difference Result 581 states and 783 transitions. [2024-10-14 06:05:09,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-14 06:05:09,231 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 3.0925925925925926) internal successors, (167), 53 states have internal predecessors, (167), 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 60 [2024-10-14 06:05:09,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:05:09,233 INFO L225 Difference]: With dead ends: 581 [2024-10-14 06:05:09,233 INFO L226 Difference]: Without dead ends: 379 [2024-10-14 06:05:09,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2719 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1422, Invalid=8084, Unknown=0, NotChecked=0, Total=9506 [2024-10-14 06:05:09,238 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 401 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 2130 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 2166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 06:05:09,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 718 Invalid, 2166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2130 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 06:05:09,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-10-14 06:05:09,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 313. [2024-10-14 06:05:09,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 1.3333333333333333) internal successors, (416), 312 states have internal predecessors, (416), 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-14 06:05:09,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 416 transitions. [2024-10-14 06:05:09,252 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 416 transitions. Word has length 60 [2024-10-14 06:05:09,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:05:09,252 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 416 transitions. [2024-10-14 06:05:09,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 3.0925925925925926) internal successors, (167), 53 states have internal predecessors, (167), 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-14 06:05:09,253 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 416 transitions. [2024-10-14 06:05:09,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 06:05:09,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:05:09,254 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:05:09,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 06:05:09,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:05:09,455 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:05:09,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:05:09,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1114659974, now seen corresponding path program 1 times [2024-10-14 06:05:09,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:05:09,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833040192] [2024-10-14 06:05:09,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:05:09,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:05:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:05:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:05:10,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:05:10,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833040192] [2024-10-14 06:05:10,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833040192] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 06:05:10,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800543153] [2024-10-14 06:05:10,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:05:10,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 06:05:10,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:05:10,313 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 06:05:10,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 06:05:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:05:10,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-14 06:05:10,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:05:10,788 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:05:10,788 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 06:05:10,855 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 06:05:10,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800543153] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 06:05:10,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-14 06:05:10,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10, 7] total 18 [2024-10-14 06:05:10,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736854310] [2024-10-14 06:05:10,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:05:10,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:05:10,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:05:10,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:05:10,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-10-14 06:05:10,858 INFO L87 Difference]: Start difference. First operand 313 states and 416 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-14 06:05:10,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:05:10,877 INFO L93 Difference]: Finished difference Result 532 states and 711 transitions. [2024-10-14 06:05:10,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:05:10,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 61 [2024-10-14 06:05:10,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:05:10,879 INFO L225 Difference]: With dead ends: 532 [2024-10-14 06:05:10,879 INFO L226 Difference]: Without dead ends: 247 [2024-10-14 06:05:10,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-10-14 06:05:10,881 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 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-14 06:05:10,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:05:10,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-14 06:05:10,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2024-10-14 06:05:10,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.3008130081300813) internal successors, (320), 246 states have internal predecessors, (320), 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-14 06:05:10,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 320 transitions. [2024-10-14 06:05:10,900 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 320 transitions. Word has length 61 [2024-10-14 06:05:10,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:05:10,900 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 320 transitions. [2024-10-14 06:05:10,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-14 06:05:10,901 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 320 transitions. [2024-10-14 06:05:10,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 06:05:10,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:05:10,903 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:05:10,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-14 06:05:11,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-14 06:05:11,104 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:05:11,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:05:11,105 INFO L85 PathProgramCache]: Analyzing trace with hash -67499317, now seen corresponding path program 1 times [2024-10-14 06:05:11,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:05:11,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3096107] [2024-10-14 06:05:11,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:05:11,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:05:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:05:11,622 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 06:05:11,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:05:11,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3096107] [2024-10-14 06:05:11,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3096107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:05:11,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:05:11,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 06:05:11,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179899525] [2024-10-14 06:05:11,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:05:11,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 06:05:11,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:05:11,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 06:05:11,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 06:05:11,624 INFO L87 Difference]: Start difference. First operand 247 states and 320 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-14 06:05:11,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:05:11,761 INFO L93 Difference]: Finished difference Result 550 states and 724 transitions. [2024-10-14 06:05:11,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 06:05:11,762 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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 61 [2024-10-14 06:05:11,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:05:11,764 INFO L225 Difference]: With dead ends: 550 [2024-10-14 06:05:11,764 INFO L226 Difference]: Without dead ends: 334 [2024-10-14 06:05:11,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-14 06:05:11,765 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 43 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:05:11,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 536 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:05:11,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-10-14 06:05:11,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 275. [2024-10-14 06:05:11,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 1.2992700729927007) internal successors, (356), 274 states have internal predecessors, (356), 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-14 06:05:11,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 356 transitions. [2024-10-14 06:05:11,776 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 356 transitions. Word has length 61 [2024-10-14 06:05:11,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:05:11,776 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 356 transitions. [2024-10-14 06:05:11,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-14 06:05:11,776 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 356 transitions. [2024-10-14 06:05:11,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 06:05:11,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:05:11,777 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:05:11,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 06:05:11,777 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:05:11,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:05:11,778 INFO L85 PathProgramCache]: Analyzing trace with hash -742401945, now seen corresponding path program 1 times [2024-10-14 06:05:11,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:05:11,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659664554] [2024-10-14 06:05:11,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:05:11,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:05:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:05:12,323 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-14 06:05:12,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:05:12,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659664554] [2024-10-14 06:05:12,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659664554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:05:12,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:05:12,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 06:05:12,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339310491] [2024-10-14 06:05:12,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:05:12,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 06:05:12,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:05:12,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 06:05:12,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 06:05:12,330 INFO L87 Difference]: Start difference. First operand 275 states and 356 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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-14 06:05:12,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:05:12,416 INFO L93 Difference]: Finished difference Result 531 states and 697 transitions. [2024-10-14 06:05:12,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 06:05:12,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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 61 [2024-10-14 06:05:12,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:05:12,418 INFO L225 Difference]: With dead ends: 531 [2024-10-14 06:05:12,418 INFO L226 Difference]: Without dead ends: 287 [2024-10-14 06:05:12,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-14 06:05:12,419 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 46 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:05:12,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 354 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:05:12,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-10-14 06:05:12,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 255. [2024-10-14 06:05:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.295275590551181) internal successors, (329), 254 states have internal predecessors, (329), 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-14 06:05:12,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 329 transitions. [2024-10-14 06:05:12,431 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 329 transitions. Word has length 61 [2024-10-14 06:05:12,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:05:12,432 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 329 transitions. [2024-10-14 06:05:12,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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-14 06:05:12,432 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 329 transitions. [2024-10-14 06:05:12,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-14 06:05:12,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:05:12,434 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 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] [2024-10-14 06:05:12,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 06:05:12,434 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:05:12,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:05:12,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1876999906, now seen corresponding path program 1 times [2024-10-14 06:05:12,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:05:12,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943871736] [2024-10-14 06:05:12,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:05:12,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:05:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 06:05:12,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 06:05:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 06:05:12,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 06:05:12,885 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 06:05:12,887 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 06:05:12,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 06:05:12,893 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:05:12,956 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 06:05:12,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 06:05:12 BoogieIcfgContainer [2024-10-14 06:05:12,962 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 06:05:12,963 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 06:05:12,963 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 06:05:12,964 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 06:05:12,964 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:04:25" (3/4) ... [2024-10-14 06:05:12,967 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 06:05:12,968 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 06:05:12,969 INFO L158 Benchmark]: Toolchain (without parser) took 49177.34ms. Allocated memory was 157.3MB in the beginning and 645.9MB in the end (delta: 488.6MB). Free memory was 120.4MB in the beginning and 249.9MB in the end (delta: -129.4MB). Peak memory consumption was 361.3MB. Max. memory is 16.1GB. [2024-10-14 06:05:12,969 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 113.2MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 06:05:12,969 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.95ms. Allocated memory is still 157.3MB. Free memory was 119.7MB in the beginning and 105.8MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 06:05:12,971 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.83ms. Allocated memory is still 157.3MB. Free memory was 105.8MB in the beginning and 100.9MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 06:05:12,971 INFO L158 Benchmark]: Boogie Preprocessor took 112.35ms. Allocated memory is still 157.3MB. Free memory was 100.9MB in the beginning and 97.4MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 06:05:12,971 INFO L158 Benchmark]: RCFGBuilder took 663.85ms. Allocated memory is still 157.3MB. Free memory was 97.4MB in the beginning and 67.3MB in the end (delta: 30.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-14 06:05:12,972 INFO L158 Benchmark]: TraceAbstraction took 47921.96ms. Allocated memory was 157.3MB in the beginning and 645.9MB in the end (delta: 488.6MB). Free memory was 66.6MB in the beginning and 250.9MB in the end (delta: -184.3MB). Peak memory consumption was 306.8MB. Max. memory is 16.1GB. [2024-10-14 06:05:12,972 INFO L158 Benchmark]: Witness Printer took 4.68ms. Allocated memory is still 645.9MB. Free memory was 250.9MB in the beginning and 249.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 06:05:12,973 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.20ms. Allocated memory is still 113.2MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.95ms. Allocated memory is still 157.3MB. Free memory was 119.7MB in the beginning and 105.8MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.83ms. Allocated memory is still 157.3MB. Free memory was 105.8MB in the beginning and 100.9MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 112.35ms. Allocated memory is still 157.3MB. Free memory was 100.9MB in the beginning and 97.4MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 663.85ms. Allocated memory is still 157.3MB. Free memory was 97.4MB in the beginning and 67.3MB in the end (delta: 30.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 47921.96ms. Allocated memory was 157.3MB in the beginning and 645.9MB in the end (delta: 488.6MB). Free memory was 66.6MB in the beginning and 250.9MB in the end (delta: -184.3MB). Peak memory consumption was 306.8MB. Max. memory is 16.1GB. * Witness Printer took 4.68ms. Allocated memory is still 645.9MB. Free memory was 250.9MB in the beginning and 249.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: 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 115. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 4); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (4 - 1); [L32] const SORT_3 var_4 = 0; [L33] const SORT_3 var_7 = 1; [L34] const SORT_1 var_14 = 1; [L35] const SORT_3 var_20 = 15; [L37] SORT_1 input_2; [L39] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, var_14=1, var_20=15, var_4=0, var_7=1] [L39] SORT_3 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L40] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, var_14=1, var_20=15, var_4=0, var_7=1] [L40] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L42] SORT_3 init_6_arg_1 = var_4; [L43] state_5 = init_6_arg_1 [L44] SORT_3 init_9_arg_1 = var_7; [L45] state_8 = init_9_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_22_arg_0=0, var_22_arg_1=1, var_24=1, var_25=0, var_7=1] [L79] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] EXPR var_22 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_26=0, var_7=1] [L89] EXPR var_26 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=1, var_14=1, var_20=15, var_31_arg_0=0, var_31_arg_1=1, var_33=0, var_7=1] [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=1, var_14=1, var_20=15, var_33=0, var_7=1] [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] EXPR var_31 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=1, var_14=1, var_20=15, var_33=0, var_7=1] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=2, var_7=1] [L115] EXPR var_34 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_7=1] [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_22_arg_0=0, var_22_arg_1=1, var_24=1, var_25=1, var_7=1] [L79] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_24=1, var_25=1, var_7=1] [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] EXPR var_22 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_24=1, var_25=1, var_7=1] [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_26=1, var_7=1] [L89] EXPR var_26 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_7=1] [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=1, state_5=0, state_8=0, var_14=1, var_20=15, var_31_arg_0=1, var_31_arg_1=1, var_33=0, var_7=1] [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=1, state_5=0, state_8=0, var_14=1, var_20=15, var_33=0, var_7=1] [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] EXPR var_31 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=1, state_5=0, state_8=0, var_14=1, var_20=15, var_33=0, var_7=1] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=1, var_14=1, var_20=15, var_34=1, var_7=1] [L115] EXPR var_34 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=1, var_14=1, var_20=15, var_7=1] [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=1, state_8=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-255, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=1, state_8=0, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=1, state_8=0, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.8s, OverallIterations: 20, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3973 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3973 mSDsluCounter, 6881 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5826 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8576 IncrementalHoareTripleChecker+Invalid, 8701 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 1055 mSDtfsCounter, 8576 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1102 GetRequests, 631 SyntacticMatches, 1 SemanticMatches, 470 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7501 ImplicationChecksByTransitivity, 13.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=313occurred in iteration=16, InterpolantAutomatonStates: 301, 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, 19 MinimizatonAttempts, 511 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 27.6s InterpolantComputationTime, 1294 NumberOfCodeBlocks, 1294 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1547 ConstructedInterpolants, 0 QuantifiedInterpolants, 20515 SizeOfPredicates, 44 NumberOfNonLiveVariables, 3037 ConjunctsInSsa, 608 ConjunctsInUnsatCore, 33 InterpolantComputations, 14 PerfectInterpolantSequences, 512/727 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 06:05:13,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fb8ca5e5ce2ed40fdd0ad3d69b0bd96c83a6daf11d842e9766da8dc50e36012a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 06:05:15,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 06:05:15,655 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-14 06:05:15,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 06:05:15,666 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 06:05:15,702 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 06:05:15,703 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 06:05:15,703 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 06:05:15,704 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 06:05:15,704 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 06:05:15,705 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 06:05:15,705 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 06:05:15,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 06:05:15,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 06:05:15,707 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 06:05:15,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 06:05:15,708 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 06:05:15,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 06:05:15,708 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 06:05:15,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 06:05:15,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 06:05:15,710 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 06:05:15,710 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 06:05:15,710 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 06:05:15,711 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 06:05:15,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 06:05:15,712 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 06:05:15,712 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 06:05:15,712 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 06:05:15,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 06:05:15,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 06:05:15,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:05:15,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 06:05:15,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 06:05:15,714 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 06:05:15,715 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 06:05:15,715 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 06:05:15,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 06:05:15,716 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 06:05:15,716 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 06:05:15,717 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 06:05:15,718 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 06:05:15,718 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fb8ca5e5ce2ed40fdd0ad3d69b0bd96c83a6daf11d842e9766da8dc50e36012a [2024-10-14 06:05:16,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 06:05:16,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 06:05:16,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 06:05:16,170 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 06:05:16,170 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 06:05:16,171 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c [2024-10-14 06:05:17,861 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 06:05:18,093 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 06:05:18,094 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c [2024-10-14 06:05:18,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0947a0dee/4f554b3d56174d17a0c0f8974e624d0c/FLAG8f4272f51 [2024-10-14 06:05:18,451 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0947a0dee/4f554b3d56174d17a0c0f8974e624d0c [2024-10-14 06:05:18,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 06:05:18,459 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 06:05:18,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 06:05:18,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 06:05:18,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 06:05:18,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:05:18" (1/1) ... [2024-10-14 06:05:18,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@438fe1fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:18, skipping insertion in model container [2024-10-14 06:05:18,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:05:18" (1/1) ... [2024-10-14 06:05:18,500 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 06:05:18,695 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.cav14_example_v.c[1255,1268] [2024-10-14 06:05:18,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:05:18,764 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 06:05:18,777 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.cav14_example_v.c[1255,1268] [2024-10-14 06:05:18,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:05:18,826 INFO L204 MainTranslator]: Completed translation [2024-10-14 06:05:18,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:18 WrapperNode [2024-10-14 06:05:18,827 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 06:05:18,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 06:05:18,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 06:05:18,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 06:05:18,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:18" (1/1) ... [2024-10-14 06:05:18,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:18" (1/1) ... [2024-10-14 06:05:18,878 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 108 [2024-10-14 06:05:18,880 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 06:05:18,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 06:05:18,882 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 06:05:18,882 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 06:05:18,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:18" (1/1) ... [2024-10-14 06:05:18,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:18" (1/1) ... [2024-10-14 06:05:18,898 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:18" (1/1) ... [2024-10-14 06:05:18,919 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 06:05:18,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:18" (1/1) ... [2024-10-14 06:05:18,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:18" (1/1) ... [2024-10-14 06:05:18,929 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:18" (1/1) ... [2024-10-14 06:05:18,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:18" (1/1) ... [2024-10-14 06:05:18,941 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:18" (1/1) ... [2024-10-14 06:05:18,942 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:18" (1/1) ... [2024-10-14 06:05:18,949 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 06:05:18,954 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 06:05:18,954 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 06:05:18,954 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 06:05:18,955 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:18" (1/1) ... [2024-10-14 06:05:18,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:05:18,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:05:19,000 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 06:05:19,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 06:05:19,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 06:05:19,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 06:05:19,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 06:05:19,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 06:05:19,174 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 06:05:19,177 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 06:05:19,426 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-14 06:05:19,426 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 06:05:19,484 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 06:05:19,484 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 06:05:19,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:05:19 BoogieIcfgContainer [2024-10-14 06:05:19,485 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 06:05:19,490 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 06:05:19,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 06:05:19,496 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 06:05:19,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:05:18" (1/3) ... [2024-10-14 06:05:19,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e453a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:05:19, skipping insertion in model container [2024-10-14 06:05:19,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:18" (2/3) ... [2024-10-14 06:05:19,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e453a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:05:19, skipping insertion in model container [2024-10-14 06:05:19,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:05:19" (3/3) ... [2024-10-14 06:05:19,501 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cav14_example_v.c [2024-10-14 06:05:19,524 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 06:05:19,524 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 06:05:19,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 06:05:19,604 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;@77c2a56b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 06:05:19,605 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 06:05:19,611 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-14 06:05:19,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 06:05:19,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:05:19,622 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 06:05:19,623 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:05:19,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:05:19,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-14 06:05:19,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 06:05:19,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635091119] [2024-10-14 06:05:19,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:05:19,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:05:19,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 06:05:19,649 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 06:05:19,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 06:05:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:05:19,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 06:05:19,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:05:20,093 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-14 06:05:20,095 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 06:05:20,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 06:05:20,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635091119] [2024-10-14 06:05:20,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635091119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:05:20,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:05:20,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 06:05:20,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65547828] [2024-10-14 06:05:20,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:05:20,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:05:20,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 06:05:20,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:05:20,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:05:20,140 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-14 06:05:20,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:05:20,213 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-14 06:05:20,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:05:20,218 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-14 06:05:20,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:05:20,226 INFO L225 Difference]: With dead ends: 15 [2024-10-14 06:05:20,226 INFO L226 Difference]: Without dead ends: 9 [2024-10-14 06:05:20,230 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-14 06:05:20,238 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-14 06:05:20,240 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-14 06:05:20,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-14 06:05:20,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-14 06:05:20,276 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-14 06:05:20,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-14 06:05:20,278 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-14 06:05:20,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:05:20,279 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-14 06:05:20,279 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-14 06:05:20,279 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-14 06:05:20,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 06:05:20,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:05:20,280 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 06:05:20,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 06:05:20,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:05:20,482 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:05:20,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:05:20,483 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-14 06:05:20,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 06:05:20,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271126673] [2024-10-14 06:05:20,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:05:20,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:05:20,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 06:05:20,488 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 06:05:20,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 06:05:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:05:20,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-14 06:05:20,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:05:20,773 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-14 06:05:20,773 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 06:05:22,093 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-14 06:05:22,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 06:05:22,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271126673] [2024-10-14 06:05:22,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [271126673] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 06:05:22,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 06:05:22,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-14 06:05:22,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22546940] [2024-10-14 06:05:22,094 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 06:05:22,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 06:05:22,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 06:05:22,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 06:05:22,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-14 06:05:22,098 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-14 06:05:22,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:05:22,214 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-10-14 06:05:22,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 06:05:22,215 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-14 06:05:22,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:05:22,216 INFO L225 Difference]: With dead ends: 14 [2024-10-14 06:05:22,216 INFO L226 Difference]: Without dead ends: 12 [2024-10-14 06:05:22,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 06:05:22,217 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:05:22,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 11 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:05:22,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-14 06:05:22,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2024-10-14 06:05:22,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-14 06:05:22,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-14 06:05:22,226 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-14 06:05:22,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:05:22,226 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-14 06:05:22,227 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-14 06:05:22,227 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-14 06:05:22,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 06:05:22,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:05:22,228 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-14 06:05:22,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 06:05:22,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:05:22,432 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:05:22,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:05:22,437 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-14 06:05:22,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 06:05:22,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462981813] [2024-10-14 06:05:22,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 06:05:22,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:05:22,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 06:05:22,445 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 06:05:22,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 06:05:22,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 06:05:22,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 06:05:22,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-14 06:05:22,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:05:22,796 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:05:22,797 INFO L311 TraceCheckSpWp]: Computing backward predicates...