./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example.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 da271682498909c2f25abbd0acdfd9a043f664f7a7cb078f9b27fc5caa97b14c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 18:09:07,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:09:07,837 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-08 18:09:07,845 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:09:07,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:09:07,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:09:07,885 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:09:07,885 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:09:07,886 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:09:07,887 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:09:07,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:09:07,888 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:09:07,888 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:09:07,890 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:09:07,891 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:09:07,891 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:09:07,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:09:07,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:09:07,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:09:07,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:09:07,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:09:07,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:09:07,898 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:09:07,898 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:09:07,898 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:09:07,898 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:09:07,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:09:07,899 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:09:07,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:09:07,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:09:07,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:09:07,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:09:07,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:09:07,902 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:09:07,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:09:07,902 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:09:07,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:09:07,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:09:07,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:09:07,903 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 -> da271682498909c2f25abbd0acdfd9a043f664f7a7cb078f9b27fc5caa97b14c [2024-11-08 18:09:08,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:09:08,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:09:08,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:09:08,229 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:09:08,230 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:09:08,231 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example.c [2024-11-08 18:09:09,972 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:09:10,164 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:09:10,164 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example.c [2024-11-08 18:09:10,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/143949c8d/ea2f6b4d92e34a758314dedc2f288f2e/FLAG96e3a8041 [2024-11-08 18:09:10,189 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/143949c8d/ea2f6b4d92e34a758314dedc2f288f2e [2024-11-08 18:09:10,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:09:10,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:09:10,195 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:09:10,195 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:09:10,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:09:10,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:09:10" (1/1) ... [2024-11-08 18:09:10,209 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a1f6ad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:10, skipping insertion in model container [2024-11-08 18:09:10,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:09:10" (1/1) ... [2024-11-08 18:09:10,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:09:10,450 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example.c[1253,1266] [2024-11-08 18:09:10,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:09:10,538 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:09:10,553 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example.c[1253,1266] [2024-11-08 18:09:10,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:09:10,624 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:09:10,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:10 WrapperNode [2024-11-08 18:09:10,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:09:10,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:09:10,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:09:10,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:09:10,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:10" (1/1) ... [2024-11-08 18:09:10,649 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:10" (1/1) ... [2024-11-08 18:09:10,718 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 188 [2024-11-08 18:09:10,719 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:09:10,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:09:10,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:09:10,720 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:09:10,736 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:10" (1/1) ... [2024-11-08 18:09:10,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:10" (1/1) ... [2024-11-08 18:09:10,746 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:10" (1/1) ... [2024-11-08 18:09:10,770 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 18:09:10,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:10" (1/1) ... [2024-11-08 18:09:10,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:10" (1/1) ... [2024-11-08 18:09:10,790 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:10" (1/1) ... [2024-11-08 18:09:10,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:10" (1/1) ... [2024-11-08 18:09:10,808 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:10" (1/1) ... [2024-11-08 18:09:10,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:10" (1/1) ... [2024-11-08 18:09:10,824 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:09:10,827 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:09:10,828 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:09:10,828 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:09:10,829 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:10" (1/1) ... [2024-11-08 18:09:10,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:09:10,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 18:09:10,873 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:09:10,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:09:10,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:09:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:09:10,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:09:10,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:09:11,038 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:09:11,040 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:09:11,471 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-11-08 18:09:11,471 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:09:11,490 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:09:11,490 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:09:11,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:09:11 BoogieIcfgContainer [2024-11-08 18:09:11,492 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:09:11,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:09:11,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:09:11,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:09:11,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:09:10" (1/3) ... [2024-11-08 18:09:11,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a22cef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:09:11, skipping insertion in model container [2024-11-08 18:09:11,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:10" (2/3) ... [2024-11-08 18:09:11,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a22cef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:09:11, skipping insertion in model container [2024-11-08 18:09:11,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:09:11" (3/3) ... [2024-11-08 18:09:11,503 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cav14_example.c [2024-11-08 18:09:11,523 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:09:11,524 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:09:11,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:09:11,607 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;@54d69906, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:09:11,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:09:11,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:11,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 18:09:11,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:11,619 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:09:11,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:11,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:11,628 INFO L85 PathProgramCache]: Analyzing trace with hash -829897697, now seen corresponding path program 1 times [2024-11-08 18:09:11,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:11,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884033286] [2024-11-08 18:09:11,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:11,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:12,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:12,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:12,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884033286] [2024-11-08 18:09:12,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884033286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:09:12,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:09:12,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:09:12,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628108440] [2024-11-08 18:09:12,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:09:12,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:09:12,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:12,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:09:12,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:09:12,246 INFO L87 Difference]: Start difference. First operand has 50 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 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.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-11-08 18:09:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:12,331 INFO L93 Difference]: Finished difference Result 89 states and 129 transitions. [2024-11-08 18:09:12,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:09:12,337 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-11-08 18:09:12,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:12,344 INFO L225 Difference]: With dead ends: 89 [2024-11-08 18:09:12,345 INFO L226 Difference]: Without dead ends: 49 [2024-11-08 18:09:12,348 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-11-08 18:09:12,351 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 189 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-11-08 18:09:12,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 189 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:09:12,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-08 18:09:12,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-08 18:09:12,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:12,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2024-11-08 18:09:12,385 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 13 [2024-11-08 18:09:12,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:12,386 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2024-11-08 18:09:12,386 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-11-08 18:09:12,386 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2024-11-08 18:09:12,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 18:09:12,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:12,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:09:12,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:09:12,387 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:12,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:12,388 INFO L85 PathProgramCache]: Analyzing trace with hash 44670374, now seen corresponding path program 1 times [2024-11-08 18:09:12,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:12,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150716883] [2024-11-08 18:09:12,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:12,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:12,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:12,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:12,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150716883] [2024-11-08 18:09:12,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150716883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:09:12,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:09:12,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:09:12,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295219452] [2024-11-08 18:09:12,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:09:12,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:09:12,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:12,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:09:12,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:09:12,524 INFO L87 Difference]: Start difference. First operand 49 states and 69 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:12,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:12,568 INFO L93 Difference]: Finished difference Result 90 states and 127 transitions. [2024-11-08 18:09:12,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:09:12,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-08 18:09:12,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:12,569 INFO L225 Difference]: With dead ends: 90 [2024-11-08 18:09:12,569 INFO L226 Difference]: Without dead ends: 51 [2024-11-08 18:09:12,571 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-11-08 18:09:12,572 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:12,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:09:12,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-08 18:09:12,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-08 18:09:12,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2024-11-08 18:09:12,586 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 14 [2024-11-08 18:09:12,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:12,587 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2024-11-08 18:09:12,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:12,588 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2024-11-08 18:09:12,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 18:09:12,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:12,589 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:09:12,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:09:12,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:12,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:12,592 INFO L85 PathProgramCache]: Analyzing trace with hash 286815704, now seen corresponding path program 1 times [2024-11-08 18:09:12,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:12,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72365897] [2024-11-08 18:09:12,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:12,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:13,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:13,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:13,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72365897] [2024-11-08 18:09:13,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72365897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:09:13,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:09:13,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:09:13,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665692959] [2024-11-08 18:09:13,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:09:13,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:09:13,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:13,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:09:13,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:09:13,012 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:13,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:13,140 INFO L93 Difference]: Finished difference Result 119 states and 166 transitions. [2024-11-08 18:09:13,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:09:13,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-08 18:09:13,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:13,142 INFO L225 Difference]: With dead ends: 119 [2024-11-08 18:09:13,142 INFO L226 Difference]: Without dead ends: 78 [2024-11-08 18:09:13,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:09:13,144 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 44 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:13,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 275 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:09:13,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-08 18:09:13,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 53. [2024-11-08 18:09:13,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:13,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 73 transitions. [2024-11-08 18:09:13,151 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 73 transitions. Word has length 15 [2024-11-08 18:09:13,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:13,151 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 73 transitions. [2024-11-08 18:09:13,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:13,152 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2024-11-08 18:09:13,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 18:09:13,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:13,153 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-11-08 18:09:13,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:09:13,154 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:13,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:13,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1054619020, now seen corresponding path program 1 times [2024-11-08 18:09:13,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:13,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881064798] [2024-11-08 18:09:13,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:13,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:13,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:13,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:13,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881064798] [2024-11-08 18:09:13,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881064798] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:09:13,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260379231] [2024-11-08 18:09:13,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:13,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:09:13,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 18:09:13,722 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:09:13,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 18:09:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:13,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 18:09:13,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:09:14,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:14,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:09:14,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260379231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:09:14,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:09:14,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-11-08 18:09:14,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19245306] [2024-11-08 18:09:14,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:09:14,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:09:14,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:14,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:09:14,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:09:14,172 INFO L87 Difference]: Start difference. First operand 53 states and 73 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 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-11-08 18:09:14,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:14,402 INFO L93 Difference]: Finished difference Result 122 states and 170 transitions. [2024-11-08 18:09:14,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:09:14,402 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 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-11-08 18:09:14,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:14,405 INFO L225 Difference]: With dead ends: 122 [2024-11-08 18:09:14,407 INFO L226 Difference]: Without dead ends: 81 [2024-11-08 18:09:14,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-08 18:09:14,409 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 43 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:14,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 234 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:09:14,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-08 18:09:14,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 63. [2024-11-08 18:09:14,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 62 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:14,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 84 transitions. [2024-11-08 18:09:14,418 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 84 transitions. Word has length 34 [2024-11-08 18:09:14,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:14,418 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 84 transitions. [2024-11-08 18:09:14,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 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-11-08 18:09:14,418 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 84 transitions. [2024-11-08 18:09:14,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 18:09:14,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:14,419 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-11-08 18:09:14,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 18:09:14,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:09:14,624 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:14,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:14,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1315987221, now seen corresponding path program 1 times [2024-11-08 18:09:14,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:14,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251625296] [2024-11-08 18:09:14,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:14,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:15,231 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:15,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:15,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251625296] [2024-11-08 18:09:15,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251625296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:09:15,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:09:15,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:09:15,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090806146] [2024-11-08 18:09:15,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:09:15,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:09:15,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:15,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:09:15,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:09:15,237 INFO L87 Difference]: Start difference. First operand 63 states and 84 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 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-11-08 18:09:15,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:15,332 INFO L93 Difference]: Finished difference Result 154 states and 212 transitions. [2024-11-08 18:09:15,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:09:15,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 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-11-08 18:09:15,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:15,335 INFO L225 Difference]: With dead ends: 154 [2024-11-08 18:09:15,337 INFO L226 Difference]: Without dead ends: 113 [2024-11-08 18:09:15,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:09:15,339 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 60 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:15,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 449 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:09:15,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-08 18:09:15,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 76. [2024-11-08 18:09:15,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:15,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2024-11-08 18:09:15,354 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 35 [2024-11-08 18:09:15,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:15,354 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2024-11-08 18:09:15,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 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-11-08 18:09:15,355 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2024-11-08 18:09:15,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 18:09:15,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:15,355 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-11-08 18:09:15,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:09:15,356 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:15,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:15,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1091437488, now seen corresponding path program 1 times [2024-11-08 18:09:15,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:15,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173206037] [2024-11-08 18:09:15,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:15,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:15,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:15,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173206037] [2024-11-08 18:09:15,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173206037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:09:15,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:09:15,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:09:15,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700417479] [2024-11-08 18:09:15,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:09:15,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:09:15,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:15,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:09:15,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:09:15,838 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:15,957 INFO L93 Difference]: Finished difference Result 163 states and 225 transitions. [2024-11-08 18:09:15,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:09:15,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-08 18:09:15,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:15,962 INFO L225 Difference]: With dead ends: 163 [2024-11-08 18:09:15,962 INFO L226 Difference]: Without dead ends: 109 [2024-11-08 18:09:15,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-08 18:09:15,964 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 27 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:15,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 182 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:09:15,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-08 18:09:15,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2024-11-08 18:09:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.386138613861386) internal successors, (140), 101 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:15,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 140 transitions. [2024-11-08 18:09:15,977 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 140 transitions. Word has length 36 [2024-11-08 18:09:15,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:15,979 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 140 transitions. [2024-11-08 18:09:15,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:15,980 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 140 transitions. [2024-11-08 18:09:15,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 18:09:15,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:15,981 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-11-08 18:09:15,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 18:09:15,981 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:15,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:15,982 INFO L85 PathProgramCache]: Analyzing trace with hash 166812475, now seen corresponding path program 1 times [2024-11-08 18:09:15,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:15,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142432060] [2024-11-08 18:09:15,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:15,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:16,382 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:16,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:16,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142432060] [2024-11-08 18:09:16,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142432060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:09:16,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:09:16,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:09:16,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216762937] [2024-11-08 18:09:16,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:09:16,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:09:16,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:16,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:09:16,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:09:16,388 INFO L87 Difference]: Start difference. First operand 102 states and 140 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 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-11-08 18:09:16,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:16,553 INFO L93 Difference]: Finished difference Result 193 states and 268 transitions. [2024-11-08 18:09:16,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:09:16,554 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 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-11-08 18:09:16,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:16,555 INFO L225 Difference]: With dead ends: 193 [2024-11-08 18:09:16,555 INFO L226 Difference]: Without dead ends: 130 [2024-11-08 18:09:16,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:09:16,557 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 64 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:16,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 278 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:09:16,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-08 18:09:16,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 116. [2024-11-08 18:09:16,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.373913043478261) internal successors, (158), 115 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:16,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 158 transitions. [2024-11-08 18:09:16,564 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 158 transitions. Word has length 36 [2024-11-08 18:09:16,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:16,564 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 158 transitions. [2024-11-08 18:09:16,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 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-11-08 18:09:16,564 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 158 transitions. [2024-11-08 18:09:16,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 18:09:16,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:16,565 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-11-08 18:09:16,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 18:09:16,566 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:16,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:16,566 INFO L85 PathProgramCache]: Analyzing trace with hash 494893948, now seen corresponding path program 1 times [2024-11-08 18:09:16,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:16,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241924997] [2024-11-08 18:09:16,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:16,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:17,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:17,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:17,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241924997] [2024-11-08 18:09:17,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241924997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:09:17,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:09:17,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:09:17,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097905030] [2024-11-08 18:09:17,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:09:17,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:09:17,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:17,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:09:17,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:09:17,406 INFO L87 Difference]: Start difference. First operand 116 states and 158 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 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-11-08 18:09:17,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:17,638 INFO L93 Difference]: Finished difference Result 196 states and 268 transitions. [2024-11-08 18:09:17,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:09:17,639 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 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-11-08 18:09:17,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:17,640 INFO L225 Difference]: With dead ends: 196 [2024-11-08 18:09:17,640 INFO L226 Difference]: Without dead ends: 142 [2024-11-08 18:09:17,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:09:17,641 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 73 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:17,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 201 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:09:17,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-08 18:09:17,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 120. [2024-11-08 18:09:17,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.3781512605042017) internal successors, (164), 119 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:17,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 164 transitions. [2024-11-08 18:09:17,658 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 164 transitions. Word has length 37 [2024-11-08 18:09:17,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:17,658 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 164 transitions. [2024-11-08 18:09:17,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 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-11-08 18:09:17,658 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 164 transitions. [2024-11-08 18:09:17,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 18:09:17,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:17,664 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-11-08 18:09:17,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 18:09:17,664 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:17,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:17,665 INFO L85 PathProgramCache]: Analyzing trace with hash 32065123, now seen corresponding path program 1 times [2024-11-08 18:09:17,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:17,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688159230] [2024-11-08 18:09:17,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:17,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:18,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:18,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:18,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688159230] [2024-11-08 18:09:18,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688159230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:09:18,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:09:18,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:09:18,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906687289] [2024-11-08 18:09:18,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:09:18,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:09:18,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:18,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:09:18,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:09:18,306 INFO L87 Difference]: Start difference. First operand 120 states and 164 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 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-11-08 18:09:18,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:18,563 INFO L93 Difference]: Finished difference Result 191 states and 262 transitions. [2024-11-08 18:09:18,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:09:18,563 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 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-11-08 18:09:18,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:18,564 INFO L225 Difference]: With dead ends: 191 [2024-11-08 18:09:18,564 INFO L226 Difference]: Without dead ends: 124 [2024-11-08 18:09:18,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 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-11-08 18:09:18,566 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 51 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:18,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 222 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:09:18,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-08 18:09:18,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2024-11-08 18:09:18,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.3770491803278688) internal successors, (168), 122 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-11-08 18:09:18,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 168 transitions. [2024-11-08 18:09:18,572 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 168 transitions. Word has length 37 [2024-11-08 18:09:18,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:18,572 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 168 transitions. [2024-11-08 18:09:18,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 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-11-08 18:09:18,572 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 168 transitions. [2024-11-08 18:09:18,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 18:09:18,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:18,573 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-11-08 18:09:18,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 18:09:18,574 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:18,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:18,574 INFO L85 PathProgramCache]: Analyzing trace with hash -569459623, now seen corresponding path program 1 times [2024-11-08 18:09:18,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:18,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849350065] [2024-11-08 18:09:18,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:18,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:18,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:18,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:18,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849350065] [2024-11-08 18:09:18,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849350065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:09:18,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:09:18,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:09:18,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474197364] [2024-11-08 18:09:18,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:09:18,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:09:18,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:18,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:09:18,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:09:18,891 INFO L87 Difference]: Start difference. First operand 123 states and 168 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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-11-08 18:09:18,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:18,933 INFO L93 Difference]: Finished difference Result 206 states and 281 transitions. [2024-11-08 18:09:18,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:09:18,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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-11-08 18:09:18,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:18,935 INFO L225 Difference]: With dead ends: 206 [2024-11-08 18:09:18,935 INFO L226 Difference]: Without dead ends: 104 [2024-11-08 18:09:18,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:09:18,936 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 29 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:18,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 222 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:09:18,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-08 18:09:18,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-08 18:09:18,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:18,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 138 transitions. [2024-11-08 18:09:18,948 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 138 transitions. Word has length 37 [2024-11-08 18:09:18,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:18,948 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 138 transitions. [2024-11-08 18:09:18,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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-11-08 18:09:18,949 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions. [2024-11-08 18:09:18,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 18:09:18,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:18,949 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, 1] [2024-11-08 18:09:18,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 18:09:18,950 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:18,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:18,950 INFO L85 PathProgramCache]: Analyzing trace with hash 311463020, now seen corresponding path program 1 times [2024-11-08 18:09:18,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:18,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398584941] [2024-11-08 18:09:18,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:18,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:19,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:19,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:19,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398584941] [2024-11-08 18:09:19,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398584941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:09:19,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:09:19,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:09:19,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361685883] [2024-11-08 18:09:19,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:09:19,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:09:19,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:19,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:09:19,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:09:19,428 INFO L87 Difference]: Start difference. First operand 104 states and 138 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:19,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:19,526 INFO L93 Difference]: Finished difference Result 198 states and 269 transitions. [2024-11-08 18:09:19,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:09:19,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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 38 [2024-11-08 18:09:19,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:19,528 INFO L225 Difference]: With dead ends: 198 [2024-11-08 18:09:19,528 INFO L226 Difference]: Without dead ends: 144 [2024-11-08 18:09:19,529 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-11-08 18:09:19,529 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 56 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:19,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 476 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:09:19,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-08 18:09:19,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 107. [2024-11-08 18:09:19,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.3396226415094339) internal successors, (142), 106 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 142 transitions. [2024-11-08 18:09:19,534 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 142 transitions. Word has length 38 [2024-11-08 18:09:19,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:19,534 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 142 transitions. [2024-11-08 18:09:19,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:19,534 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 142 transitions. [2024-11-08 18:09:19,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 18:09:19,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:19,535 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, 1] [2024-11-08 18:09:19,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 18:09:19,536 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:19,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:19,536 INFO L85 PathProgramCache]: Analyzing trace with hash 785479526, now seen corresponding path program 1 times [2024-11-08 18:09:19,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:19,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905418560] [2024-11-08 18:09:19,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:19,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:20,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:20,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:20,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905418560] [2024-11-08 18:09:20,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905418560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:09:20,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:09:20,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 18:09:20,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988380134] [2024-11-08 18:09:20,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:09:20,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:09:20,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:20,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:09:20,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:09:20,261 INFO L87 Difference]: Start difference. First operand 107 states and 142 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:20,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:20,474 INFO L93 Difference]: Finished difference Result 165 states and 223 transitions. [2024-11-08 18:09:20,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:09:20,474 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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 38 [2024-11-08 18:09:20,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:20,475 INFO L225 Difference]: With dead ends: 165 [2024-11-08 18:09:20,475 INFO L226 Difference]: Without dead ends: 109 [2024-11-08 18:09:20,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:09:20,476 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 50 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:20,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 262 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:09:20,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-08 18:09:20,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-08 18:09:20,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.3333333333333333) internal successors, (144), 108 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:20,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 144 transitions. [2024-11-08 18:09:20,482 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 144 transitions. Word has length 38 [2024-11-08 18:09:20,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:20,483 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 144 transitions. [2024-11-08 18:09:20,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:20,483 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 144 transitions. [2024-11-08 18:09:20,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 18:09:20,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:20,484 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, 1, 1] [2024-11-08 18:09:20,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 18:09:20,488 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:20,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:20,488 INFO L85 PathProgramCache]: Analyzing trace with hash -2056132229, now seen corresponding path program 1 times [2024-11-08 18:09:20,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:20,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103584967] [2024-11-08 18:09:20,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:20,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:20,916 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:20,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:20,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103584967] [2024-11-08 18:09:20,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103584967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:09:20,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:09:20,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:09:20,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967784548] [2024-11-08 18:09:20,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:09:20,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:09:20,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:20,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:09:20,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:09:20,920 INFO L87 Difference]: Start difference. First operand 109 states and 144 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:21,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:21,055 INFO L93 Difference]: Finished difference Result 177 states and 238 transitions. [2024-11-08 18:09:21,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:09:21,056 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 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 39 [2024-11-08 18:09:21,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:21,057 INFO L225 Difference]: With dead ends: 177 [2024-11-08 18:09:21,057 INFO L226 Difference]: Without dead ends: 101 [2024-11-08 18:09:21,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:09:21,057 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 27 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:21,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 279 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:09:21,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-08 18:09:21,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-08 18:09:21,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.32) internal successors, (132), 100 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:21,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 132 transitions. [2024-11-08 18:09:21,063 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 132 transitions. Word has length 39 [2024-11-08 18:09:21,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:21,064 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 132 transitions. [2024-11-08 18:09:21,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:21,064 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 132 transitions. [2024-11-08 18:09:21,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 18:09:21,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:21,065 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, 1, 1] [2024-11-08 18:09:21,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 18:09:21,065 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:21,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:21,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1150665499, now seen corresponding path program 1 times [2024-11-08 18:09:21,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:21,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181749976] [2024-11-08 18:09:21,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:21,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:21,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:21,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:21,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181749976] [2024-11-08 18:09:21,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181749976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:09:21,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:09:21,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 18:09:21,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935472568] [2024-11-08 18:09:21,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:09:21,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 18:09:21,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:21,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 18:09:21,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:09:21,828 INFO L87 Difference]: Start difference. First operand 101 states and 132 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:22,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:22,028 INFO L93 Difference]: Finished difference Result 161 states and 215 transitions. [2024-11-08 18:09:22,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 18:09:22,029 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 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 39 [2024-11-08 18:09:22,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:22,030 INFO L225 Difference]: With dead ends: 161 [2024-11-08 18:09:22,030 INFO L226 Difference]: Without dead ends: 97 [2024-11-08 18:09:22,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-08 18:09:22,031 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 14 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:22,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 328 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:09:22,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-08 18:09:22,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-08 18:09:22,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.3020833333333333) internal successors, (125), 96 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:22,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2024-11-08 18:09:22,035 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 39 [2024-11-08 18:09:22,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:22,035 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2024-11-08 18:09:22,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:22,035 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2024-11-08 18:09:22,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 18:09:22,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:22,036 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, 1, 1, 1] [2024-11-08 18:09:22,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 18:09:22,036 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:22,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:22,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1387310391, now seen corresponding path program 1 times [2024-11-08 18:09:22,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:22,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204632169] [2024-11-08 18:09:22,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:22,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:09:22,133 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:09:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:09:22,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:09:22,248 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:09:22,249 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 18:09:22,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 18:09:22,254 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:09:22,303 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:09:22,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:09:22 BoogieIcfgContainer [2024-11-08 18:09:22,307 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:09:22,308 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:09:22,308 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:09:22,309 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:09:22,309 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:09:11" (3/4) ... [2024-11-08 18:09:22,312 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 18:09:22,313 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:09:22,313 INFO L158 Benchmark]: Toolchain (without parser) took 12119.77ms. Allocated memory was 138.4MB in the beginning and 358.6MB in the end (delta: 220.2MB). Free memory was 67.4MB in the beginning and 214.8MB in the end (delta: -147.5MB). Peak memory consumption was 74.6MB. Max. memory is 16.1GB. [2024-11-08 18:09:22,314 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 138.4MB. Free memory was 91.5MB in the beginning and 91.3MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:09:22,314 INFO L158 Benchmark]: CACSL2BoogieTranslator took 430.14ms. Allocated memory was 138.4MB in the beginning and 205.5MB in the end (delta: 67.1MB). Free memory was 67.1MB in the beginning and 173.4MB in the end (delta: -106.3MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2024-11-08 18:09:22,314 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.51ms. Allocated memory is still 205.5MB. Free memory was 173.4MB in the beginning and 168.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 18:09:22,314 INFO L158 Benchmark]: Boogie Preprocessor took 106.15ms. Allocated memory is still 205.5MB. Free memory was 168.2MB in the beginning and 165.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 18:09:22,314 INFO L158 Benchmark]: RCFGBuilder took 665.07ms. Allocated memory is still 205.5MB. Free memory was 165.0MB in the beginning and 135.7MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 18:09:22,315 INFO L158 Benchmark]: TraceAbstraction took 10812.78ms. Allocated memory was 205.5MB in the beginning and 358.6MB in the end (delta: 153.1MB). Free memory was 134.6MB in the beginning and 214.8MB in the end (delta: -80.2MB). Peak memory consumption was 72.8MB. Max. memory is 16.1GB. [2024-11-08 18:09:22,315 INFO L158 Benchmark]: Witness Printer took 5.23ms. Allocated memory is still 358.6MB. Free memory is still 214.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:09:22,317 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.32ms. Allocated memory is still 138.4MB. Free memory was 91.5MB in the beginning and 91.3MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 430.14ms. Allocated memory was 138.4MB in the beginning and 205.5MB in the end (delta: 67.1MB). Free memory was 67.1MB in the beginning and 173.4MB in the end (delta: -106.3MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.51ms. Allocated memory is still 205.5MB. Free memory was 173.4MB in the beginning and 168.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.15ms. Allocated memory is still 205.5MB. Free memory was 168.2MB in the beginning and 165.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 665.07ms. Allocated memory is still 205.5MB. Free memory was 165.0MB in the beginning and 135.7MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10812.78ms. Allocated memory was 205.5MB in the beginning and 358.6MB in the end (delta: 153.1MB). Free memory was 134.6MB in the beginning and 214.8MB in the end (delta: -80.2MB). Peak memory consumption was 72.8MB. Max. memory is 16.1GB. * Witness Printer took 5.23ms. Allocated memory is still 358.6MB. Free memory is still 214.8MB. 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 - 3); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (3 - 1); [L32] const SORT_3 var_4 = 0; [L33] const SORT_1 var_13 = 1; [L34] const SORT_3 var_19 = 7; [L35] const SORT_3 var_23 = 1; [L37] SORT_1 input_2; [L39] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=7, var_13=1, var_19=7, var_23=1, var_4=0] [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=7, var_13=1, var_19=7, var_23=1, var_4=0] [L40] SORT_3 state_7 = __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_8_arg_1 = var_4; [L45] state_7 = init_8_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=7, state_5=0, state_7=0, var_13=1, var_19=7, var_23=1] [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_9_arg_0 = state_5; [L52] SORT_3 var_9_arg_1 = state_7; [L53] SORT_1 var_9 = var_9_arg_0 > var_9_arg_1; [L54] SORT_1 var_10_arg_0 = var_9; [L55] SORT_1 var_10 = ~var_10_arg_0; [L56] SORT_1 var_14_arg_0 = var_10; [L57] SORT_1 var_14 = ~var_14_arg_0; [L58] SORT_1 var_15_arg_0 = var_13; [L59] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, mask_SORT_3=7, state_5=0, state_7=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-256, var_19=7, var_23=1] [L60] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=7, state_5=0, state_7=0, var_13=1, var_19=7, var_23=1] [L60] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L61] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=7, state_5=0, state_7=0, var_13=1, var_19=7, var_23=1] [L61] var_15 = var_15 & mask_SORT_1 [L62] SORT_1 bad_16_arg_0 = var_15; [L63] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_16_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_7; [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_23; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_18_arg_0 = state_5; [L72] SORT_3 var_18_arg_1 = state_7; [L73] SORT_1 var_18 = var_18_arg_0 > var_18_arg_1; [L74] SORT_3 var_20_arg_0 = state_7; [L75] SORT_3 var_20_arg_1 = var_19; [L76] SORT_1 var_20 = var_20_arg_0 != var_20_arg_1; [L77] SORT_1 var_21_arg_0 = var_18; [L78] SORT_1 var_21_arg_1 = var_20; VAL [mask_SORT_1=1, mask_SORT_3=7, state_5=0, state_7=0, var_13=1, var_19=7, var_21_arg_0=0, var_21_arg_1=1, var_23=1, var_24=1, var_25=1] [L79] EXPR var_21_arg_0 | var_21_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=7, state_5=0, state_7=0, var_13=1, var_19=7, var_23=1, var_24=1, var_25=1] [L79] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L80] EXPR var_21 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=7, state_5=0, state_7=0, var_13=1, var_19=7, var_23=1, var_24=1, var_25=1] [L80] var_21 = var_21 & mask_SORT_1 [L81] SORT_1 var_22_arg_0 = var_21; [L82] SORT_3 var_22_arg_1 = state_5; [L83] SORT_3 var_22_arg_2 = state_7; [L84] SORT_3 var_22 = var_22_arg_0 ? var_22_arg_1 : var_22_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_22; [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=7, state_5=0, state_7=0, var_13=1, var_19=7, var_23=1, var_26=1] [L89] EXPR var_26 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=7, state_5=0, state_7=0, var_13=1, var_19=7, var_23=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_7; [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_7; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_7; [L98] SORT_3 var_30_arg_1 = var_19; [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=7, next_27_arg_1=1, state_5=0, state_7=0, var_13=1, var_19=7, var_23=1, var_31_arg_0=1, var_31_arg_1=1, var_33=0] [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=7, next_27_arg_1=1, state_5=0, state_7=0, var_13=1, var_19=7, var_23=1, var_33=0] [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=7, next_27_arg_1=1, state_5=0, state_7=0, var_13=1, var_19=7, var_23=1, var_33=0] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_7; [L105] SORT_3 var_28_arg_1 = var_23; [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_7; [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=7, next_27_arg_1=1, var_13=1, var_19=7, var_23=1, var_34=1] [L115] EXPR var_34 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=7, next_27_arg_1=1, var_13=1, var_19=7, var_23=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_7 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_9_arg_0 = state_5; [L52] SORT_3 var_9_arg_1 = state_7; [L53] SORT_1 var_9 = var_9_arg_0 > var_9_arg_1; [L54] SORT_1 var_10_arg_0 = var_9; [L55] SORT_1 var_10 = ~var_10_arg_0; [L56] SORT_1 var_14_arg_0 = var_10; [L57] SORT_1 var_14 = ~var_14_arg_0; [L58] SORT_1 var_15_arg_0 = var_13; [L59] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, mask_SORT_3=7, state_5=1, state_7=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-255, var_19=7, var_23=1] [L60] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=7, state_5=1, state_7=0, var_13=1, var_19=7, var_23=1] [L60] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L61] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=7, state_5=1, state_7=0, var_13=1, var_19=7, var_23=1] [L61] var_15 = var_15 & mask_SORT_1 [L62] SORT_1 bad_16_arg_0 = var_15; [L63] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 538 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 538 mSDsluCounter, 3782 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2975 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1578 IncrementalHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 807 mSDtfsCounter, 1578 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=9, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 161 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 522 NumberOfCodeBlocks, 522 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 467 ConstructedInterpolants, 0 QuantifiedInterpolants, 2737 SizeOfPredicates, 3 NumberOfNonLiveVariables, 253 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 68/72 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-11-08 18:09:22,356 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example.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 da271682498909c2f25abbd0acdfd9a043f664f7a7cb078f9b27fc5caa97b14c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 18:09:24,882 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:09:24,937 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-08 18:09:24,942 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:09:24,942 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:09:24,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:09:24,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:09:24,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:09:24,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:09:24,983 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:09:24,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:09:24,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:09:24,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:09:24,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:09:24,987 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:09:24,987 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:09:24,987 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:09:24,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:09:24,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:09:24,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:09:24,992 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:09:24,992 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:09:24,993 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 18:09:24,993 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:09:24,993 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 18:09:24,993 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:09:24,993 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:09:24,993 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:09:24,994 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:09:24,994 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:09:24,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:09:24,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:09:24,994 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:09:24,995 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:09:24,995 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:09:24,995 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 18:09:24,995 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 18:09:24,995 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:09:24,995 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:09:24,996 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:09:24,996 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:09:24,998 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 -> da271682498909c2f25abbd0acdfd9a043f664f7a7cb078f9b27fc5caa97b14c [2024-11-08 18:09:25,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:09:25,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:09:25,394 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:09:25,396 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:09:25,397 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:09:25,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example.c [2024-11-08 18:09:27,089 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:09:27,356 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:09:27,357 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example.c [2024-11-08 18:09:27,374 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90e263eb6/16eaef4ef86545c08f55e302cad4cf56/FLAGb8a6a86f1 [2024-11-08 18:09:27,390 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90e263eb6/16eaef4ef86545c08f55e302cad4cf56 [2024-11-08 18:09:27,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:09:27,394 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:09:27,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:09:27,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:09:27,404 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:09:27,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:09:27" (1/1) ... [2024-11-08 18:09:27,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38a6d364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:27, skipping insertion in model container [2024-11-08 18:09:27,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:09:27" (1/1) ... [2024-11-08 18:09:27,436 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:09:27,632 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example.c[1253,1266] [2024-11-08 18:09:27,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:09:27,710 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:09:27,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example.c[1253,1266] [2024-11-08 18:09:27,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:09:27,794 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:09:27,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:27 WrapperNode [2024-11-08 18:09:27,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:09:27,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:09:27,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:09:27,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:09:27,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:27" (1/1) ... [2024-11-08 18:09:27,815 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:27" (1/1) ... [2024-11-08 18:09:27,846 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 108 [2024-11-08 18:09:27,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:09:27,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:09:27,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:09:27,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:09:27,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:27" (1/1) ... [2024-11-08 18:09:27,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:27" (1/1) ... [2024-11-08 18:09:27,868 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:27" (1/1) ... [2024-11-08 18:09:27,887 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 18:09:27,891 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:27" (1/1) ... [2024-11-08 18:09:27,892 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:27" (1/1) ... [2024-11-08 18:09:27,903 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:27" (1/1) ... [2024-11-08 18:09:27,907 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:27" (1/1) ... [2024-11-08 18:09:27,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:27" (1/1) ... [2024-11-08 18:09:27,916 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:27" (1/1) ... [2024-11-08 18:09:27,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:09:27,923 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:09:27,924 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:09:27,924 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:09:27,925 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:27" (1/1) ... [2024-11-08 18:09:27,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:09:27,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 18:09:27,967 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:09:27,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:09:28,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:09:28,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 18:09:28,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:09:28,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:09:28,139 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:09:28,141 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:09:28,397 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-08 18:09:28,397 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:09:28,414 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:09:28,414 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:09:28,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:09:28 BoogieIcfgContainer [2024-11-08 18:09:28,416 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:09:28,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:09:28,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:09:28,422 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:09:28,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:09:27" (1/3) ... [2024-11-08 18:09:28,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343da902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:09:28, skipping insertion in model container [2024-11-08 18:09:28,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:27" (2/3) ... [2024-11-08 18:09:28,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343da902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:09:28, skipping insertion in model container [2024-11-08 18:09:28,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:09:28" (3/3) ... [2024-11-08 18:09:28,425 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cav14_example.c [2024-11-08 18:09:28,443 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:09:28,444 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:09:28,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:09:28,510 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;@e7522e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:09:28,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:09:28,515 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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-11-08 18:09:28,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 18:09:28,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:28,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-08 18:09:28,526 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:28,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:28,547 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-08 18:09:28,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 18:09:28,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986001950] [2024-11-08 18:09:28,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:28,562 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-11-08 18:09:28,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 18:09:28,566 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-11-08 18:09:28,568 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-11-08 18:09:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:28,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 18:09:28,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:09:28,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:28,956 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:09:28,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 18:09:28,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986001950] [2024-11-08 18:09:28,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [986001950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:09:28,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:09:28,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:09:28,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249033088] [2024-11-08 18:09:28,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:09:28,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:09:28,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 18:09:28,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:09:28,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:09:28,992 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:29,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:29,043 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-08 18:09:29,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:09:29,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-11-08 18:09:29,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:29,056 INFO L225 Difference]: With dead ends: 18 [2024-11-08 18:09:29,057 INFO L226 Difference]: Without dead ends: 10 [2024-11-08 18:09:29,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-08 18:09:29,065 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:29,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:09:29,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-08 18:09:29,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-08 18:09:29,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:29,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-08 18:09:29,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-08 18:09:29,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:29,099 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-08 18:09:29,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:29,099 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-08 18:09:29,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 18:09:29,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:29,100 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-08 18:09:29,107 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-11-08 18:09:29,303 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-11-08 18:09:29,304 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:29,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:29,305 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-08 18:09:29,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 18:09:29,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360302636] [2024-11-08 18:09:29,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:29,306 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-11-08 18:09:29,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 18:09:29,313 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-11-08 18:09:29,315 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-11-08 18:09:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:29,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 18:09:29,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:09:29,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:29,651 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:09:31,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:31,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 18:09:31,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360302636] [2024-11-08 18:09:31,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [360302636] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:09:31,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:09:31,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-08 18:09:31,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935109715] [2024-11-08 18:09:31,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:09:31,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:09:31,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 18:09:31,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:09:31,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:09:31,354 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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-11-08 18:09:31,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:31,628 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2024-11-08 18:09:31,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:09:31,628 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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 8 [2024-11-08 18:09:31,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:31,629 INFO L225 Difference]: With dead ends: 21 [2024-11-08 18:09:31,630 INFO L226 Difference]: Without dead ends: 19 [2024-11-08 18:09:31,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:09:31,632 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:31,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 14 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:09:31,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-08 18:09:31,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-08 18:09:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:31,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2024-11-08 18:09:31,638 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2024-11-08 18:09:31,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:31,638 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2024-11-08 18:09:31,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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-11-08 18:09:31,638 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2024-11-08 18:09:31,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 18:09:31,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:31,639 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2024-11-08 18:09:31,651 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-11-08 18:09:31,840 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-11-08 18:09:31,840 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:31,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:31,841 INFO L85 PathProgramCache]: Analyzing trace with hash -37306491, now seen corresponding path program 2 times [2024-11-08 18:09:31,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 18:09:31,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659404554] [2024-11-08 18:09:31,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:09:31,842 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-11-08 18:09:31,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 18:09:31,848 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-11-08 18:09:31,861 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-11-08 18:09:31,979 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 18:09:31,980 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:09:31,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 18:09:31,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:09:32,384 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:32,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:09:42,991 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:42,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 18:09:42,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659404554] [2024-11-08 18:09:42,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659404554] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:09:42,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:09:42,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-08 18:09:42,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472715876] [2024-11-08 18:09:42,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:09:42,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 18:09:42,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 18:09:42,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 18:09:42,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-08 18:09:43,000 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:44,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:44,834 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-08 18:09:44,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 18:09:44,836 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-08 18:09:44,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:44,837 INFO L225 Difference]: With dead ends: 39 [2024-11-08 18:09:44,837 INFO L226 Difference]: Without dead ends: 37 [2024-11-08 18:09:44,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=255, Invalid=501, Unknown=0, NotChecked=0, Total=756 [2024-11-08 18:09:44,839 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 14 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:44,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 20 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:09:44,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-08 18:09:44,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2024-11-08 18:09:44,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 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-11-08 18:09:44,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2024-11-08 18:09:44,850 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 17 [2024-11-08 18:09:44,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:44,850 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2024-11-08 18:09:44,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:44,850 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2024-11-08 18:09:44,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 18:09:44,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:44,851 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1] [2024-11-08 18:09:44,862 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 (4)] Ended with exit code 0 [2024-11-08 18:09:45,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-11-08 18:09:45,056 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:45,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:45,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1864061253, now seen corresponding path program 3 times [2024-11-08 18:09:45,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 18:09:45,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740412034] [2024-11-08 18:09:45,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 18:09:45,058 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-11-08 18:09:45,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 18:09:45,061 INFO L229 MonitoredProcess]: Starting monitored process 5 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-11-08 18:09:45,062 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 (5)] Waiting until timeout for monitored process [2024-11-08 18:09:45,361 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-08 18:09:45,361 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:09:45,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-08 18:09:45,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:09:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 149 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 18:09:46,206 INFO L311 TraceCheckSpWp]: Computing backward predicates...