./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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/bitvector/soft_float_1-2a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 03:00:51,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 03:00:51,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 03:00:51,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 03:00:51,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 03:00:51,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 03:00:51,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 03:00:51,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 03:00:51,777 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 03:00:51,777 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 03:00:51,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 03:00:51,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 03:00:51,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 03:00:51,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 03:00:51,779 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 03:00:51,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 03:00:51,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 03:00:51,781 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 03:00:51,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 03:00:51,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 03:00:51,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 03:00:51,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 03:00:51,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 03:00:51,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 03:00:51,787 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 03:00:51,787 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 03:00:51,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 03:00:51,788 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 03:00:51,788 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 03:00:51,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 03:00:51,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 03:00:51,789 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 03:00:51,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:00:51,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 03:00:51,789 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 03:00:51,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 03:00:51,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 03:00:51,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 03:00:51,790 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 03:00:51,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 03:00:51,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 03:00:51,791 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 03:00:51,791 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 [2024-11-16 03:00:52,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 03:00:52,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 03:00:52,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 03:00:52,097 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 03:00:52,100 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 03:00:52,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2024-11-16 03:00:53,805 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 03:00:54,092 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 03:00:54,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2024-11-16 03:00:54,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69d6fd5bc/0f96352cd320472eae126d42ec4e2474/FLAGfe963d58e [2024-11-16 03:00:54,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69d6fd5bc/0f96352cd320472eae126d42ec4e2474 [2024-11-16 03:00:54,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 03:00:54,121 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 03:00:54,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 03:00:54,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 03:00:54,126 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 03:00:54,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:00:54" (1/1) ... [2024-11-16 03:00:54,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201eff42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:00:54, skipping insertion in model container [2024-11-16 03:00:54,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:00:54" (1/1) ... [2024-11-16 03:00:54,181 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 03:00:54,439 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/bitvector/soft_float_1-2a.c.cil.c[755,768] [2024-11-16 03:00:54,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:00:54,572 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 03:00:54,592 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/bitvector/soft_float_1-2a.c.cil.c[755,768] [2024-11-16 03:00:54,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:00:54,700 INFO L204 MainTranslator]: Completed translation [2024-11-16 03:00:54,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:00:54 WrapperNode [2024-11-16 03:00:54,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 03:00:54,702 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 03:00:54,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 03:00:54,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 03:00:54,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:00:54" (1/1) ... [2024-11-16 03:00:54,717 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:00:54" (1/1) ... [2024-11-16 03:00:54,743 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 190 [2024-11-16 03:00:54,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 03:00:54,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 03:00:54,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 03:00:54,745 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 03:00:54,763 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:00:54" (1/1) ... [2024-11-16 03:00:54,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:00:54" (1/1) ... [2024-11-16 03:00:54,769 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:00:54" (1/1) ... [2024-11-16 03:00:54,784 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-16 03:00:54,785 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:00:54" (1/1) ... [2024-11-16 03:00:54,785 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:00:54" (1/1) ... [2024-11-16 03:00:54,790 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:00:54" (1/1) ... [2024-11-16 03:00:54,791 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:00:54" (1/1) ... [2024-11-16 03:00:54,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:00:54" (1/1) ... [2024-11-16 03:00:54,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:00:54" (1/1) ... [2024-11-16 03:00:54,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 03:00:54,800 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 03:00:54,800 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 03:00:54,800 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 03:00:54,801 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:00:54" (1/1) ... [2024-11-16 03:00:54,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:00:54,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:00:54,843 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-16 03:00:54,845 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-16 03:00:54,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 03:00:54,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 03:00:54,892 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-16 03:00:54,892 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-16 03:00:54,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 03:00:54,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 03:00:54,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-16 03:00:54,893 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-16 03:00:54,978 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 03:00:54,981 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 03:00:55,423 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-11-16 03:00:55,424 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 03:00:55,449 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 03:00:55,450 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-16 03:00:55,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:00:55 BoogieIcfgContainer [2024-11-16 03:00:55,450 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 03:00:55,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 03:00:55,452 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 03:00:55,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 03:00:55,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:00:54" (1/3) ... [2024-11-16 03:00:55,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b161d49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:00:55, skipping insertion in model container [2024-11-16 03:00:55,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:00:54" (2/3) ... [2024-11-16 03:00:55,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b161d49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:00:55, skipping insertion in model container [2024-11-16 03:00:55,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:00:55" (3/3) ... [2024-11-16 03:00:55,456 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2024-11-16 03:00:55,468 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 03:00:55,468 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 03:00:55,506 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 03:00:55,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;@254811ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 03:00:55,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 03:00:55,513 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 96 states have internal predecessors, (142), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 03:00:55,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-16 03:00:55,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:00:55,524 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 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-16 03:00:55,524 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:00:55,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:00:55,528 INFO L85 PathProgramCache]: Analyzing trace with hash 491577872, now seen corresponding path program 1 times [2024-11-16 03:00:55,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:00:55,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669421333] [2024-11-16 03:00:55,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:00:55,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:00:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:55,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:00:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:55,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:00:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:56,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 03:00:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:56,083 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:00:56,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:00:56,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669421333] [2024-11-16 03:00:56,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669421333] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:00:56,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654120555] [2024-11-16 03:00:56,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:00:56,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:00:56,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:00:56,091 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-16 03:00:56,095 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-16 03:00:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:56,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 03:00:56,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:00:56,246 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:00:56,247 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:00:56,347 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:00:56,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654120555] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 03:00:56,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 03:00:56,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2024-11-16 03:00:56,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378223598] [2024-11-16 03:00:56,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 03:00:56,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 03:00:56,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:00:56,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 03:00:56,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-16 03:00:56,374 INFO L87 Difference]: Start difference. First operand has 105 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 96 states have internal predecessors, (142), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-16 03:00:56,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:00:56,761 INFO L93 Difference]: Finished difference Result 289 states and 464 transitions. [2024-11-16 03:00:56,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 03:00:56,764 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) Word has length 37 [2024-11-16 03:00:56,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:00:56,771 INFO L225 Difference]: With dead ends: 289 [2024-11-16 03:00:56,771 INFO L226 Difference]: Without dead ends: 181 [2024-11-16 03:00:56,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2024-11-16 03:00:56,777 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 117 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:00:56,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1514 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:00:56,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-16 03:00:56,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 172. [2024-11-16 03:00:56,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 152 states have (on average 1.4078947368421053) internal successors, (214), 153 states have internal predecessors, (214), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 18 states have call predecessors, (22), 15 states have call successors, (22) [2024-11-16 03:00:56,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 252 transitions. [2024-11-16 03:00:56,827 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 252 transitions. Word has length 37 [2024-11-16 03:00:56,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:00:56,827 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 252 transitions. [2024-11-16 03:00:56,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-16 03:00:56,828 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 252 transitions. [2024-11-16 03:00:56,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-16 03:00:56,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:00:56,831 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 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-16 03:00:56,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 03:00:57,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-16 03:00:57,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:00:57,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:00:57,034 INFO L85 PathProgramCache]: Analyzing trace with hash 761490194, now seen corresponding path program 1 times [2024-11-16 03:00:57,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:00:57,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442244563] [2024-11-16 03:00:57,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:00:57,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:00:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:57,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:00:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:57,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:00:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:57,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 03:00:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:57,175 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:00:57,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:00:57,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442244563] [2024-11-16 03:00:57,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442244563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:00:57,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:00:57,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 03:00:57,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844539901] [2024-11-16 03:00:57,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:00:57,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 03:00:57,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:00:57,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 03:00:57,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:00:57,178 INFO L87 Difference]: Start difference. First operand 172 states and 252 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:00:57,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:00:57,271 INFO L93 Difference]: Finished difference Result 346 states and 510 transitions. [2024-11-16 03:00:57,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 03:00:57,271 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2024-11-16 03:00:57,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:00:57,273 INFO L225 Difference]: With dead ends: 346 [2024-11-16 03:00:57,273 INFO L226 Difference]: Without dead ends: 238 [2024-11-16 03:00:57,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 03:00:57,275 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 34 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:00:57,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 726 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:00:57,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-16 03:00:57,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2024-11-16 03:00:57,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 212 states have (on average 1.3867924528301887) internal successors, (294), 211 states have internal predecessors, (294), 20 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (26), 26 states have call predecessors, (26), 19 states have call successors, (26) [2024-11-16 03:00:57,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 340 transitions. [2024-11-16 03:00:57,288 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 340 transitions. Word has length 41 [2024-11-16 03:00:57,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:00:57,289 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 340 transitions. [2024-11-16 03:00:57,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:00:57,289 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 340 transitions. [2024-11-16 03:00:57,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-16 03:00:57,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:00:57,291 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:00:57,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 03:00:57,291 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:00:57,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:00:57,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1899660321, now seen corresponding path program 1 times [2024-11-16 03:00:57,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:00:57,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673969837] [2024-11-16 03:00:57,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:00:57,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:00:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:57,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:00:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:57,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:00:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:57,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 03:00:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:57,336 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:00:57,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:00:57,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673969837] [2024-11-16 03:00:57,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673969837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:00:57,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:00:57,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:00:57,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350378900] [2024-11-16 03:00:57,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:00:57,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:00:57,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:00:57,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:00:57,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:00:57,338 INFO L87 Difference]: Start difference. First operand 236 states and 340 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:00:57,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:00:57,389 INFO L93 Difference]: Finished difference Result 404 states and 584 transitions. [2024-11-16 03:00:57,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:00:57,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-16 03:00:57,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:00:57,392 INFO L225 Difference]: With dead ends: 404 [2024-11-16 03:00:57,392 INFO L226 Difference]: Without dead ends: 333 [2024-11-16 03:00:57,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-16 03:00:57,394 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 39 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:00:57,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 456 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:00:57,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-16 03:00:57,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2024-11-16 03:00:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 305 states have (on average 1.360655737704918) internal successors, (415), 304 states have internal predecessors, (415), 24 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (30), 30 states have call predecessors, (30), 23 states have call successors, (30) [2024-11-16 03:00:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 469 transitions. [2024-11-16 03:00:57,410 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 469 transitions. Word has length 44 [2024-11-16 03:00:57,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:00:57,410 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 469 transitions. [2024-11-16 03:00:57,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:00:57,411 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 469 transitions. [2024-11-16 03:00:57,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-16 03:00:57,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:00:57,412 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:00:57,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 03:00:57,412 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:00:57,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:00:57,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2118918615, now seen corresponding path program 1 times [2024-11-16 03:00:57,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:00:57,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086564111] [2024-11-16 03:00:57,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:00:57,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:00:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:57,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:00:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:57,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:00:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:57,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 03:00:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:00:57,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:00:57,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086564111] [2024-11-16 03:00:57,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086564111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:00:57,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:00:57,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:00:57,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39329562] [2024-11-16 03:00:57,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:00:57,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:00:57,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:00:57,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:00:57,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:00:57,454 INFO L87 Difference]: Start difference. First operand 333 states and 469 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:00:57,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:00:57,477 INFO L93 Difference]: Finished difference Result 345 states and 482 transitions. [2024-11-16 03:00:57,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:00:57,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-16 03:00:57,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:00:57,479 INFO L225 Difference]: With dead ends: 345 [2024-11-16 03:00:57,479 INFO L226 Difference]: Without dead ends: 337 [2024-11-16 03:00:57,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-16 03:00:57,480 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:00:57,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 399 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:00:57,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-16 03:00:57,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2024-11-16 03:00:57,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 309 states have (on average 1.3559870550161812) internal successors, (419), 308 states have internal predecessors, (419), 24 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (30), 30 states have call predecessors, (30), 23 states have call successors, (30) [2024-11-16 03:00:57,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 473 transitions. [2024-11-16 03:00:57,492 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 473 transitions. Word has length 46 [2024-11-16 03:00:57,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:00:57,492 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 473 transitions. [2024-11-16 03:00:57,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:00:57,492 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 473 transitions. [2024-11-16 03:00:57,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-16 03:00:57,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:00:57,493 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:00:57,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 03:00:57,494 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:00:57,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:00:57,494 INFO L85 PathProgramCache]: Analyzing trace with hash -376108280, now seen corresponding path program 1 times [2024-11-16 03:00:57,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:00:57,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447363257] [2024-11-16 03:00:57,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:00:57,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:00:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:57,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:00:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:57,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:00:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:57,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 03:00:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:57,539 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:00:57,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:00:57,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447363257] [2024-11-16 03:00:57,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447363257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:00:57,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:00:57,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 03:00:57,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091269443] [2024-11-16 03:00:57,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:00:57,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 03:00:57,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:00:57,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 03:00:57,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:00:57,541 INFO L87 Difference]: Start difference. First operand 337 states and 473 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:00:57,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:00:57,578 INFO L93 Difference]: Finished difference Result 345 states and 480 transitions. [2024-11-16 03:00:57,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 03:00:57,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-16 03:00:57,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:00:57,580 INFO L225 Difference]: With dead ends: 345 [2024-11-16 03:00:57,580 INFO L226 Difference]: Without dead ends: 337 [2024-11-16 03:00:57,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-16 03:00:57,581 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 3 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:00:57,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 538 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:00:57,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-16 03:00:57,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 333. [2024-11-16 03:00:57,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 305 states have (on average 1.3508196721311476) internal successors, (412), 304 states have internal predecessors, (412), 24 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (30), 30 states have call predecessors, (30), 23 states have call successors, (30) [2024-11-16 03:00:57,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 466 transitions. [2024-11-16 03:00:57,592 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 466 transitions. Word has length 46 [2024-11-16 03:00:57,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:00:57,592 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 466 transitions. [2024-11-16 03:00:57,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:00:57,592 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 466 transitions. [2024-11-16 03:00:57,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-16 03:00:57,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:00:57,593 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1] [2024-11-16 03:00:57,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 03:00:57,594 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:00:57,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:00:57,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1149243209, now seen corresponding path program 1 times [2024-11-16 03:00:57,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:00:57,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98515404] [2024-11-16 03:00:57,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:00:57,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:00:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:57,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:00:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:57,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-16 03:00:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:57,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 03:00:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:57,673 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 03:00:57,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:00:57,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98515404] [2024-11-16 03:00:57,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98515404] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:00:57,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684823394] [2024-11-16 03:00:57,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:00:57,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:00:57,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:00:57,677 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:00:57,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 03:00:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:57,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 03:00:57,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:00:57,743 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:00:57,743 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:00:57,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684823394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:00:57,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:00:57,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-16 03:00:57,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110561017] [2024-11-16 03:00:57,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:00:57,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:00:57,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:00:57,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:00:57,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:00:57,745 INFO L87 Difference]: Start difference. First operand 333 states and 466 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:00:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:00:57,768 INFO L93 Difference]: Finished difference Result 432 states and 608 transitions. [2024-11-16 03:00:57,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:00:57,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-16 03:00:57,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:00:57,770 INFO L225 Difference]: With dead ends: 432 [2024-11-16 03:00:57,770 INFO L226 Difference]: Without dead ends: 361 [2024-11-16 03:00:57,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:00:57,771 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 41 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:00:57,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 279 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:00:57,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-16 03:00:57,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2024-11-16 03:00:57,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 335 states have (on average 1.3313432835820895) internal successors, (446), 332 states have internal predecessors, (446), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (28), 28 states have call predecessors, (28), 21 states have call successors, (28) [2024-11-16 03:00:57,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 496 transitions. [2024-11-16 03:00:57,780 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 496 transitions. Word has length 46 [2024-11-16 03:00:57,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:00:57,780 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 496 transitions. [2024-11-16 03:00:57,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:00:57,780 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 496 transitions. [2024-11-16 03:00:57,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-16 03:00:57,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:00:57,781 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1] [2024-11-16 03:00:57,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 03:00:57,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 03:00:57,982 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:00:57,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:00:57,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1497692234, now seen corresponding path program 1 times [2024-11-16 03:00:57,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:00:57,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591322412] [2024-11-16 03:00:57,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:00:57,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:00:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:58,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:00:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:58,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:00:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:58,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 03:00:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:58,094 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:00:58,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:00:58,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591322412] [2024-11-16 03:00:58,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591322412] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:00:58,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690471867] [2024-11-16 03:00:58,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:00:58,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:00:58,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:00:58,102 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:00:58,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 03:00:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:58,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-16 03:00:58,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:00:58,251 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 03:00:58,251 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:00:58,343 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:00:58,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690471867] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 03:00:58,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-16 03:00:58,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 11] total 16 [2024-11-16 03:00:58,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598116279] [2024-11-16 03:00:58,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:00:58,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 03:00:58,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:00:58,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 03:00:58,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-16 03:00:58,345 INFO L87 Difference]: Start difference. First operand 361 states and 496 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:00:58,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:00:58,458 INFO L93 Difference]: Finished difference Result 597 states and 819 transitions. [2024-11-16 03:00:58,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 03:00:58,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2024-11-16 03:00:58,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:00:58,460 INFO L225 Difference]: With dead ends: 597 [2024-11-16 03:00:58,460 INFO L226 Difference]: Without dead ends: 452 [2024-11-16 03:00:58,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-16 03:00:58,461 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 46 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:00:58,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 552 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:00:58,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-16 03:00:58,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 373. [2024-11-16 03:00:58,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 347 states have (on average 1.319884726224784) internal successors, (458), 344 states have internal predecessors, (458), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (28), 28 states have call predecessors, (28), 21 states have call successors, (28) [2024-11-16 03:00:58,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 508 transitions. [2024-11-16 03:00:58,471 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 508 transitions. Word has length 47 [2024-11-16 03:00:58,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:00:58,471 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 508 transitions. [2024-11-16 03:00:58,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:00:58,471 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 508 transitions. [2024-11-16 03:00:58,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-16 03:00:58,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:00:58,472 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1] [2024-11-16 03:00:58,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 03:00:58,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:00:58,677 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:00:58,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:00:58,677 INFO L85 PathProgramCache]: Analyzing trace with hash 992133609, now seen corresponding path program 1 times [2024-11-16 03:00:58,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:00:58,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800031565] [2024-11-16 03:00:58,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:00:58,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:00:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:58,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:00:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:58,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:00:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:58,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 03:00:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:58,796 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:00:58,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:00:58,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800031565] [2024-11-16 03:00:58,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800031565] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:00:58,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52290433] [2024-11-16 03:00:58,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:00:58,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:00:58,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:00:58,801 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:00:58,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 03:00:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:58,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-16 03:00:58,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:00:58,959 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 03:00:58,959 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:00:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 03:00:59,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52290433] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 03:00:59,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 03:00:59,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 23 [2024-11-16 03:00:59,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884285727] [2024-11-16 03:00:59,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 03:00:59,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-16 03:00:59,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:00:59,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-16 03:00:59,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2024-11-16 03:00:59,132 INFO L87 Difference]: Start difference. First operand 373 states and 508 transitions. Second operand has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 18 states have internal predecessors, (65), 5 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-16 03:00:59,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:00:59,554 INFO L93 Difference]: Finished difference Result 516 states and 708 transitions. [2024-11-16 03:00:59,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-16 03:00:59,555 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 18 states have internal predecessors, (65), 5 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) Word has length 47 [2024-11-16 03:00:59,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:00:59,557 INFO L225 Difference]: With dead ends: 516 [2024-11-16 03:00:59,557 INFO L226 Difference]: Without dead ends: 353 [2024-11-16 03:00:59,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2024-11-16 03:00:59,558 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 40 mSDsluCounter, 2097 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 2227 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:00:59,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 2227 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:00:59,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-16 03:00:59,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 337. [2024-11-16 03:00:59,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 314 states have (on average 1.286624203821656) internal successors, (404), 310 states have internal predecessors, (404), 18 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (31), 26 states have call predecessors, (31), 17 states have call successors, (31) [2024-11-16 03:00:59,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 453 transitions. [2024-11-16 03:00:59,565 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 453 transitions. Word has length 47 [2024-11-16 03:00:59,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:00:59,565 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 453 transitions. [2024-11-16 03:00:59,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 18 states have internal predecessors, (65), 5 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-16 03:00:59,566 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 453 transitions. [2024-11-16 03:00:59,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-16 03:00:59,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:00:59,567 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1] [2024-11-16 03:00:59,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 03:00:59,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:00:59,767 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:00:59,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:00:59,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1801208515, now seen corresponding path program 1 times [2024-11-16 03:00:59,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:00:59,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219629076] [2024-11-16 03:00:59,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:00:59,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:00:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:59,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:00:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:59,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:00:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:59,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 03:00:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:59,806 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:00:59,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:00:59,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219629076] [2024-11-16 03:00:59,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219629076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:00:59,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:00:59,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:00:59,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554439908] [2024-11-16 03:00:59,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:00:59,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:00:59,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:00:59,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:00:59,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:00:59,808 INFO L87 Difference]: Start difference. First operand 337 states and 453 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:00:59,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:00:59,837 INFO L93 Difference]: Finished difference Result 546 states and 735 transitions. [2024-11-16 03:00:59,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:00:59,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-16 03:00:59,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:00:59,839 INFO L225 Difference]: With dead ends: 546 [2024-11-16 03:00:59,839 INFO L226 Difference]: Without dead ends: 503 [2024-11-16 03:00:59,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-16 03:00:59,840 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 53 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:00:59,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 462 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:00:59,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-11-16 03:00:59,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 378. [2024-11-16 03:00:59,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 353 states have (on average 1.2946175637393769) internal successors, (457), 349 states have internal predecessors, (457), 20 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (33), 28 states have call predecessors, (33), 19 states have call successors, (33) [2024-11-16 03:00:59,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 510 transitions. [2024-11-16 03:00:59,849 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 510 transitions. Word has length 48 [2024-11-16 03:00:59,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:00:59,849 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 510 transitions. [2024-11-16 03:00:59,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:00:59,849 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 510 transitions. [2024-11-16 03:00:59,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-16 03:00:59,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:00:59,850 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:00:59,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 03:00:59,851 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:00:59,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:00:59,851 INFO L85 PathProgramCache]: Analyzing trace with hash -2090863611, now seen corresponding path program 1 times [2024-11-16 03:00:59,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:00:59,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268694239] [2024-11-16 03:00:59,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:00:59,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:00:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:59,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:00:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:59,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:00:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:59,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 03:00:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:00:59,972 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:00:59,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:00:59,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268694239] [2024-11-16 03:00:59,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268694239] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:00:59,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316265725] [2024-11-16 03:00:59,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:00:59,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:00:59,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:00:59,974 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:00:59,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-16 03:01:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:00,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-16 03:01:00,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:00,107 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:00,107 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:00,206 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:00,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316265725] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 03:01:00,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-16 03:01:00,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 11] total 15 [2024-11-16 03:01:00,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278329308] [2024-11-16 03:01:00,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:00,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 03:01:00,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:00,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 03:01:00,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-16 03:01:00,208 INFO L87 Difference]: Start difference. First operand 378 states and 510 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:00,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:00,383 INFO L93 Difference]: Finished difference Result 575 states and 785 transitions. [2024-11-16 03:01:00,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 03:01:00,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-16 03:01:00,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:00,388 INFO L225 Difference]: With dead ends: 575 [2024-11-16 03:01:00,388 INFO L226 Difference]: Without dead ends: 536 [2024-11-16 03:01:00,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-16 03:01:00,393 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 49 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:00,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 678 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 03:01:00,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-16 03:01:00,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 484. [2024-11-16 03:01:00,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 453 states have (on average 1.2869757174392935) internal successors, (583), 450 states have internal predecessors, (583), 26 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (39), 34 states have call predecessors, (39), 25 states have call successors, (39) [2024-11-16 03:01:00,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 648 transitions. [2024-11-16 03:01:00,423 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 648 transitions. Word has length 50 [2024-11-16 03:01:00,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:00,423 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 648 transitions. [2024-11-16 03:01:00,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:00,423 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 648 transitions. [2024-11-16 03:01:00,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-16 03:01:00,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:00,429 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:01:00,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-16 03:01:00,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-16 03:01:00,630 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:00,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:00,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1961780892, now seen corresponding path program 1 times [2024-11-16 03:01:00,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:00,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038696807] [2024-11-16 03:01:00,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:00,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:00,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:00,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:00,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 03:01:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:00,689 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:00,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:00,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038696807] [2024-11-16 03:01:00,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038696807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:00,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:00,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:01:00,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966498928] [2024-11-16 03:01:00,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:00,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:01:00,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:00,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:01:00,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:01:00,692 INFO L87 Difference]: Start difference. First operand 484 states and 648 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:00,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:00,751 INFO L93 Difference]: Finished difference Result 500 states and 665 transitions. [2024-11-16 03:01:00,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:01:00,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-16 03:01:00,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:00,754 INFO L225 Difference]: With dead ends: 500 [2024-11-16 03:01:00,754 INFO L226 Difference]: Without dead ends: 439 [2024-11-16 03:01:00,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-16 03:01:00,755 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:00,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 396 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:00,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-16 03:01:00,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 433. [2024-11-16 03:01:00,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 402 states have (on average 1.3059701492537314) internal successors, (525), 401 states have internal predecessors, (525), 26 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (37), 32 states have call predecessors, (37), 25 states have call successors, (37) [2024-11-16 03:01:00,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 588 transitions. [2024-11-16 03:01:00,771 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 588 transitions. Word has length 50 [2024-11-16 03:01:00,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:00,771 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 588 transitions. [2024-11-16 03:01:00,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:00,771 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 588 transitions. [2024-11-16 03:01:00,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-16 03:01:00,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:00,773 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:00,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 03:01:00,773 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:00,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:00,774 INFO L85 PathProgramCache]: Analyzing trace with hash 457989447, now seen corresponding path program 1 times [2024-11-16 03:01:00,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:00,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483096561] [2024-11-16 03:01:00,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:00,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:00,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:00,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-16 03:01:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:00,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 03:01:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:00,871 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 03:01:00,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:00,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483096561] [2024-11-16 03:01:00,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483096561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:01:00,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380938929] [2024-11-16 03:01:00,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:00,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:01:00,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:01:00,877 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:01:00,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-16 03:01:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:00,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 03:01:00,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:00,958 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-16 03:01:00,958 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:00,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380938929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:00,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:01:00,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-16 03:01:00,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43555280] [2024-11-16 03:01:00,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:00,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:01:00,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:00,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:01:00,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:01:00,960 INFO L87 Difference]: Start difference. First operand 433 states and 588 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:01,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:01,001 INFO L93 Difference]: Finished difference Result 683 states and 924 transitions. [2024-11-16 03:01:01,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:01:01,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-11-16 03:01:01,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:01,005 INFO L225 Difference]: With dead ends: 683 [2024-11-16 03:01:01,005 INFO L226 Difference]: Without dead ends: 597 [2024-11-16 03:01:01,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:01:01,007 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 52 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:01,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 300 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:01,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-11-16 03:01:01,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 502. [2024-11-16 03:01:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 468 states have (on average 1.3076923076923077) internal successors, (612), 467 states have internal predecessors, (612), 29 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (39), 34 states have call predecessors, (39), 27 states have call successors, (39) [2024-11-16 03:01:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 680 transitions. [2024-11-16 03:01:01,033 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 680 transitions. Word has length 52 [2024-11-16 03:01:01,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:01,033 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 680 transitions. [2024-11-16 03:01:01,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:01,033 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 680 transitions. [2024-11-16 03:01:01,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-16 03:01:01,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:01,035 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:01,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-16 03:01:01,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:01:01,236 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:01,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:01,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1335438096, now seen corresponding path program 1 times [2024-11-16 03:01:01,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:01,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686413715] [2024-11-16 03:01:01,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:01,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:01,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:01,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:01,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 03:01:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:01,515 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:01,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:01,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686413715] [2024-11-16 03:01:01,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686413715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:01,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:01,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 03:01:01,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610471925] [2024-11-16 03:01:01,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:01,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 03:01:01,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:01,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 03:01:01,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 03:01:01,517 INFO L87 Difference]: Start difference. First operand 502 states and 680 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:01,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:01,728 INFO L93 Difference]: Finished difference Result 1105 states and 1528 transitions. [2024-11-16 03:01:01,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 03:01:01,728 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2024-11-16 03:01:01,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:01,732 INFO L225 Difference]: With dead ends: 1105 [2024-11-16 03:01:01,732 INFO L226 Difference]: Without dead ends: 843 [2024-11-16 03:01:01,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-16 03:01:01,733 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 131 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:01,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1058 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 03:01:01,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2024-11-16 03:01:01,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 791. [2024-11-16 03:01:01,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 741 states have (on average 1.3063427800269904) internal successors, (968), 740 states have internal predecessors, (968), 45 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (55), 52 states have call predecessors, (55), 43 states have call successors, (55) [2024-11-16 03:01:01,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1068 transitions. [2024-11-16 03:01:01,754 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1068 transitions. Word has length 53 [2024-11-16 03:01:01,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:01,754 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 1068 transitions. [2024-11-16 03:01:01,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:01,755 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1068 transitions. [2024-11-16 03:01:01,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-16 03:01:01,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:01,756 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:01,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 03:01:01,757 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:01,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:01,757 INFO L85 PathProgramCache]: Analyzing trace with hash -461513263, now seen corresponding path program 1 times [2024-11-16 03:01:01,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:01,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669472964] [2024-11-16 03:01:01,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:01,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:01,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:01,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:01,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 03:01:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:01,934 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:01,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:01,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669472964] [2024-11-16 03:01:01,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669472964] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:01:01,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958134693] [2024-11-16 03:01:01,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:01,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:01:01,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:01:01,936 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:01:01,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-16 03:01:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:02,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-16 03:01:02,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:02,206 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:02,206 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:02,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958134693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:02,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:01:02,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 15 [2024-11-16 03:01:02,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645456465] [2024-11-16 03:01:02,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:02,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 03:01:02,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:02,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 03:01:02,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-16 03:01:02,208 INFO L87 Difference]: Start difference. First operand 791 states and 1068 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:01:02,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:02,595 INFO L93 Difference]: Finished difference Result 1554 states and 2116 transitions. [2024-11-16 03:01:02,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 03:01:02,596 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2024-11-16 03:01:02,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:02,601 INFO L225 Difference]: With dead ends: 1554 [2024-11-16 03:01:02,601 INFO L226 Difference]: Without dead ends: 1241 [2024-11-16 03:01:02,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-16 03:01:02,602 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 186 mSDsluCounter, 1409 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:02,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1563 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:01:02,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2024-11-16 03:01:02,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1044. [2024-11-16 03:01:02,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 977 states have (on average 1.3203684749232343) internal successors, (1290), 971 states have internal predecessors, (1290), 61 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (75), 73 states have call predecessors, (75), 59 states have call successors, (75) [2024-11-16 03:01:02,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1426 transitions. [2024-11-16 03:01:02,636 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1426 transitions. Word has length 53 [2024-11-16 03:01:02,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:02,637 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1426 transitions. [2024-11-16 03:01:02,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:01:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1426 transitions. [2024-11-16 03:01:02,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-16 03:01:02,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:02,640 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:02,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-16 03:01:02,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:01:02,843 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:02,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:02,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1598589674, now seen corresponding path program 1 times [2024-11-16 03:01:02,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:02,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451407614] [2024-11-16 03:01:02,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:02,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:02,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:03,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:03,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 03:01:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:03,004 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:03,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:03,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451407614] [2024-11-16 03:01:03,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451407614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:03,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:03,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 03:01:03,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699713976] [2024-11-16 03:01:03,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:03,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 03:01:03,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:03,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 03:01:03,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 03:01:03,005 INFO L87 Difference]: Start difference. First operand 1044 states and 1426 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:03,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:03,317 INFO L93 Difference]: Finished difference Result 1473 states and 2041 transitions. [2024-11-16 03:01:03,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 03:01:03,317 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2024-11-16 03:01:03,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:03,323 INFO L225 Difference]: With dead ends: 1473 [2024-11-16 03:01:03,323 INFO L226 Difference]: Without dead ends: 1433 [2024-11-16 03:01:03,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 03:01:03,324 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 65 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:03,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 984 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:01:03,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2024-11-16 03:01:03,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1156. [2024-11-16 03:01:03,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1080 states have (on average 1.3175925925925926) internal successors, (1423), 1075 states have internal predecessors, (1423), 70 states have call successors, (70), 3 states have call predecessors, (70), 5 states have return successors, (84), 82 states have call predecessors, (84), 68 states have call successors, (84) [2024-11-16 03:01:03,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1577 transitions. [2024-11-16 03:01:03,362 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1577 transitions. Word has length 54 [2024-11-16 03:01:03,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:03,391 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1577 transitions. [2024-11-16 03:01:03,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:03,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1577 transitions. [2024-11-16 03:01:03,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-16 03:01:03,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:03,392 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:03,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 03:01:03,393 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:03,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:03,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1089873563, now seen corresponding path program 1 times [2024-11-16 03:01:03,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:03,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852306361] [2024-11-16 03:01:03,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:03,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:03,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:03,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:03,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 03:01:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:03,440 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:03,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:03,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852306361] [2024-11-16 03:01:03,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852306361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:03,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:03,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:01:03,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093079010] [2024-11-16 03:01:03,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:03,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:01:03,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:03,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:01:03,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:01:03,443 INFO L87 Difference]: Start difference. First operand 1156 states and 1577 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:03,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:03,495 INFO L93 Difference]: Finished difference Result 1226 states and 1662 transitions. [2024-11-16 03:01:03,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:01:03,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2024-11-16 03:01:03,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:03,500 INFO L225 Difference]: With dead ends: 1226 [2024-11-16 03:01:03,500 INFO L226 Difference]: Without dead ends: 1127 [2024-11-16 03:01:03,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-16 03:01:03,501 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 51 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:03,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 393 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:03,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2024-11-16 03:01:03,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1054. [2024-11-16 03:01:03,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 983 states have (on average 1.2899287894201423) internal successors, (1268), 978 states have internal predecessors, (1268), 65 states have call successors, (65), 3 states have call predecessors, (65), 5 states have return successors, (79), 77 states have call predecessors, (79), 63 states have call successors, (79) [2024-11-16 03:01:03,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1412 transitions. [2024-11-16 03:01:03,537 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1412 transitions. Word has length 54 [2024-11-16 03:01:03,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:03,538 INFO L471 AbstractCegarLoop]: Abstraction has 1054 states and 1412 transitions. [2024-11-16 03:01:03,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:03,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1412 transitions. [2024-11-16 03:01:03,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-16 03:01:03,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:03,540 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:03,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 03:01:03,540 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:03,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:03,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1022866810, now seen corresponding path program 1 times [2024-11-16 03:01:03,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:03,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183768822] [2024-11-16 03:01:03,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:03,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:03,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:03,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:03,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 03:01:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:03,605 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:03,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:03,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183768822] [2024-11-16 03:01:03,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183768822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:03,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:03,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 03:01:03,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581891125] [2024-11-16 03:01:03,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:03,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 03:01:03,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:03,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 03:01:03,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:01:03,608 INFO L87 Difference]: Start difference. First operand 1054 states and 1412 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:03,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:03,749 INFO L93 Difference]: Finished difference Result 1221 states and 1625 transitions. [2024-11-16 03:01:03,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 03:01:03,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2024-11-16 03:01:03,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:03,754 INFO L225 Difference]: With dead ends: 1221 [2024-11-16 03:01:03,754 INFO L226 Difference]: Without dead ends: 1183 [2024-11-16 03:01:03,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:01:03,756 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 48 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:03,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 502 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:03,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2024-11-16 03:01:03,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1131. [2024-11-16 03:01:03,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 1054 states have (on average 1.2922201138519924) internal successors, (1362), 1052 states have internal predecessors, (1362), 71 states have call successors, (71), 3 states have call predecessors, (71), 5 states have return successors, (85), 81 states have call predecessors, (85), 69 states have call successors, (85) [2024-11-16 03:01:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1518 transitions. [2024-11-16 03:01:03,793 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1518 transitions. Word has length 54 [2024-11-16 03:01:03,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:03,793 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 1518 transitions. [2024-11-16 03:01:03,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:03,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1518 transitions. [2024-11-16 03:01:03,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-16 03:01:03,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:03,796 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:03,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 03:01:03,796 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:03,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:03,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1040941836, now seen corresponding path program 1 times [2024-11-16 03:01:03,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:03,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476087272] [2024-11-16 03:01:03,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:03,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:03,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:03,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:03,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 03:01:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:03,837 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:03,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:03,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476087272] [2024-11-16 03:01:03,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476087272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:03,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:03,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:01:03,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100110488] [2024-11-16 03:01:03,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:03,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:01:03,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:03,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:01:03,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:01:03,839 INFO L87 Difference]: Start difference. First operand 1131 states and 1518 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:03,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:03,881 INFO L93 Difference]: Finished difference Result 1141 states and 1527 transitions. [2024-11-16 03:01:03,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:01:03,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2024-11-16 03:01:03,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:03,886 INFO L225 Difference]: With dead ends: 1141 [2024-11-16 03:01:03,886 INFO L226 Difference]: Without dead ends: 1085 [2024-11-16 03:01:03,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-16 03:01:03,888 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:03,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 393 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:03,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2024-11-16 03:01:03,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1000. [2024-11-16 03:01:03,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 930 states have (on average 1.310752688172043) internal successors, (1219), 930 states have internal predecessors, (1219), 64 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (75), 71 states have call predecessors, (75), 61 states have call successors, (75) [2024-11-16 03:01:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1358 transitions. [2024-11-16 03:01:03,929 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1358 transitions. Word has length 56 [2024-11-16 03:01:03,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:03,929 INFO L471 AbstractCegarLoop]: Abstraction has 1000 states and 1358 transitions. [2024-11-16 03:01:03,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:03,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1358 transitions. [2024-11-16 03:01:03,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-16 03:01:03,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:03,931 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:03,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 03:01:03,932 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:03,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:03,932 INFO L85 PathProgramCache]: Analyzing trace with hash 608017704, now seen corresponding path program 1 times [2024-11-16 03:01:03,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:03,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208280573] [2024-11-16 03:01:03,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:03,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:04,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:04,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:04,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 03:01:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:04,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:04,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208280573] [2024-11-16 03:01:04,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208280573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:04,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:04,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 03:01:04,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739524275] [2024-11-16 03:01:04,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:04,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 03:01:04,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:04,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 03:01:04,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:01:04,111 INFO L87 Difference]: Start difference. First operand 1000 states and 1358 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:04,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:04,365 INFO L93 Difference]: Finished difference Result 1394 states and 1903 transitions. [2024-11-16 03:01:04,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 03:01:04,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2024-11-16 03:01:04,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:04,371 INFO L225 Difference]: With dead ends: 1394 [2024-11-16 03:01:04,371 INFO L226 Difference]: Without dead ends: 1333 [2024-11-16 03:01:04,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 03:01:04,372 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 56 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:04,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 640 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 03:01:04,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2024-11-16 03:01:04,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1023. [2024-11-16 03:01:04,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 949 states have (on average 1.320337197049526) internal successors, (1253), 950 states have internal predecessors, (1253), 68 states have call successors, (68), 3 states have call predecessors, (68), 5 states have return successors, (75), 73 states have call predecessors, (75), 65 states have call successors, (75) [2024-11-16 03:01:04,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1396 transitions. [2024-11-16 03:01:04,412 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1396 transitions. Word has length 56 [2024-11-16 03:01:04,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:04,412 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1396 transitions. [2024-11-16 03:01:04,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:04,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1396 transitions. [2024-11-16 03:01:04,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-16 03:01:04,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:04,414 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:04,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 03:01:04,414 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:04,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:04,415 INFO L85 PathProgramCache]: Analyzing trace with hash -2130272950, now seen corresponding path program 1 times [2024-11-16 03:01:04,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:04,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541953476] [2024-11-16 03:01:04,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:04,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:04,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:04,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:04,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:04,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 03:01:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:04,451 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:04,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:04,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541953476] [2024-11-16 03:01:04,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541953476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:04,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:04,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:01:04,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213827202] [2024-11-16 03:01:04,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:04,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:01:04,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:04,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:01:04,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:01:04,453 INFO L87 Difference]: Start difference. First operand 1023 states and 1396 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:04,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:04,520 INFO L93 Difference]: Finished difference Result 2044 states and 2795 transitions. [2024-11-16 03:01:04,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:01:04,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 57 [2024-11-16 03:01:04,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:04,524 INFO L225 Difference]: With dead ends: 2044 [2024-11-16 03:01:04,525 INFO L226 Difference]: Without dead ends: 1036 [2024-11-16 03:01:04,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:01:04,527 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 13 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:04,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 242 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:04,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2024-11-16 03:01:04,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1029. [2024-11-16 03:01:04,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 955 states have (on average 1.3193717277486912) internal successors, (1260), 956 states have internal predecessors, (1260), 68 states have call successors, (68), 3 states have call predecessors, (68), 5 states have return successors, (75), 73 states have call predecessors, (75), 65 states have call successors, (75) [2024-11-16 03:01:04,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1403 transitions. [2024-11-16 03:01:04,563 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1403 transitions. Word has length 57 [2024-11-16 03:01:04,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:04,564 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1403 transitions. [2024-11-16 03:01:04,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:04,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1403 transitions. [2024-11-16 03:01:04,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-16 03:01:04,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:04,566 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:04,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 03:01:04,566 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:04,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:04,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1208575097, now seen corresponding path program 1 times [2024-11-16 03:01:04,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:04,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112180610] [2024-11-16 03:01:04,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:04,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:04,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:04,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:04,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 03:01:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:04,605 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 03:01:04,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:04,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112180610] [2024-11-16 03:01:04,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112180610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:04,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:04,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:01:04,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918833717] [2024-11-16 03:01:04,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:04,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:01:04,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:04,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:01:04,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:01:04,607 INFO L87 Difference]: Start difference. First operand 1029 states and 1403 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:04,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:04,668 INFO L93 Difference]: Finished difference Result 2049 states and 2800 transitions. [2024-11-16 03:01:04,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:01:04,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 58 [2024-11-16 03:01:04,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:04,672 INFO L225 Difference]: With dead ends: 2049 [2024-11-16 03:01:04,673 INFO L226 Difference]: Without dead ends: 1035 [2024-11-16 03:01:04,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:01:04,675 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 7 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:04,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 244 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:04,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2024-11-16 03:01:04,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1031. [2024-11-16 03:01:04,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 957 states have (on average 1.3187042842215255) internal successors, (1262), 958 states have internal predecessors, (1262), 68 states have call successors, (68), 3 states have call predecessors, (68), 5 states have return successors, (75), 73 states have call predecessors, (75), 65 states have call successors, (75) [2024-11-16 03:01:04,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1405 transitions. [2024-11-16 03:01:04,733 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1405 transitions. Word has length 58 [2024-11-16 03:01:04,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:04,733 INFO L471 AbstractCegarLoop]: Abstraction has 1031 states and 1405 transitions. [2024-11-16 03:01:04,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:04,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1405 transitions. [2024-11-16 03:01:04,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-16 03:01:04,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:04,736 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:04,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-16 03:01:04,736 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:04,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:04,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1186312701, now seen corresponding path program 1 times [2024-11-16 03:01:04,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:04,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230050285] [2024-11-16 03:01:04,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:04,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:04,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:04,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:04,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 03:01:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:04,836 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-16 03:01:04,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:04,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230050285] [2024-11-16 03:01:04,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230050285] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:01:04,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507625462] [2024-11-16 03:01:04,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:04,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:01:04,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:01:04,839 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:01:04,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-16 03:01:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:04,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 03:01:04,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:04,972 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 03:01:04,972 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:04,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507625462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:04,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:01:04,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-16 03:01:04,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885944413] [2024-11-16 03:01:04,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:04,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:01:04,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:04,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:01:04,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:01:04,976 INFO L87 Difference]: Start difference. First operand 1031 states and 1405 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:01:05,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:05,055 INFO L93 Difference]: Finished difference Result 2055 states and 2806 transitions. [2024-11-16 03:01:05,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:01:05,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-11-16 03:01:05,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:05,060 INFO L225 Difference]: With dead ends: 2055 [2024-11-16 03:01:05,060 INFO L226 Difference]: Without dead ends: 1039 [2024-11-16 03:01:05,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:01:05,064 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 8 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:05,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 253 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:05,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2024-11-16 03:01:05,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 1029. [2024-11-16 03:01:05,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 955 states have (on average 1.318324607329843) internal successors, (1259), 956 states have internal predecessors, (1259), 68 states have call successors, (68), 3 states have call predecessors, (68), 5 states have return successors, (75), 73 states have call predecessors, (75), 65 states have call successors, (75) [2024-11-16 03:01:05,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1402 transitions. [2024-11-16 03:01:05,104 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1402 transitions. Word has length 59 [2024-11-16 03:01:05,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:05,104 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1402 transitions. [2024-11-16 03:01:05,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:01:05,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1402 transitions. [2024-11-16 03:01:05,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-16 03:01:05,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:05,106 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:05,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-16 03:01:05,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-16 03:01:05,311 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:05,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:05,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1083703728, now seen corresponding path program 1 times [2024-11-16 03:01:05,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:05,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406985883] [2024-11-16 03:01:05,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:05,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:05,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:05,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:05,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 03:01:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 03:01:05,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:05,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406985883] [2024-11-16 03:01:05,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406985883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:01:05,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453446597] [2024-11-16 03:01:05,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:05,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:01:05,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:01:05,459 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:01:05,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-16 03:01:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:05,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-16 03:01:05,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:05,560 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 03:01:05,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:05,712 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 03:01:05,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453446597] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 03:01:05,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 03:01:05,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 13 [2024-11-16 03:01:05,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803678471] [2024-11-16 03:01:05,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 03:01:05,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 03:01:05,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:05,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 03:01:05,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-16 03:01:05,714 INFO L87 Difference]: Start difference. First operand 1029 states and 1402 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-16 03:01:05,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:05,930 INFO L93 Difference]: Finished difference Result 1246 states and 1693 transitions. [2024-11-16 03:01:05,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 03:01:05,931 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 59 [2024-11-16 03:01:05,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:05,935 INFO L225 Difference]: With dead ends: 1246 [2024-11-16 03:01:05,935 INFO L226 Difference]: Without dead ends: 1047 [2024-11-16 03:01:05,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-16 03:01:05,936 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 199 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:05,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1083 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 03:01:05,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2024-11-16 03:01:05,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 974. [2024-11-16 03:01:05,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 903 states have (on average 1.3122923588039868) internal successors, (1185), 904 states have internal predecessors, (1185), 65 states have call successors, (65), 3 states have call predecessors, (65), 5 states have return successors, (72), 70 states have call predecessors, (72), 62 states have call successors, (72) [2024-11-16 03:01:05,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1322 transitions. [2024-11-16 03:01:05,972 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1322 transitions. Word has length 59 [2024-11-16 03:01:05,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:05,973 INFO L471 AbstractCegarLoop]: Abstraction has 974 states and 1322 transitions. [2024-11-16 03:01:05,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-16 03:01:05,973 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1322 transitions. [2024-11-16 03:01:05,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-16 03:01:05,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:05,974 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:05,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-16 03:01:06,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:01:06,176 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:06,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:06,176 INFO L85 PathProgramCache]: Analyzing trace with hash -713247631, now seen corresponding path program 1 times [2024-11-16 03:01:06,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:06,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222965757] [2024-11-16 03:01:06,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:06,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:06,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:06,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:06,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 03:01:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:06,489 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 03:01:06,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:06,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222965757] [2024-11-16 03:01:06,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222965757] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:01:06,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604364655] [2024-11-16 03:01:06,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:06,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:01:06,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:01:06,492 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:01:06,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-16 03:01:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:06,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-16 03:01:06,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:06,620 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 03:01:06,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:06,772 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 03:01:06,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604364655] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 03:01:06,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 03:01:06,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2024-11-16 03:01:06,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247926391] [2024-11-16 03:01:06,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 03:01:06,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-16 03:01:06,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:06,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-16 03:01:06,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2024-11-16 03:01:06,775 INFO L87 Difference]: Start difference. First operand 974 states and 1322 transitions. Second operand has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 16 states have internal predecessors, (67), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-16 03:01:07,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:07,272 INFO L93 Difference]: Finished difference Result 1392 states and 1901 transitions. [2024-11-16 03:01:07,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-16 03:01:07,272 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 16 states have internal predecessors, (67), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 59 [2024-11-16 03:01:07,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:07,277 INFO L225 Difference]: With dead ends: 1392 [2024-11-16 03:01:07,277 INFO L226 Difference]: Without dead ends: 1146 [2024-11-16 03:01:07,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2024-11-16 03:01:07,279 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 126 mSDsluCounter, 2020 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:07,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 2165 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:01:07,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2024-11-16 03:01:07,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 980. [2024-11-16 03:01:07,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 908 states have (on average 1.302863436123348) internal successors, (1183), 909 states have internal predecessors, (1183), 65 states have call successors, (65), 4 states have call predecessors, (65), 6 states have return successors, (72), 70 states have call predecessors, (72), 62 states have call successors, (72) [2024-11-16 03:01:07,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1320 transitions. [2024-11-16 03:01:07,313 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1320 transitions. Word has length 59 [2024-11-16 03:01:07,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:07,313 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1320 transitions. [2024-11-16 03:01:07,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 16 states have internal predecessors, (67), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-16 03:01:07,313 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1320 transitions. [2024-11-16 03:01:07,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-16 03:01:07,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:07,315 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:01:07,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-16 03:01:07,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-16 03:01:07,516 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:07,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:07,517 INFO L85 PathProgramCache]: Analyzing trace with hash 2057760804, now seen corresponding path program 1 times [2024-11-16 03:01:07,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:07,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695379026] [2024-11-16 03:01:07,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:07,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:07,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:07,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:07,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 03:01:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:07,719 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 03:01:07,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:07,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695379026] [2024-11-16 03:01:07,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695379026] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:01:07,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106702041] [2024-11-16 03:01:07,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:07,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:01:07,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:01:07,722 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:01:07,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-16 03:01:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:07,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-16 03:01:07,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:07,836 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 03:01:07,836 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:07,910 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 03:01:07,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106702041] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 03:01:07,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-16 03:01:07,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 10] total 19 [2024-11-16 03:01:07,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059316155] [2024-11-16 03:01:07,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:07,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 03:01:07,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:07,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 03:01:07,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2024-11-16 03:01:07,912 INFO L87 Difference]: Start difference. First operand 980 states and 1320 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:08,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:08,070 INFO L93 Difference]: Finished difference Result 1111 states and 1476 transitions. [2024-11-16 03:01:08,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 03:01:08,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2024-11-16 03:01:08,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:08,075 INFO L225 Difference]: With dead ends: 1111 [2024-11-16 03:01:08,075 INFO L226 Difference]: Without dead ends: 1039 [2024-11-16 03:01:08,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2024-11-16 03:01:08,076 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 52 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:08,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 496 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:08,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2024-11-16 03:01:08,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 985. [2024-11-16 03:01:08,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 914 states have (on average 1.2647702407002188) internal successors, (1156), 916 states have internal predecessors, (1156), 64 states have call successors, (64), 4 states have call predecessors, (64), 6 states have return successors, (71), 69 states have call predecessors, (71), 61 states have call successors, (71) [2024-11-16 03:01:08,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1291 transitions. [2024-11-16 03:01:08,111 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1291 transitions. Word has length 60 [2024-11-16 03:01:08,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:08,111 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1291 transitions. [2024-11-16 03:01:08,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:08,112 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1291 transitions. [2024-11-16 03:01:08,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-16 03:01:08,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:08,114 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:08,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-16 03:01:08,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-16 03:01:08,318 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:08,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:08,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1164776051, now seen corresponding path program 1 times [2024-11-16 03:01:08,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:08,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081418803] [2024-11-16 03:01:08,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:08,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:08,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:08,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:08,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 03:01:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:08,463 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:08,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:08,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081418803] [2024-11-16 03:01:08,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081418803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:08,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:08,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 03:01:08,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787854920] [2024-11-16 03:01:08,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:08,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 03:01:08,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:08,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 03:01:08,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 03:01:08,466 INFO L87 Difference]: Start difference. First operand 985 states and 1291 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:08,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:08,674 INFO L93 Difference]: Finished difference Result 1249 states and 1623 transitions. [2024-11-16 03:01:08,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 03:01:08,674 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 62 [2024-11-16 03:01:08,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:08,679 INFO L225 Difference]: With dead ends: 1249 [2024-11-16 03:01:08,679 INFO L226 Difference]: Without dead ends: 1192 [2024-11-16 03:01:08,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 03:01:08,680 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 127 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:08,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 778 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 03:01:08,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2024-11-16 03:01:08,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 970. [2024-11-16 03:01:08,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 902 states have (on average 1.2605321507760532) internal successors, (1137), 903 states have internal predecessors, (1137), 61 states have call successors, (61), 4 states have call predecessors, (61), 6 states have return successors, (68), 66 states have call predecessors, (68), 58 states have call successors, (68) [2024-11-16 03:01:08,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1266 transitions. [2024-11-16 03:01:08,753 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1266 transitions. Word has length 62 [2024-11-16 03:01:08,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:08,753 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1266 transitions. [2024-11-16 03:01:08,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:08,753 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1266 transitions. [2024-11-16 03:01:08,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-16 03:01:08,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:08,755 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:08,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-16 03:01:08,756 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:08,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:08,756 INFO L85 PathProgramCache]: Analyzing trace with hash 79988430, now seen corresponding path program 1 times [2024-11-16 03:01:08,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:08,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453022728] [2024-11-16 03:01:08,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:08,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:09,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:09,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:09,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 03:01:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:09,595 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:09,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:09,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453022728] [2024-11-16 03:01:09,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453022728] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:01:09,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74006959] [2024-11-16 03:01:09,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:09,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:01:09,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:01:09,601 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:01:09,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-16 03:01:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:09,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-16 03:01:09,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:10,085 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:10,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74006959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:10,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:01:10,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 25 [2024-11-16 03:01:10,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115124480] [2024-11-16 03:01:10,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:10,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 03:01:10,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:10,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 03:01:10,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2024-11-16 03:01:10,089 INFO L87 Difference]: Start difference. First operand 970 states and 1266 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:10,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:10,617 INFO L93 Difference]: Finished difference Result 1338 states and 1746 transitions. [2024-11-16 03:01:10,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 03:01:10,621 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 62 [2024-11-16 03:01:10,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:10,629 INFO L225 Difference]: With dead ends: 1338 [2024-11-16 03:01:10,629 INFO L226 Difference]: Without dead ends: 1215 [2024-11-16 03:01:10,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2024-11-16 03:01:10,630 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 124 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:10,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 921 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:01:10,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2024-11-16 03:01:10,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 942. [2024-11-16 03:01:10,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 876 states have (on average 1.2591324200913243) internal successors, (1103), 878 states have internal predecessors, (1103), 59 states have call successors, (59), 4 states have call predecessors, (59), 6 states have return successors, (65), 63 states have call predecessors, (65), 56 states have call successors, (65) [2024-11-16 03:01:10,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1227 transitions. [2024-11-16 03:01:10,711 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1227 transitions. Word has length 62 [2024-11-16 03:01:10,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:10,711 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1227 transitions. [2024-11-16 03:01:10,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:10,716 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1227 transitions. [2024-11-16 03:01:10,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-16 03:01:10,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:10,717 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:01:10,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-16 03:01:10,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-16 03:01:10,918 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:10,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:10,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1154761662, now seen corresponding path program 1 times [2024-11-16 03:01:10,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:10,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44780105] [2024-11-16 03:01:10,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:10,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:11,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:11,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:11,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 03:01:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:11,047 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 03:01:11,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:11,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44780105] [2024-11-16 03:01:11,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44780105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:11,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:11,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 03:01:11,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326108158] [2024-11-16 03:01:11,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:11,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 03:01:11,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:11,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 03:01:11,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:01:11,051 INFO L87 Difference]: Start difference. First operand 942 states and 1227 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:11,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:11,129 INFO L93 Difference]: Finished difference Result 975 states and 1261 transitions. [2024-11-16 03:01:11,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 03:01:11,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 62 [2024-11-16 03:01:11,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:11,132 INFO L225 Difference]: With dead ends: 975 [2024-11-16 03:01:11,132 INFO L226 Difference]: Without dead ends: 972 [2024-11-16 03:01:11,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:01:11,133 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 20 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:11,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 732 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:11,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2024-11-16 03:01:11,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 948. [2024-11-16 03:01:11,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 880 states have (on average 1.2579545454545455) internal successors, (1107), 883 states have internal predecessors, (1107), 60 states have call successors, (60), 5 states have call predecessors, (60), 7 states have return successors, (66), 63 states have call predecessors, (66), 57 states have call successors, (66) [2024-11-16 03:01:11,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1233 transitions. [2024-11-16 03:01:11,160 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1233 transitions. Word has length 62 [2024-11-16 03:01:11,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:11,160 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1233 transitions. [2024-11-16 03:01:11,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:11,161 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1233 transitions. [2024-11-16 03:01:11,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-16 03:01:11,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:11,162 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:01:11,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-16 03:01:11,163 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:11,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:11,163 INFO L85 PathProgramCache]: Analyzing trace with hash -267257981, now seen corresponding path program 1 times [2024-11-16 03:01:11,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:11,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706992476] [2024-11-16 03:01:11,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:11,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:11,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:11,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:11,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 03:01:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:11,226 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 03:01:11,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:11,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706992476] [2024-11-16 03:01:11,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706992476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:11,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:11,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 03:01:11,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25784371] [2024-11-16 03:01:11,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:11,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 03:01:11,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:11,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 03:01:11,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:01:11,227 INFO L87 Difference]: Start difference. First operand 948 states and 1233 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:11,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:11,282 INFO L93 Difference]: Finished difference Result 959 states and 1243 transitions. [2024-11-16 03:01:11,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 03:01:11,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 62 [2024-11-16 03:01:11,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:11,284 INFO L225 Difference]: With dead ends: 959 [2024-11-16 03:01:11,284 INFO L226 Difference]: Without dead ends: 956 [2024-11-16 03:01:11,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:01:11,286 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 8 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:11,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 641 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:11,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2024-11-16 03:01:11,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 952. [2024-11-16 03:01:11,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 883 states have (on average 1.2570781426953568) internal successors, (1110), 886 states have internal predecessors, (1110), 60 states have call successors, (60), 6 states have call predecessors, (60), 8 states have return successors, (66), 63 states have call predecessors, (66), 57 states have call successors, (66) [2024-11-16 03:01:11,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1236 transitions. [2024-11-16 03:01:11,312 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1236 transitions. Word has length 62 [2024-11-16 03:01:11,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:11,312 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1236 transitions. [2024-11-16 03:01:11,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:11,312 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1236 transitions. [2024-11-16 03:01:11,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-16 03:01:11,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:11,313 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:11,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-16 03:01:11,314 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:11,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:11,314 INFO L85 PathProgramCache]: Analyzing trace with hash -939486983, now seen corresponding path program 1 times [2024-11-16 03:01:11,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:11,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963010463] [2024-11-16 03:01:11,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:11,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:11,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:11,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:11,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 03:01:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:11,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 03:01:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:11,377 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-16 03:01:11,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:11,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963010463] [2024-11-16 03:01:11,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963010463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:11,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:11,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 03:01:11,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914319704] [2024-11-16 03:01:11,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:11,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 03:01:11,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:11,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 03:01:11,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:01:11,378 INFO L87 Difference]: Start difference. First operand 952 states and 1236 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-16 03:01:11,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:11,473 INFO L93 Difference]: Finished difference Result 1042 states and 1367 transitions. [2024-11-16 03:01:11,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 03:01:11,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 67 [2024-11-16 03:01:11,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:11,476 INFO L225 Difference]: With dead ends: 1042 [2024-11-16 03:01:11,476 INFO L226 Difference]: Without dead ends: 1036 [2024-11-16 03:01:11,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 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-16 03:01:11,477 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 10 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:11,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 486 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:11,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2024-11-16 03:01:11,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1001. [2024-11-16 03:01:11,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 916 states have (on average 1.275109170305677) internal successors, (1168), 934 states have internal predecessors, (1168), 75 states have call successors, (75), 7 states have call predecessors, (75), 9 states have return successors, (81), 63 states have call predecessors, (81), 72 states have call successors, (81) [2024-11-16 03:01:11,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1324 transitions. [2024-11-16 03:01:11,509 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1324 transitions. Word has length 67 [2024-11-16 03:01:11,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:11,509 INFO L471 AbstractCegarLoop]: Abstraction has 1001 states and 1324 transitions. [2024-11-16 03:01:11,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-16 03:01:11,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1324 transitions. [2024-11-16 03:01:11,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-16 03:01:11,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:11,510 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:11,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-16 03:01:11,510 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:11,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:11,511 INFO L85 PathProgramCache]: Analyzing trace with hash 671432482, now seen corresponding path program 1 times [2024-11-16 03:01:11,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:11,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672354042] [2024-11-16 03:01:11,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:11,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:11,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:11,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:11,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 03:01:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:11,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 03:01:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:11,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:11,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672354042] [2024-11-16 03:01:11,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672354042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:11,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:11,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 03:01:11,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542589360] [2024-11-16 03:01:11,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:11,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 03:01:11,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:11,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 03:01:11,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 03:01:11,642 INFO L87 Difference]: Start difference. First operand 1001 states and 1324 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:01:11,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:11,774 INFO L93 Difference]: Finished difference Result 1339 states and 1770 transitions. [2024-11-16 03:01:11,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 03:01:11,774 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 68 [2024-11-16 03:01:11,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:11,777 INFO L225 Difference]: With dead ends: 1339 [2024-11-16 03:01:11,777 INFO L226 Difference]: Without dead ends: 1071 [2024-11-16 03:01:11,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-16 03:01:11,781 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 77 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:11,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 943 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:11,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-11-16 03:01:11,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1013. [2024-11-16 03:01:11,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 928 states have (on average 1.2672413793103448) internal successors, (1176), 946 states have internal predecessors, (1176), 75 states have call successors, (75), 7 states have call predecessors, (75), 9 states have return successors, (81), 63 states have call predecessors, (81), 72 states have call successors, (81) [2024-11-16 03:01:11,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1332 transitions. [2024-11-16 03:01:11,815 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1332 transitions. Word has length 68 [2024-11-16 03:01:11,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:11,815 INFO L471 AbstractCegarLoop]: Abstraction has 1013 states and 1332 transitions. [2024-11-16 03:01:11,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:01:11,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1332 transitions. [2024-11-16 03:01:11,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-16 03:01:11,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:11,817 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:01:11,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-16 03:01:11,817 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:11,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:11,817 INFO L85 PathProgramCache]: Analyzing trace with hash 671008213, now seen corresponding path program 1 times [2024-11-16 03:01:11,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:11,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165916365] [2024-11-16 03:01:11,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:11,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:11,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:11,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-16 03:01:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:11,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 03:01:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:11,877 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 03:01:11,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:11,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165916365] [2024-11-16 03:01:11,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165916365] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:01:11,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677554060] [2024-11-16 03:01:11,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:11,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:01:11,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:01:11,881 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:01:11,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-16 03:01:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:11,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 03:01:11,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:11,950 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 03:01:11,950 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:11,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677554060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:11,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:01:11,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-16 03:01:11,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592578981] [2024-11-16 03:01:11,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:11,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:01:11,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:11,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:01:11,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:01:11,951 INFO L87 Difference]: Start difference. First operand 1013 states and 1332 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:01:12,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:12,012 INFO L93 Difference]: Finished difference Result 2001 states and 2637 transitions. [2024-11-16 03:01:12,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:01:12,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2024-11-16 03:01:12,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:12,017 INFO L225 Difference]: With dead ends: 2001 [2024-11-16 03:01:12,017 INFO L226 Difference]: Without dead ends: 1026 [2024-11-16 03:01:12,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:01:12,021 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 18 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:12,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 353 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:12,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2024-11-16 03:01:12,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1017. [2024-11-16 03:01:12,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 931 states have (on average 1.267454350161117) internal successors, (1180), 950 states have internal predecessors, (1180), 75 states have call successors, (75), 7 states have call predecessors, (75), 10 states have return successors, (87), 63 states have call predecessors, (87), 72 states have call successors, (87) [2024-11-16 03:01:12,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1342 transitions. [2024-11-16 03:01:12,105 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1342 transitions. Word has length 67 [2024-11-16 03:01:12,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:12,105 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1342 transitions. [2024-11-16 03:01:12,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:01:12,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1342 transitions. [2024-11-16 03:01:12,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-16 03:01:12,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:12,107 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:12,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-16 03:01:12,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-16 03:01:12,314 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:12,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:12,314 INFO L85 PathProgramCache]: Analyzing trace with hash -892030114, now seen corresponding path program 1 times [2024-11-16 03:01:12,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:12,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148807985] [2024-11-16 03:01:12,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:12,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:12,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:12,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:12,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 03:01:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:12,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 03:01:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:12,392 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-16 03:01:12,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:12,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148807985] [2024-11-16 03:01:12,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148807985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:12,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:12,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:01:12,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799911219] [2024-11-16 03:01:12,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:12,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:01:12,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:12,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:01:12,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:01:12,393 INFO L87 Difference]: Start difference. First operand 1017 states and 1342 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-16 03:01:12,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:12,461 INFO L93 Difference]: Finished difference Result 1277 states and 1693 transitions. [2024-11-16 03:01:12,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:01:12,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 70 [2024-11-16 03:01:12,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:12,468 INFO L225 Difference]: With dead ends: 1277 [2024-11-16 03:01:12,468 INFO L226 Difference]: Without dead ends: 1033 [2024-11-16 03:01:12,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:01:12,469 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 246 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-16 03:01:12,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 246 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:12,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2024-11-16 03:01:12,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1033. [2024-11-16 03:01:12,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 947 states have (on average 1.2629355860612461) internal successors, (1196), 966 states have internal predecessors, (1196), 75 states have call successors, (75), 7 states have call predecessors, (75), 10 states have return successors, (87), 63 states have call predecessors, (87), 72 states have call successors, (87) [2024-11-16 03:01:12,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1358 transitions. [2024-11-16 03:01:12,507 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1358 transitions. Word has length 70 [2024-11-16 03:01:12,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:12,507 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1358 transitions. [2024-11-16 03:01:12,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-16 03:01:12,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1358 transitions. [2024-11-16 03:01:12,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-16 03:01:12,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:12,509 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:12,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-16 03:01:12,509 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:12,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:12,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1490941742, now seen corresponding path program 1 times [2024-11-16 03:01:12,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:12,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411873231] [2024-11-16 03:01:12,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:12,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:12,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:12,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:12,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 03:01:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:12,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 03:01:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 03:01:12,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:12,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411873231] [2024-11-16 03:01:12,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411873231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:12,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:12,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 03:01:12,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980057954] [2024-11-16 03:01:12,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:12,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 03:01:12,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:12,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 03:01:12,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:01:12,568 INFO L87 Difference]: Start difference. First operand 1033 states and 1358 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-16 03:01:12,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:12,626 INFO L93 Difference]: Finished difference Result 1076 states and 1405 transitions. [2024-11-16 03:01:12,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 03:01:12,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 70 [2024-11-16 03:01:12,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:12,632 INFO L225 Difference]: With dead ends: 1076 [2024-11-16 03:01:12,632 INFO L226 Difference]: Without dead ends: 1059 [2024-11-16 03:01:12,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:01:12,633 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 16 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:12,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 705 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:12,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2024-11-16 03:01:12,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1031. [2024-11-16 03:01:12,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 942 states have (on average 1.256900212314225) internal successors, (1184), 964 states have internal predecessors, (1184), 77 states have call successors, (77), 8 states have call predecessors, (77), 11 states have return successors, (89), 62 states have call predecessors, (89), 74 states have call successors, (89) [2024-11-16 03:01:12,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1350 transitions. [2024-11-16 03:01:12,666 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1350 transitions. Word has length 70 [2024-11-16 03:01:12,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:12,666 INFO L471 AbstractCegarLoop]: Abstraction has 1031 states and 1350 transitions. [2024-11-16 03:01:12,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-16 03:01:12,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1350 transitions. [2024-11-16 03:01:12,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-16 03:01:12,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:12,667 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:12,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-16 03:01:12,667 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:12,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:12,668 INFO L85 PathProgramCache]: Analyzing trace with hash -552112649, now seen corresponding path program 1 times [2024-11-16 03:01:12,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:12,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455362894] [2024-11-16 03:01:12,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:12,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 03:01:12,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 03:01:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 03:01:12,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 03:01:12,721 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 03:01:12,722 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 03:01:12,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-16 03:01:12,725 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:12,758 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 03:01:12,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:01:12 BoogieIcfgContainer [2024-11-16 03:01:12,760 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 03:01:12,761 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 03:01:12,761 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 03:01:12,761 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 03:01:12,761 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:00:55" (3/4) ... [2024-11-16 03:01:12,763 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 03:01:12,764 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 03:01:12,764 INFO L158 Benchmark]: Toolchain (without parser) took 18643.67ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 93.2MB in the beginning and 184.4MB in the end (delta: -91.2MB). Peak memory consumption was 196.0MB. Max. memory is 16.1GB. [2024-11-16 03:01:12,765 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 167.8MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 03:01:12,765 INFO L158 Benchmark]: CACSL2BoogieTranslator took 579.28ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 136.4MB in the end (delta: -43.3MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2024-11-16 03:01:12,765 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.52ms. Allocated memory is still 167.8MB. Free memory was 136.4MB in the beginning and 134.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 03:01:12,765 INFO L158 Benchmark]: Boogie Preprocessor took 51.52ms. Allocated memory is still 167.8MB. Free memory was 134.3MB in the beginning and 132.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 03:01:12,765 INFO L158 Benchmark]: IcfgBuilder took 650.52ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 106.1MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-16 03:01:12,765 INFO L158 Benchmark]: TraceAbstraction took 17308.94ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 106.1MB in the beginning and 184.4MB in the end (delta: -78.3MB). Peak memory consumption was 207.8MB. Max. memory is 16.1GB. [2024-11-16 03:01:12,766 INFO L158 Benchmark]: Witness Printer took 3.42ms. Allocated memory is still 453.0MB. Free memory is still 184.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 03:01:12,766 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.13ms. Allocated memory is still 167.8MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 579.28ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 136.4MB in the end (delta: -43.3MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.52ms. Allocated memory is still 167.8MB. Free memory was 136.4MB in the beginning and 134.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.52ms. Allocated memory is still 167.8MB. Free memory was 134.3MB in the beginning and 132.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 650.52ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 106.1MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17308.94ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 106.1MB in the beginning and 184.4MB in the end (delta: -78.3MB). Peak memory consumption was 207.8MB. Max. memory is 16.1GB. * Witness Printer took 3.42ms. Allocated memory is still 453.0MB. Free memory is still 184.4MB. 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: 18]: 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 bitwiseOr at line 114, overapproximation of bitwiseAnd at line 127. Possible FailurePath: [L227] unsigned int a ; [L228] unsigned int ma = __VERIFIER_nondet_uint(); [L229] signed char ea = __VERIFIER_nondet_char(); [L230] unsigned int b ; [L231] unsigned int mb = __VERIFIER_nondet_uint(); [L232] signed char eb = __VERIFIER_nondet_char(); [L233] unsigned int r_add ; [L234] unsigned int zero ; [L235] int sa ; [L236] int sb ; [L237] int tmp ; [L238] int tmp___0 ; [L239] int tmp___1 ; [L240] int tmp___2 ; [L241] int tmp___3 ; [L242] int tmp___4 ; [L243] int tmp___5 ; [L244] int tmp___6 ; [L245] int tmp___7 ; [L246] int tmp___8 ; [L247] int tmp___9 ; [L248] int __retres23 ; VAL [ea=127, eb=127] [L252] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L30] COND TRUE ! m [L31] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L81] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L252] RET, EXPR base2flt(0, 0) VAL [ea=127, eb=127] [L252] zero = base2flt(0, 0) [L253] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=4328521728] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L30] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L58] COND TRUE 1 VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L60] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L65] COND TRUE e >= 127 [L66] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=4328521728, __retres4=4294967295, m=4328521728] [L81] return (__retres4); VAL [\old(e)=127, \old(m)=4328521728, \result=4294967295, m=4328521728] [L253] RET, EXPR base2flt(ma, ea) VAL [ea=127, eb=127, ma=4328521728, zero=0] [L253] a = base2flt(ma, ea) [L254] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=127, \old(m)=33554432] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L30] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L58] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L60] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L65] COND TRUE e >= 127 [L66] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, m=33554432] [L81] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, m=33554432] [L254] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, zero=0] [L254] b = base2flt(mb, eb) [L256] COND FALSE !(a < zero) VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, zero=0] [L259] COND TRUE a > zero [L260] tmp = 1 VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, tmp=1, zero=0] [L264] sa = tmp VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, sa=1, zero=0] [L266] COND FALSE !(b < zero) VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, sa=1, zero=0] [L269] COND TRUE b > zero [L270] tmp___0 = 1 VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, sa=1, tmp___0=1] [L274] sb = tmp___0 VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, sa=1, sb=1] [L277] CALL addflt(a, b) [L85] unsigned int res ; [L86] unsigned int ma ; [L87] unsigned int mb ; [L88] unsigned int delta ; [L89] int ea ; [L90] int eb ; [L91] unsigned int tmp ; [L92] unsigned int __retres10 ; VAL [a=4294967295, b=4294967295] [L95] COND FALSE !(a < b) VAL [a=4294967295, b=4294967295] [L102] COND FALSE !(! b) [L109] ma = a & ((1U << 24U) - 1U) [L110] ea = (int )(a >> 24U) - 128 VAL [a=4294967295, b=4294967295, ea=127, ma=16777215] [L111] EXPR ma | (1U << 24U) VAL [a=4294967295, b=4294967295, ea=127] [L111] ma = ma | (1U << 24U) [L112] mb = b & ((1U << 24U) - 1U) [L113] eb = (int )(b >> 24U) - 128 VAL [a=4294967295, ea=127, eb=127, ma=-4278190079, mb=16777215] [L114] EXPR mb | (1U << 24U) VAL [a=4294967295, ea=127, eb=127, ma=-4278190079] [L114] mb = mb | (1U << 24U) [L115] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L17] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L115] RET __VERIFIER_assert(ea >= eb) VAL [a=4294967295, ea=127, eb=127, ma=-4278190079, mb=-4278190080] [L116] delta = ea - eb VAL [a=4294967295, delta=0, ea=127, ma=-4278190079, mb=-4278190080] [L117] COND FALSE !(!(delta < sizeof(mb) * 8)) VAL [a=4294967295, delta=0, ea=127, ma=-4278190079, mb=-4278190080] [L118] EXPR mb >> delta VAL [a=4294967295, ea=127, ma=-4278190079] [L118] mb = mb >> delta [L120] COND FALSE !(! mb) [L126] ma = ma + mb VAL [a=4294967295, ea=127, ma=-8556380159] [L127] ma & (1U << 25U) VAL [a=4294967295, ea=127, ma=-8556380159] [L127] COND FALSE !(ma & (1U << 25U)) [L140] CALL __VERIFIER_assert(ma < 1U << 25U) VAL [\old(cond)=0] [L17] COND TRUE !(cond) VAL [\old(cond)=0] [L18] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.2s, OverallIterations: 35, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1894 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1816 mSDsluCounter, 24348 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19516 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5742 IncrementalHoareTripleChecker+Invalid, 5868 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 4832 mSDtfsCounter, 5742 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1538 GetRequests, 1265 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1156occurred in iteration=15, InterpolantAutomatonStates: 236, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 2401 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 2645 NumberOfCodeBlocks, 2645 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 2879 ConstructedInterpolants, 0 QuantifiedInterpolants, 6160 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1975 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 54 InterpolantComputations, 30 PerfectInterpolantSequences, 835/948 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-16 03:01:12,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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/bitvector/soft_float_1-2a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 03:01:14,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 03:01:14,972 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 03:01:14,975 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 03:01:14,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 03:01:15,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 03:01:15,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 03:01:15,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 03:01:15,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 03:01:15,007 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 03:01:15,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 03:01:15,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 03:01:15,008 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 03:01:15,008 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 03:01:15,010 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 03:01:15,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 03:01:15,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 03:01:15,010 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 03:01:15,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 03:01:15,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 03:01:15,011 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 03:01:15,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 03:01:15,013 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 03:01:15,013 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 03:01:15,014 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 03:01:15,014 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 03:01:15,014 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 03:01:15,014 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 03:01:15,015 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 03:01:15,015 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 03:01:15,015 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 03:01:15,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 03:01:15,016 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 03:01:15,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 03:01:15,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:01:15,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 03:01:15,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 03:01:15,017 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 03:01:15,017 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 03:01:15,018 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 03:01:15,018 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 03:01:15,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 03:01:15,019 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 03:01:15,019 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 03:01:15,019 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 [2024-11-16 03:01:15,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 03:01:15,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 03:01:15,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 03:01:15,353 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 03:01:15,354 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 03:01:15,355 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2024-11-16 03:01:16,895 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 03:01:17,108 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 03:01:17,112 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2024-11-16 03:01:17,122 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51c0414d6/8206f6f9cf3d4195b95728552d024243/FLAG0e20cf019 [2024-11-16 03:01:17,460 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51c0414d6/8206f6f9cf3d4195b95728552d024243 [2024-11-16 03:01:17,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 03:01:17,463 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 03:01:17,464 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 03:01:17,464 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 03:01:17,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 03:01:17,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:01:17" (1/1) ... [2024-11-16 03:01:17,474 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16670fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:17, skipping insertion in model container [2024-11-16 03:01:17,474 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:01:17" (1/1) ... [2024-11-16 03:01:17,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 03:01:17,647 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/bitvector/soft_float_1-2a.c.cil.c[755,768] [2024-11-16 03:01:17,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:01:17,713 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 03:01:17,724 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/bitvector/soft_float_1-2a.c.cil.c[755,768] [2024-11-16 03:01:17,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:01:17,764 INFO L204 MainTranslator]: Completed translation [2024-11-16 03:01:17,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:17 WrapperNode [2024-11-16 03:01:17,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 03:01:17,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 03:01:17,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 03:01:17,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 03:01:17,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:17" (1/1) ... [2024-11-16 03:01:17,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:17" (1/1) ... [2024-11-16 03:01:17,803 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 149 [2024-11-16 03:01:17,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 03:01:17,804 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 03:01:17,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 03:01:17,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 03:01:17,820 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:17" (1/1) ... [2024-11-16 03:01:17,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:17" (1/1) ... [2024-11-16 03:01:17,824 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:17" (1/1) ... [2024-11-16 03:01:17,844 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-16 03:01:17,845 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:17" (1/1) ... [2024-11-16 03:01:17,845 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:17" (1/1) ... [2024-11-16 03:01:17,850 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:17" (1/1) ... [2024-11-16 03:01:17,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:17" (1/1) ... [2024-11-16 03:01:17,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:17" (1/1) ... [2024-11-16 03:01:17,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:17" (1/1) ... [2024-11-16 03:01:17,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 03:01:17,857 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 03:01:17,857 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 03:01:17,857 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 03:01:17,858 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:17" (1/1) ... [2024-11-16 03:01:17,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:01:17,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:01:17,906 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-16 03:01:17,913 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-16 03:01:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 03:01:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 03:01:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-16 03:01:17,957 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-16 03:01:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 03:01:17,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 03:01:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-16 03:01:17,957 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-16 03:01:18,023 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 03:01:18,024 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 03:01:18,405 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-16 03:01:18,405 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 03:01:18,420 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 03:01:18,421 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 03:01:18,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:01:18 BoogieIcfgContainer [2024-11-16 03:01:18,422 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 03:01:18,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 03:01:18,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 03:01:18,427 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 03:01:18,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:01:17" (1/3) ... [2024-11-16 03:01:18,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4258504e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:01:18, skipping insertion in model container [2024-11-16 03:01:18,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:17" (2/3) ... [2024-11-16 03:01:18,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4258504e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:01:18, skipping insertion in model container [2024-11-16 03:01:18,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:01:18" (3/3) ... [2024-11-16 03:01:18,432 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2024-11-16 03:01:18,447 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 03:01:18,447 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 03:01:18,514 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 03:01:18,520 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;@76be236a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 03:01:18,520 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 03:01:18,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 69 states have (on average 1.5217391304347827) internal successors, (105), 72 states have internal predecessors, (105), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 03:01:18,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-16 03:01:18,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:18,532 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:18,533 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:18,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:18,538 INFO L85 PathProgramCache]: Analyzing trace with hash -805495691, now seen corresponding path program 1 times [2024-11-16 03:01:18,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:18,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622343336] [2024-11-16 03:01:18,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:18,548 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-16 03:01:18,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:18,555 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-16 03:01:18,559 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-16 03:01:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 03:01:18,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:18,714 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:18,715 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:18,762 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:18,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:18,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [622343336] [2024-11-16 03:01:18,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [622343336] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 03:01:18,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 03:01:18,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-16 03:01:18,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921614362] [2024-11-16 03:01:18,770 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 03:01:18,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 03:01:18,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:18,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 03:01:18,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:01:18,792 INFO L87 Difference]: Start difference. First operand has 81 states, 69 states have (on average 1.5217391304347827) internal successors, (105), 72 states have internal predecessors, (105), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:01:18,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:18,870 INFO L93 Difference]: Finished difference Result 171 states and 270 transitions. [2024-11-16 03:01:18,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 03:01:18,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-11-16 03:01:18,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:18,879 INFO L225 Difference]: With dead ends: 171 [2024-11-16 03:01:18,880 INFO L226 Difference]: Without dead ends: 89 [2024-11-16 03:01:18,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:01:18,887 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 5 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:18,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 531 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:18,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-16 03:01:18,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2024-11-16 03:01:18,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 76 states have internal predecessors, (104), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (14), 10 states have call predecessors, (14), 9 states have call successors, (14) [2024-11-16 03:01:18,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2024-11-16 03:01:18,923 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 33 [2024-11-16 03:01:18,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:18,924 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2024-11-16 03:01:18,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:01:18,924 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2024-11-16 03:01:18,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-16 03:01:18,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:18,926 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 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-16 03:01:18,929 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-16 03:01:19,126 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-16 03:01:19,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:19,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:19,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1622093365, now seen corresponding path program 1 times [2024-11-16 03:01:19,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:19,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655063341] [2024-11-16 03:01:19,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:19,129 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-16 03:01:19,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:19,135 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-16 03:01:19,136 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-16 03:01:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:19,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 03:01:19,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:19,238 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:19,243 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:19,313 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:19,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:19,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655063341] [2024-11-16 03:01:19,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655063341] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 03:01:19,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 03:01:19,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-16 03:01:19,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918791018] [2024-11-16 03:01:19,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 03:01:19,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 03:01:19,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:19,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 03:01:19,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:01:19,320 INFO L87 Difference]: Start difference. First operand 88 states and 128 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:01:19,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:19,494 INFO L93 Difference]: Finished difference Result 182 states and 272 transitions. [2024-11-16 03:01:19,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 03:01:19,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-11-16 03:01:19,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:19,496 INFO L225 Difference]: With dead ends: 182 [2024-11-16 03:01:19,496 INFO L226 Difference]: Without dead ends: 133 [2024-11-16 03:01:19,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:01:19,498 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 43 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:19,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 475 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:19,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-16 03:01:19,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2024-11-16 03:01:19,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 113 states have internal predecessors, (156), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 18 states have call predecessors, (22), 15 states have call successors, (22) [2024-11-16 03:01:19,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 194 transitions. [2024-11-16 03:01:19,531 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 194 transitions. Word has length 37 [2024-11-16 03:01:19,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:19,532 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 194 transitions. [2024-11-16 03:01:19,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:01:19,532 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 194 transitions. [2024-11-16 03:01:19,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-16 03:01:19,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:19,536 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 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-16 03:01:19,542 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-16 03:01:19,737 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-16 03:01:19,738 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:19,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:19,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1328690358, now seen corresponding path program 1 times [2024-11-16 03:01:19,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:19,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163735013] [2024-11-16 03:01:19,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:19,742 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-16 03:01:19,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:19,746 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-16 03:01:19,747 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-16 03:01:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:19,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 03:01:19,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:19,880 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:19,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:19,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163735013] [2024-11-16 03:01:19,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163735013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:19,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:19,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 03:01:19,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222931607] [2024-11-16 03:01:19,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:19,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 03:01:19,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:19,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 03:01:19,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:01:19,883 INFO L87 Difference]: Start difference. First operand 132 states and 194 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:20,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:20,011 INFO L93 Difference]: Finished difference Result 291 states and 433 transitions. [2024-11-16 03:01:20,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 03:01:20,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-11-16 03:01:20,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:20,013 INFO L225 Difference]: With dead ends: 291 [2024-11-16 03:01:20,013 INFO L226 Difference]: Without dead ends: 218 [2024-11-16 03:01:20,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:01:20,014 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 47 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:20,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 475 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:20,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-16 03:01:20,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2024-11-16 03:01:20,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 188 states have (on average 1.3936170212765957) internal successors, (262), 187 states have internal predecessors, (262), 24 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (30), 30 states have call predecessors, (30), 23 states have call successors, (30) [2024-11-16 03:01:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 316 transitions. [2024-11-16 03:01:20,064 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 316 transitions. Word has length 37 [2024-11-16 03:01:20,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:20,065 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 316 transitions. [2024-11-16 03:01:20,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:20,065 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 316 transitions. [2024-11-16 03:01:20,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-16 03:01:20,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:20,067 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 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-16 03:01:20,070 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-16 03:01:20,267 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-16 03:01:20,268 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:20,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:20,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1132176853, now seen corresponding path program 1 times [2024-11-16 03:01:20,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:20,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171840003] [2024-11-16 03:01:20,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:20,271 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-16 03:01:20,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:20,274 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-16 03:01:20,275 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-16 03:01:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:20,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 03:01:20,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:20,420 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:20,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:20,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171840003] [2024-11-16 03:01:20,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171840003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:20,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:20,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 03:01:20,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608121816] [2024-11-16 03:01:20,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:20,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 03:01:20,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:20,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 03:01:20,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:01:20,423 INFO L87 Difference]: Start difference. First operand 216 states and 316 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:20,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:20,521 INFO L93 Difference]: Finished difference Result 267 states and 389 transitions. [2024-11-16 03:01:20,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 03:01:20,522 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-11-16 03:01:20,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:20,523 INFO L225 Difference]: With dead ends: 267 [2024-11-16 03:01:20,523 INFO L226 Difference]: Without dead ends: 200 [2024-11-16 03:01:20,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 03:01:20,525 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 34 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:20,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 559 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:20,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-16 03:01:20,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2024-11-16 03:01:20,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 174 states have (on average 1.367816091954023) internal successors, (238), 173 states have internal predecessors, (238), 20 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (26), 26 states have call predecessors, (26), 19 states have call successors, (26) [2024-11-16 03:01:20,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 284 transitions. [2024-11-16 03:01:20,547 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 284 transitions. Word has length 37 [2024-11-16 03:01:20,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:20,548 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 284 transitions. [2024-11-16 03:01:20,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:20,548 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 284 transitions. [2024-11-16 03:01:20,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-16 03:01:20,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:20,549 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-16 03:01:20,558 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 (5)] Ended with exit code 0 [2024-11-16 03:01:20,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-16 03:01:20,752 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:20,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:20,753 INFO L85 PathProgramCache]: Analyzing trace with hash 2031307278, now seen corresponding path program 1 times [2024-11-16 03:01:20,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:20,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261758598] [2024-11-16 03:01:20,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:20,753 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-16 03:01:20,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:20,758 INFO L229 MonitoredProcess]: Starting monitored process 6 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-16 03:01:20,759 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 (6)] Waiting until timeout for monitored process [2024-11-16 03:01:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:20,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 03:01:20,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:20,854 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:20,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:20,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:20,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261758598] [2024-11-16 03:01:20,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [261758598] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 03:01:20,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 03:01:20,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-16 03:01:20,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722303504] [2024-11-16 03:01:20,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 03:01:20,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 03:01:20,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:20,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 03:01:20,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 03:01:20,970 INFO L87 Difference]: Start difference. First operand 198 states and 284 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:01:21,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:21,078 INFO L93 Difference]: Finished difference Result 232 states and 333 transitions. [2024-11-16 03:01:21,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 03:01:21,079 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2024-11-16 03:01:21,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:21,081 INFO L225 Difference]: With dead ends: 232 [2024-11-16 03:01:21,081 INFO L226 Difference]: Without dead ends: 192 [2024-11-16 03:01:21,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-16 03:01:21,082 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 29 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:21,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 646 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:21,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-16 03:01:21,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2024-11-16 03:01:21,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 167 states have (on average 1.3592814371257484) internal successors, (227), 166 states have internal predecessors, (227), 18 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (24), 24 states have call predecessors, (24), 17 states have call successors, (24) [2024-11-16 03:01:21,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 269 transitions. [2024-11-16 03:01:21,092 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 269 transitions. Word has length 43 [2024-11-16 03:01:21,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:21,093 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 269 transitions. [2024-11-16 03:01:21,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:01:21,093 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 269 transitions. [2024-11-16 03:01:21,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-16 03:01:21,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:21,094 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:01:21,103 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 (6)] Ended with exit code 0 [2024-11-16 03:01:21,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-16 03:01:21,298 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:21,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:21,299 INFO L85 PathProgramCache]: Analyzing trace with hash -269449233, now seen corresponding path program 1 times [2024-11-16 03:01:21,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:21,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036629976] [2024-11-16 03:01:21,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:21,300 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-16 03:01:21,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:21,305 INFO L229 MonitoredProcess]: Starting monitored process 7 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-16 03:01:21,307 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 (7)] Waiting until timeout for monitored process [2024-11-16 03:01:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:21,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 03:01:21,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:21,374 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:21,374 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:21,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:21,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036629976] [2024-11-16 03:01:21,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036629976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:21,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:21,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:01:21,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231484763] [2024-11-16 03:01:21,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:21,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:01:21,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:21,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:01:21,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:01:21,375 INFO L87 Difference]: Start difference. First operand 189 states and 269 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:21,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:21,393 INFO L93 Difference]: Finished difference Result 315 states and 453 transitions. [2024-11-16 03:01:21,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:01:21,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-16 03:01:21,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:21,395 INFO L225 Difference]: With dead ends: 315 [2024-11-16 03:01:21,395 INFO L226 Difference]: Without dead ends: 244 [2024-11-16 03:01:21,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 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-16 03:01:21,397 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 15 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:21,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 346 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:21,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-16 03:01:21,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2024-11-16 03:01:21,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 220 states have (on average 1.3272727272727274) internal successors, (292), 219 states have internal predecessors, (292), 20 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (26), 26 states have call predecessors, (26), 19 states have call successors, (26) [2024-11-16 03:01:21,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 338 transitions. [2024-11-16 03:01:21,406 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 338 transitions. Word has length 44 [2024-11-16 03:01:21,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:21,406 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 338 transitions. [2024-11-16 03:01:21,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:21,406 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 338 transitions. [2024-11-16 03:01:21,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-16 03:01:21,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:21,407 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:01:21,415 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 (7)] Ended with exit code 0 [2024-11-16 03:01:21,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-16 03:01:21,608 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:21,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:21,609 INFO L85 PathProgramCache]: Analyzing trace with hash -943748841, now seen corresponding path program 1 times [2024-11-16 03:01:21,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:21,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833630954] [2024-11-16 03:01:21,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:21,610 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-16 03:01:21,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:21,612 INFO L229 MonitoredProcess]: Starting monitored process 8 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-16 03:01:21,614 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 (8)] Waiting until timeout for monitored process [2024-11-16 03:01:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:21,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 03:01:21,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:21,875 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:21,875 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:21,988 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:21,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:21,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833630954] [2024-11-16 03:01:21,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833630954] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 03:01:21,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:01:21,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2024-11-16 03:01:21,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078955061] [2024-11-16 03:01:21,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:21,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 03:01:21,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:21,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 03:01:21,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-16 03:01:21,989 INFO L87 Difference]: Start difference. First operand 244 states and 338 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:22,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:22,202 INFO L93 Difference]: Finished difference Result 370 states and 521 transitions. [2024-11-16 03:01:22,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 03:01:22,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-16 03:01:22,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:22,207 INFO L225 Difference]: With dead ends: 370 [2024-11-16 03:01:22,207 INFO L226 Difference]: Without dead ends: 311 [2024-11-16 03:01:22,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-16 03:01:22,208 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 25 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:22,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 429 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 03:01:22,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-16 03:01:22,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 299. [2024-11-16 03:01:22,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 269 states have (on average 1.3159851301115242) internal successors, (354), 270 states have internal predecessors, (354), 26 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (32), 32 states have call predecessors, (32), 25 states have call successors, (32) [2024-11-16 03:01:22,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 412 transitions. [2024-11-16 03:01:22,239 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 412 transitions. Word has length 46 [2024-11-16 03:01:22,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:22,239 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 412 transitions. [2024-11-16 03:01:22,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:22,239 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 412 transitions. [2024-11-16 03:01:22,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-16 03:01:22,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:22,240 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:01:22,246 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 (8)] Ended with exit code 0 [2024-11-16 03:01:22,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-16 03:01:22,441 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:22,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:22,441 INFO L85 PathProgramCache]: Analyzing trace with hash 799061494, now seen corresponding path program 1 times [2024-11-16 03:01:22,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:22,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748791620] [2024-11-16 03:01:22,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:22,443 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-16 03:01:22,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:22,447 INFO L229 MonitoredProcess]: Starting monitored process 9 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-16 03:01:22,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-16 03:01:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:22,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 03:01:22,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:22,580 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:22,580 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:22,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:22,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748791620] [2024-11-16 03:01:22,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748791620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:22,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:22,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 03:01:22,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61763471] [2024-11-16 03:01:22,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:22,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 03:01:22,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:22,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 03:01:22,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:01:22,582 INFO L87 Difference]: Start difference. First operand 299 states and 412 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:22,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:22,644 INFO L93 Difference]: Finished difference Result 307 states and 419 transitions. [2024-11-16 03:01:22,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 03:01:22,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-16 03:01:22,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:22,650 INFO L225 Difference]: With dead ends: 307 [2024-11-16 03:01:22,650 INFO L226 Difference]: Without dead ends: 299 [2024-11-16 03:01:22,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 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-16 03:01:22,651 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 3 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:22,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 426 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:22,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-16 03:01:22,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2024-11-16 03:01:22,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 269 states have (on average 1.304832713754647) internal successors, (351), 270 states have internal predecessors, (351), 26 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (32), 32 states have call predecessors, (32), 25 states have call successors, (32) [2024-11-16 03:01:22,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 409 transitions. [2024-11-16 03:01:22,679 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 409 transitions. Word has length 46 [2024-11-16 03:01:22,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:22,679 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 409 transitions. [2024-11-16 03:01:22,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:22,680 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 409 transitions. [2024-11-16 03:01:22,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-16 03:01:22,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:22,680 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1] [2024-11-16 03:01:22,690 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 (9)] Ended with exit code 0 [2024-11-16 03:01:22,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-16 03:01:22,881 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:22,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:22,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1819977656, now seen corresponding path program 1 times [2024-11-16 03:01:22,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:22,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697405184] [2024-11-16 03:01:22,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:22,882 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-16 03:01:22,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:22,884 INFO L229 MonitoredProcess]: Starting monitored process 10 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-16 03:01:22,887 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 (10)] Waiting until timeout for monitored process [2024-11-16 03:01:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:22,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 03:01:22,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:22,957 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 03:01:22,957 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:22,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:22,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697405184] [2024-11-16 03:01:22,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697405184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:22,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:22,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:01:22,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732106533] [2024-11-16 03:01:22,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:22,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:01:22,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:22,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:01:22,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:01:22,959 INFO L87 Difference]: Start difference. First operand 299 states and 409 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:01:23,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:23,005 INFO L93 Difference]: Finished difference Result 530 states and 717 transitions. [2024-11-16 03:01:23,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 03:01:23,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2024-11-16 03:01:23,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:23,007 INFO L225 Difference]: With dead ends: 530 [2024-11-16 03:01:23,007 INFO L226 Difference]: Without dead ends: 234 [2024-11-16 03:01:23,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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-16 03:01:23,008 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 38 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:23,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 270 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:23,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-16 03:01:23,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 217. [2024-11-16 03:01:23,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 195 states have (on average 1.2615384615384615) internal successors, (246), 198 states have internal predecessors, (246), 17 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (22), 19 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-16 03:01:23,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 285 transitions. [2024-11-16 03:01:23,016 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 285 transitions. Word has length 46 [2024-11-16 03:01:23,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:23,017 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 285 transitions. [2024-11-16 03:01:23,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:01:23,017 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 285 transitions. [2024-11-16 03:01:23,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-16 03:01:23,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:23,018 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1] [2024-11-16 03:01:23,024 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 (10)] Ended with exit code 0 [2024-11-16 03:01:23,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-16 03:01:23,221 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:23,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:23,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1355831115, now seen corresponding path program 1 times [2024-11-16 03:01:23,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:23,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612817561] [2024-11-16 03:01:23,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:23,222 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-16 03:01:23,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:23,225 INFO L229 MonitoredProcess]: Starting monitored process 11 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-16 03:01:23,225 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 (11)] Waiting until timeout for monitored process [2024-11-16 03:01:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:23,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 03:01:23,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:23,288 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:23,288 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:23,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:23,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612817561] [2024-11-16 03:01:23,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612817561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:23,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:23,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:01:23,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145831331] [2024-11-16 03:01:23,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:23,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:01:23,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:23,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:01:23,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:01:23,290 INFO L87 Difference]: Start difference. First operand 217 states and 285 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:23,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:23,306 INFO L93 Difference]: Finished difference Result 359 states and 479 transitions. [2024-11-16 03:01:23,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:01:23,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-16 03:01:23,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:23,308 INFO L225 Difference]: With dead ends: 359 [2024-11-16 03:01:23,308 INFO L226 Difference]: Without dead ends: 303 [2024-11-16 03:01:23,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 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-16 03:01:23,309 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 29 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:23,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 335 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:23,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-16 03:01:23,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 236. [2024-11-16 03:01:23,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 213 states have (on average 1.267605633802817) internal successors, (270), 215 states have internal predecessors, (270), 18 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (23), 20 states have call predecessors, (23), 17 states have call successors, (23) [2024-11-16 03:01:23,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 311 transitions. [2024-11-16 03:01:23,317 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 311 transitions. Word has length 48 [2024-11-16 03:01:23,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:23,317 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 311 transitions. [2024-11-16 03:01:23,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:23,318 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 311 transitions. [2024-11-16 03:01:23,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-16 03:01:23,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:23,318 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:23,334 INFO L540 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 (11)] Forceful destruction successful, exit code 0 [2024-11-16 03:01:23,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-16 03:01:23,519 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:23,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:23,520 INFO L85 PathProgramCache]: Analyzing trace with hash -2041105995, now seen corresponding path program 1 times [2024-11-16 03:01:23,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:23,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718111241] [2024-11-16 03:01:23,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:23,521 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-16 03:01:23,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:23,522 INFO L229 MonitoredProcess]: Starting monitored process 12 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-16 03:01:23,525 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 (12)] Waiting until timeout for monitored process [2024-11-16 03:01:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:23,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 03:01:23,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:23,676 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:23,677 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:23,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:23,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718111241] [2024-11-16 03:01:23,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718111241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:23,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:23,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 03:01:23,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364432252] [2024-11-16 03:01:23,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:23,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 03:01:23,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:23,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 03:01:23,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-16 03:01:23,679 INFO L87 Difference]: Start difference. First operand 236 states and 311 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:01:23,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:23,909 INFO L93 Difference]: Finished difference Result 567 states and 786 transitions. [2024-11-16 03:01:23,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 03:01:23,910 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2024-11-16 03:01:23,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:23,913 INFO L225 Difference]: With dead ends: 567 [2024-11-16 03:01:23,913 INFO L226 Difference]: Without dead ends: 473 [2024-11-16 03:01:23,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-16 03:01:23,914 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 90 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:23,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 835 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 03:01:23,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-16 03:01:23,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 329. [2024-11-16 03:01:23,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 295 states have (on average 1.2881355932203389) internal successors, (380), 296 states have internal predecessors, (380), 28 states have call successors, (28), 2 states have call predecessors, (28), 5 states have return successors, (39), 32 states have call predecessors, (39), 27 states have call successors, (39) [2024-11-16 03:01:23,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 447 transitions. [2024-11-16 03:01:23,930 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 447 transitions. Word has length 49 [2024-11-16 03:01:23,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:23,930 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 447 transitions. [2024-11-16 03:01:23,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:01:23,931 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 447 transitions. [2024-11-16 03:01:23,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-16 03:01:23,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:23,932 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:23,938 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 (12)] Ended with exit code 0 [2024-11-16 03:01:24,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-16 03:01:24,136 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:24,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:24,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1153602314, now seen corresponding path program 1 times [2024-11-16 03:01:24,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:24,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805819080] [2024-11-16 03:01:24,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:24,137 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-16 03:01:24,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:24,139 INFO L229 MonitoredProcess]: Starting monitored process 13 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-16 03:01:24,141 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 (13)] Waiting until timeout for monitored process [2024-11-16 03:01:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:24,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-16 03:01:24,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:24,339 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:24,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:24,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:24,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805819080] [2024-11-16 03:01:24,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805819080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:24,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:24,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 03:01:24,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219017622] [2024-11-16 03:01:24,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:24,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 03:01:24,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:24,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 03:01:24,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-16 03:01:24,341 INFO L87 Difference]: Start difference. First operand 329 states and 447 transitions. Second operand has 12 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:01:24,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:24,672 INFO L93 Difference]: Finished difference Result 424 states and 569 transitions. [2024-11-16 03:01:24,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 03:01:24,672 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2024-11-16 03:01:24,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:24,674 INFO L225 Difference]: With dead ends: 424 [2024-11-16 03:01:24,674 INFO L226 Difference]: Without dead ends: 421 [2024-11-16 03:01:24,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-16 03:01:24,675 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 81 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:24,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1267 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:01:24,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-16 03:01:24,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 335. [2024-11-16 03:01:24,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 298 states have (on average 1.2852348993288591) internal successors, (383), 301 states have internal predecessors, (383), 30 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (41), 32 states have call predecessors, (41), 29 states have call successors, (41) [2024-11-16 03:01:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 454 transitions. [2024-11-16 03:01:24,686 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 454 transitions. Word has length 49 [2024-11-16 03:01:24,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:24,686 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 454 transitions. [2024-11-16 03:01:24,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:01:24,687 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 454 transitions. [2024-11-16 03:01:24,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-16 03:01:24,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:24,688 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:01:24,691 INFO L540 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 (13)] Forceful destruction successful, exit code 0 [2024-11-16 03:01:24,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-16 03:01:24,891 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:24,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:24,891 INFO L85 PathProgramCache]: Analyzing trace with hash -915150991, now seen corresponding path program 1 times [2024-11-16 03:01:24,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:24,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835620339] [2024-11-16 03:01:24,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:24,892 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-16 03:01:24,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:24,893 INFO L229 MonitoredProcess]: Starting monitored process 14 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-16 03:01:24,894 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 (14)] Waiting until timeout for monitored process [2024-11-16 03:01:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:24,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 03:01:24,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:24,953 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:24,953 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:24,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:24,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835620339] [2024-11-16 03:01:24,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [835620339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:24,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:24,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:01:24,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488107986] [2024-11-16 03:01:24,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:24,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:01:24,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:24,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:01:24,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:01:24,958 INFO L87 Difference]: Start difference. First operand 335 states and 454 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:24,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:24,978 INFO L93 Difference]: Finished difference Result 351 states and 471 transitions. [2024-11-16 03:01:24,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:01:24,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-16 03:01:24,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:24,981 INFO L225 Difference]: With dead ends: 351 [2024-11-16 03:01:24,981 INFO L226 Difference]: Without dead ends: 309 [2024-11-16 03:01:24,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 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-16 03:01:24,982 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:24,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:24,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-16 03:01:24,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2024-11-16 03:01:24,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 272 states have (on average 1.2977941176470589) internal successors, (353), 276 states have internal predecessors, (353), 30 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (39), 31 states have call predecessors, (39), 29 states have call successors, (39) [2024-11-16 03:01:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 422 transitions. [2024-11-16 03:01:24,995 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 422 transitions. Word has length 50 [2024-11-16 03:01:24,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:24,996 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 422 transitions. [2024-11-16 03:01:24,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:24,996 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 422 transitions. [2024-11-16 03:01:24,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-16 03:01:24,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:24,997 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:25,003 INFO L540 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 (14)] Forceful destruction successful, exit code 0 [2024-11-16 03:01:25,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-16 03:01:25,200 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:25,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:25,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1003240186, now seen corresponding path program 1 times [2024-11-16 03:01:25,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:25,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409358549] [2024-11-16 03:01:25,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:25,201 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-16 03:01:25,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:25,202 INFO L229 MonitoredProcess]: Starting monitored process 15 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-16 03:01:25,204 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 (15)] Waiting until timeout for monitored process [2024-11-16 03:01:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:25,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-16 03:01:25,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:25,315 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 03:01:25,316 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:25,405 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 03:01:25,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:25,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409358549] [2024-11-16 03:01:25,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [409358549] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 03:01:25,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:01:25,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-16 03:01:25,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392702449] [2024-11-16 03:01:25,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:25,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 03:01:25,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:25,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 03:01:25,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-16 03:01:25,407 INFO L87 Difference]: Start difference. First operand 309 states and 422 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:25,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:25,479 INFO L93 Difference]: Finished difference Result 316 states and 428 transitions. [2024-11-16 03:01:25,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 03:01:25,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-16 03:01:25,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:25,482 INFO L225 Difference]: With dead ends: 316 [2024-11-16 03:01:25,482 INFO L226 Difference]: Without dead ends: 313 [2024-11-16 03:01:25,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-16 03:01:25,483 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 3 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:25,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 485 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:25,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-16 03:01:25,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2024-11-16 03:01:25,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 275 states have (on average 1.2945454545454544) internal successors, (356), 279 states have internal predecessors, (356), 30 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (39), 31 states have call predecessors, (39), 29 states have call successors, (39) [2024-11-16 03:01:25,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 425 transitions. [2024-11-16 03:01:25,498 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 425 transitions. Word has length 50 [2024-11-16 03:01:25,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:25,499 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 425 transitions. [2024-11-16 03:01:25,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:25,499 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 425 transitions. [2024-11-16 03:01:25,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-16 03:01:25,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:25,500 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:25,505 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 (15)] Ended with exit code 0 [2024-11-16 03:01:25,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-16 03:01:25,701 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:25,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:25,701 INFO L85 PathProgramCache]: Analyzing trace with hash 285578456, now seen corresponding path program 1 times [2024-11-16 03:01:25,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:25,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626652495] [2024-11-16 03:01:25,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:25,702 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-16 03:01:25,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:25,703 INFO L229 MonitoredProcess]: Starting monitored process 16 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-16 03:01:25,705 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 (16)] Waiting until timeout for monitored process [2024-11-16 03:01:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:25,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 03:01:25,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:25,872 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:25,872 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:25,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:25,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626652495] [2024-11-16 03:01:25,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [626652495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:25,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:25,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 03:01:25,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712254542] [2024-11-16 03:01:25,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:25,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 03:01:25,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:25,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 03:01:25,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-16 03:01:25,874 INFO L87 Difference]: Start difference. First operand 313 states and 425 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:26,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:26,090 INFO L93 Difference]: Finished difference Result 575 states and 787 transitions. [2024-11-16 03:01:26,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 03:01:26,091 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2024-11-16 03:01:26,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:26,093 INFO L225 Difference]: With dead ends: 575 [2024-11-16 03:01:26,093 INFO L226 Difference]: Without dead ends: 511 [2024-11-16 03:01:26,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-16 03:01:26,094 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 78 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:26,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 581 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 03:01:26,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-16 03:01:26,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 484. [2024-11-16 03:01:26,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 428 states have (on average 1.27803738317757) internal successors, (547), 432 states have internal predecessors, (547), 48 states have call successors, (48), 4 states have call predecessors, (48), 7 states have return successors, (56), 52 states have call predecessors, (56), 46 states have call successors, (56) [2024-11-16 03:01:26,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 651 transitions. [2024-11-16 03:01:26,117 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 651 transitions. Word has length 54 [2024-11-16 03:01:26,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:26,117 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 651 transitions. [2024-11-16 03:01:26,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:26,118 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 651 transitions. [2024-11-16 03:01:26,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-16 03:01:26,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:26,119 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:26,128 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 (16)] Ended with exit code 0 [2024-11-16 03:01:26,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-16 03:01:26,320 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:26,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:26,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1821727464, now seen corresponding path program 1 times [2024-11-16 03:01:26,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:26,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049085355] [2024-11-16 03:01:26,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:26,321 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-16 03:01:26,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:26,322 INFO L229 MonitoredProcess]: Starting monitored process 17 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-16 03:01:26,324 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 (17)] Waiting until timeout for monitored process [2024-11-16 03:01:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:26,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 03:01:26,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:26,385 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:26,385 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:26,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:26,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049085355] [2024-11-16 03:01:26,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049085355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:26,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:26,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:01:26,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993782506] [2024-11-16 03:01:26,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:26,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:01:26,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:26,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:01:26,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:01:26,388 INFO L87 Difference]: Start difference. First operand 484 states and 651 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:26,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:26,409 INFO L93 Difference]: Finished difference Result 534 states and 711 transitions. [2024-11-16 03:01:26,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:01:26,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2024-11-16 03:01:26,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:26,412 INFO L225 Difference]: With dead ends: 534 [2024-11-16 03:01:26,412 INFO L226 Difference]: Without dead ends: 484 [2024-11-16 03:01:26,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 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-16 03:01:26,413 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 26 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:26,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 302 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:26,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-11-16 03:01:26,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2024-11-16 03:01:26,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 428 states have (on average 1.2383177570093458) internal successors, (530), 432 states have internal predecessors, (530), 48 states have call successors, (48), 4 states have call predecessors, (48), 7 states have return successors, (56), 52 states have call predecessors, (56), 46 states have call successors, (56) [2024-11-16 03:01:26,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 634 transitions. [2024-11-16 03:01:26,433 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 634 transitions. Word has length 54 [2024-11-16 03:01:26,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:26,433 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 634 transitions. [2024-11-16 03:01:26,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:26,433 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 634 transitions. [2024-11-16 03:01:26,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-16 03:01:26,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:26,434 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:26,440 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 (17)] Ended with exit code 0 [2024-11-16 03:01:26,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-16 03:01:26,635 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:26,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:26,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1754720711, now seen corresponding path program 1 times [2024-11-16 03:01:26,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:26,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211694211] [2024-11-16 03:01:26,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:26,636 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-16 03:01:26,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:26,637 INFO L229 MonitoredProcess]: Starting monitored process 18 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-16 03:01:26,639 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 (18)] Waiting until timeout for monitored process [2024-11-16 03:01:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:26,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 03:01:26,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:26,763 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 03:01:26,763 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:26,929 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 03:01:26,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:26,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1211694211] [2024-11-16 03:01:26,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1211694211] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 03:01:26,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 03:01:26,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2024-11-16 03:01:26,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395701627] [2024-11-16 03:01:26,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 03:01:26,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 03:01:26,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:26,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 03:01:26,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-16 03:01:26,931 INFO L87 Difference]: Start difference. First operand 484 states and 634 transitions. Second operand has 16 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 12 states have internal predecessors, (53), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-16 03:01:27,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:27,092 INFO L93 Difference]: Finished difference Result 537 states and 688 transitions. [2024-11-16 03:01:27,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 03:01:27,093 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 12 states have internal predecessors, (53), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 54 [2024-11-16 03:01:27,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:27,095 INFO L225 Difference]: With dead ends: 537 [2024-11-16 03:01:27,095 INFO L226 Difference]: Without dead ends: 454 [2024-11-16 03:01:27,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-11-16 03:01:27,096 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 24 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:27,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 805 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:27,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-11-16 03:01:27,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 451. [2024-11-16 03:01:27,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 399 states have (on average 1.2305764411027569) internal successors, (491), 402 states have internal predecessors, (491), 44 states have call successors, (44), 4 states have call predecessors, (44), 7 states have return successors, (52), 49 states have call predecessors, (52), 42 states have call successors, (52) [2024-11-16 03:01:27,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 587 transitions. [2024-11-16 03:01:27,111 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 587 transitions. Word has length 54 [2024-11-16 03:01:27,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:27,111 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 587 transitions. [2024-11-16 03:01:27,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 12 states have internal predecessors, (53), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-16 03:01:27,112 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 587 transitions. [2024-11-16 03:01:27,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-16 03:01:27,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:27,113 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:27,120 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 (18)] Ended with exit code 0 [2024-11-16 03:01:27,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-16 03:01:27,314 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:27,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:27,315 INFO L85 PathProgramCache]: Analyzing trace with hash -221137629, now seen corresponding path program 1 times [2024-11-16 03:01:27,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:27,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64534813] [2024-11-16 03:01:27,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:27,315 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-16 03:01:27,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:27,317 INFO L229 MonitoredProcess]: Starting monitored process 19 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-16 03:01:27,319 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 (19)] Waiting until timeout for monitored process [2024-11-16 03:01:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:27,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 03:01:27,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:27,412 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:27,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:27,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:27,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64534813] [2024-11-16 03:01:27,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64534813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:27,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:27,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 03:01:27,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457205173] [2024-11-16 03:01:27,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:27,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 03:01:27,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:27,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 03:01:27,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:01:27,416 INFO L87 Difference]: Start difference. First operand 451 states and 587 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:27,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:27,650 INFO L93 Difference]: Finished difference Result 628 states and 819 transitions. [2024-11-16 03:01:27,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 03:01:27,651 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2024-11-16 03:01:27,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:27,653 INFO L225 Difference]: With dead ends: 628 [2024-11-16 03:01:27,653 INFO L226 Difference]: Without dead ends: 601 [2024-11-16 03:01:27,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:01:27,654 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 27 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:27,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 595 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 03:01:27,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-16 03:01:27,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 491. [2024-11-16 03:01:27,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 433 states have (on average 1.233256351039261) internal successors, (534), 439 states have internal predecessors, (534), 50 states have call successors, (50), 4 states have call predecessors, (50), 7 states have return successors, (58), 54 states have call predecessors, (58), 48 states have call successors, (58) [2024-11-16 03:01:27,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 642 transitions. [2024-11-16 03:01:27,669 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 642 transitions. Word has length 55 [2024-11-16 03:01:27,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:27,669 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 642 transitions. [2024-11-16 03:01:27,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:27,669 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 642 transitions. [2024-11-16 03:01:27,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-16 03:01:27,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:27,670 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:27,674 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 (19)] Ended with exit code 0 [2024-11-16 03:01:27,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-16 03:01:27,871 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:27,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:27,872 INFO L85 PathProgramCache]: Analyzing trace with hash -2104901330, now seen corresponding path program 1 times [2024-11-16 03:01:27,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:27,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035509188] [2024-11-16 03:01:27,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:27,872 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-16 03:01:27,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:27,876 INFO L229 MonitoredProcess]: Starting monitored process 20 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-16 03:01:27,879 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 (20)] Waiting until timeout for monitored process [2024-11-16 03:01:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:27,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 03:01:27,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 03:01:27,996 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:28,089 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 03:01:28,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:28,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035509188] [2024-11-16 03:01:28,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1035509188] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 03:01:28,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 03:01:28,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-16 03:01:28,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393611964] [2024-11-16 03:01:28,089 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 03:01:28,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 03:01:28,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:28,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 03:01:28,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-16 03:01:28,090 INFO L87 Difference]: Start difference. First operand 491 states and 642 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 12 states have internal predecessors, (53), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-16 03:01:28,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:28,251 INFO L93 Difference]: Finished difference Result 691 states and 886 transitions. [2024-11-16 03:01:28,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 03:01:28,251 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 12 states have internal predecessors, (53), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 55 [2024-11-16 03:01:28,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:28,253 INFO L225 Difference]: With dead ends: 691 [2024-11-16 03:01:28,253 INFO L226 Difference]: Without dead ends: 563 [2024-11-16 03:01:28,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-11-16 03:01:28,254 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 136 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:28,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 973 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:28,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2024-11-16 03:01:28,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 469. [2024-11-16 03:01:28,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 413 states have (on average 1.215496368038741) internal successors, (502), 418 states have internal predecessors, (502), 48 states have call successors, (48), 4 states have call predecessors, (48), 7 states have return successors, (56), 52 states have call predecessors, (56), 46 states have call successors, (56) [2024-11-16 03:01:28,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 606 transitions. [2024-11-16 03:01:28,270 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 606 transitions. Word has length 55 [2024-11-16 03:01:28,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:28,270 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 606 transitions. [2024-11-16 03:01:28,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 12 states have internal predecessors, (53), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-16 03:01:28,270 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 606 transitions. [2024-11-16 03:01:28,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-16 03:01:28,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:28,272 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:28,274 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 (20)] Ended with exit code 0 [2024-11-16 03:01:28,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-16 03:01:28,474 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:28,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:28,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1975818611, now seen corresponding path program 1 times [2024-11-16 03:01:28,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:28,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459678754] [2024-11-16 03:01:28,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:28,475 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-16 03:01:28,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:28,476 INFO L229 MonitoredProcess]: Starting monitored process 21 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-16 03:01:28,479 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 (21)] Waiting until timeout for monitored process [2024-11-16 03:01:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:28,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 03:01:28,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:28,558 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 03:01:28,558 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:28,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:28,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459678754] [2024-11-16 03:01:28,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [459678754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:28,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:28,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:01:28,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701842245] [2024-11-16 03:01:28,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:28,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:01:28,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:28,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:01:28,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:01:28,564 INFO L87 Difference]: Start difference. First operand 469 states and 606 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:28,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:28,635 INFO L93 Difference]: Finished difference Result 602 states and 770 transitions. [2024-11-16 03:01:28,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:01:28,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2024-11-16 03:01:28,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:28,638 INFO L225 Difference]: With dead ends: 602 [2024-11-16 03:01:28,638 INFO L226 Difference]: Without dead ends: 569 [2024-11-16 03:01:28,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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-16 03:01:28,638 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 42 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:28,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 282 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:28,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-11-16 03:01:28,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 473. [2024-11-16 03:01:28,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 417 states have (on average 1.211031175059952) internal successors, (505), 422 states have internal predecessors, (505), 48 states have call successors, (48), 4 states have call predecessors, (48), 7 states have return successors, (56), 52 states have call predecessors, (56), 46 states have call successors, (56) [2024-11-16 03:01:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 609 transitions. [2024-11-16 03:01:28,672 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 609 transitions. Word has length 55 [2024-11-16 03:01:28,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:28,673 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 609 transitions. [2024-11-16 03:01:28,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:28,673 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 609 transitions. [2024-11-16 03:01:28,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-16 03:01:28,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:28,674 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:28,677 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 (21)] Ended with exit code 0 [2024-11-16 03:01:28,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-16 03:01:28,877 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:28,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:28,877 INFO L85 PathProgramCache]: Analyzing trace with hash 486288144, now seen corresponding path program 1 times [2024-11-16 03:01:28,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:28,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409414733] [2024-11-16 03:01:28,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:28,878 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-16 03:01:28,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:28,880 INFO L229 MonitoredProcess]: Starting monitored process 22 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-16 03:01:28,881 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 (22)] Waiting until timeout for monitored process [2024-11-16 03:01:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:28,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 03:01:28,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:28,931 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:28,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:28,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:28,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409414733] [2024-11-16 03:01:28,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [409414733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:28,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:28,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:01:28,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066958721] [2024-11-16 03:01:28,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:28,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:01:28,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:28,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:01:28,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:01:28,934 INFO L87 Difference]: Start difference. First operand 473 states and 609 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:28,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:28,952 INFO L93 Difference]: Finished difference Result 483 states and 618 transitions. [2024-11-16 03:01:28,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:01:28,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2024-11-16 03:01:28,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:28,954 INFO L225 Difference]: With dead ends: 483 [2024-11-16 03:01:28,955 INFO L226 Difference]: Without dead ends: 428 [2024-11-16 03:01:28,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 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-16 03:01:28,955 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:28,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 303 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:28,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-16 03:01:28,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 397. [2024-11-16 03:01:28,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 350 states have (on average 1.2085714285714286) internal successors, (423), 354 states have internal predecessors, (423), 39 states have call successors, (39), 4 states have call predecessors, (39), 7 states have return successors, (44), 42 states have call predecessors, (44), 37 states have call successors, (44) [2024-11-16 03:01:28,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 506 transitions. [2024-11-16 03:01:28,969 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 506 transitions. Word has length 55 [2024-11-16 03:01:28,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:28,970 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 506 transitions. [2024-11-16 03:01:28,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:28,970 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 506 transitions. [2024-11-16 03:01:28,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-16 03:01:28,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:28,971 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:28,975 INFO L540 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 (22)] Forceful destruction successful, exit code 0 [2024-11-16 03:01:29,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-16 03:01:29,172 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:29,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:29,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1256522191, now seen corresponding path program 1 times [2024-11-16 03:01:29,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:29,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688343425] [2024-11-16 03:01:29,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:29,173 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-16 03:01:29,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:29,175 INFO L229 MonitoredProcess]: Starting monitored process 23 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-16 03:01:29,176 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 (23)] Waiting until timeout for monitored process [2024-11-16 03:01:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:29,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 03:01:29,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:29,252 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:29,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:29,300 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:29,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:29,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688343425] [2024-11-16 03:01:29,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688343425] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 03:01:29,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 03:01:29,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2024-11-16 03:01:29,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318208887] [2024-11-16 03:01:29,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 03:01:29,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 03:01:29,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:29,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 03:01:29,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:01:29,302 INFO L87 Difference]: Start difference. First operand 397 states and 506 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:01:29,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:29,368 INFO L93 Difference]: Finished difference Result 424 states and 535 transitions. [2024-11-16 03:01:29,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 03:01:29,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 55 [2024-11-16 03:01:29,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:29,370 INFO L225 Difference]: With dead ends: 424 [2024-11-16 03:01:29,370 INFO L226 Difference]: Without dead ends: 388 [2024-11-16 03:01:29,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 03:01:29,371 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 18 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:29,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 651 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:29,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-16 03:01:29,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 373. [2024-11-16 03:01:29,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 327 states have (on average 1.2110091743119267) internal successors, (396), 332 states have internal predecessors, (396), 38 states have call successors, (38), 4 states have call predecessors, (38), 7 states have return successors, (43), 40 states have call predecessors, (43), 36 states have call successors, (43) [2024-11-16 03:01:29,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 477 transitions. [2024-11-16 03:01:29,397 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 477 transitions. Word has length 55 [2024-11-16 03:01:29,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:29,397 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 477 transitions. [2024-11-16 03:01:29,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:01:29,397 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 477 transitions. [2024-11-16 03:01:29,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-16 03:01:29,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:29,398 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:29,401 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 (23)] Ended with exit code 0 [2024-11-16 03:01:29,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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-16 03:01:29,601 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:29,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:29,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1923161162, now seen corresponding path program 1 times [2024-11-16 03:01:29,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:29,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940684315] [2024-11-16 03:01:29,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:29,602 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-16 03:01:29,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:29,605 INFO L229 MonitoredProcess]: Starting monitored process 24 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-16 03:01:29,605 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 (24)] Waiting until timeout for monitored process [2024-11-16 03:01:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:29,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 03:01:29,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:29,736 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:29,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:29,838 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:29,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:29,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940684315] [2024-11-16 03:01:29,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1940684315] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 03:01:29,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:01:29,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2024-11-16 03:01:29,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719441444] [2024-11-16 03:01:29,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:29,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 03:01:29,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:29,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 03:01:29,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-16 03:01:29,840 INFO L87 Difference]: Start difference. First operand 373 states and 477 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:29,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:29,984 INFO L93 Difference]: Finished difference Result 461 states and 583 transitions. [2024-11-16 03:01:29,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 03:01:29,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2024-11-16 03:01:29,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:29,986 INFO L225 Difference]: With dead ends: 461 [2024-11-16 03:01:29,986 INFO L226 Difference]: Without dead ends: 395 [2024-11-16 03:01:29,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-16 03:01:29,987 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 25 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:29,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 399 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:29,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-16 03:01:29,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 362. [2024-11-16 03:01:29,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 316 states have (on average 1.2088607594936709) internal successors, (382), 320 states have internal predecessors, (382), 39 states have call successors, (39), 4 states have call predecessors, (39), 6 states have return successors, (40), 40 states have call predecessors, (40), 37 states have call successors, (40) [2024-11-16 03:01:29,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 461 transitions. [2024-11-16 03:01:29,998 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 461 transitions. Word has length 56 [2024-11-16 03:01:29,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:29,998 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 461 transitions. [2024-11-16 03:01:29,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:29,998 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 461 transitions. [2024-11-16 03:01:29,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-16 03:01:29,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:29,999 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:30,002 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 (24)] Ended with exit code 0 [2024-11-16 03:01:30,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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-16 03:01:30,203 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:30,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:30,203 INFO L85 PathProgramCache]: Analyzing trace with hash 214372017, now seen corresponding path program 1 times [2024-11-16 03:01:30,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:30,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221616640] [2024-11-16 03:01:30,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:30,203 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-16 03:01:30,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:30,206 INFO L229 MonitoredProcess]: Starting monitored process 25 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-16 03:01:30,215 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 (25)] Waiting until timeout for monitored process [2024-11-16 03:01:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:30,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-16 03:01:30,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:30,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:30,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:30,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221616640] [2024-11-16 03:01:30,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221616640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:30,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:30,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-16 03:01:30,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740977297] [2024-11-16 03:01:30,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:30,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 03:01:30,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:30,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 03:01:30,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-16 03:01:30,434 INFO L87 Difference]: Start difference. First operand 362 states and 461 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-16 03:01:30,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:30,678 INFO L93 Difference]: Finished difference Result 452 states and 573 transitions. [2024-11-16 03:01:30,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 03:01:30,678 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 59 [2024-11-16 03:01:30,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:30,679 INFO L225 Difference]: With dead ends: 452 [2024-11-16 03:01:30,680 INFO L226 Difference]: Without dead ends: 405 [2024-11-16 03:01:30,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-11-16 03:01:30,680 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 71 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:30,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 789 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 03:01:30,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-16 03:01:30,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 362. [2024-11-16 03:01:30,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 316 states have (on average 1.1993670886075949) internal successors, (379), 320 states have internal predecessors, (379), 39 states have call successors, (39), 4 states have call predecessors, (39), 6 states have return successors, (40), 40 states have call predecessors, (40), 37 states have call successors, (40) [2024-11-16 03:01:30,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 458 transitions. [2024-11-16 03:01:30,694 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 458 transitions. Word has length 59 [2024-11-16 03:01:30,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:30,695 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 458 transitions. [2024-11-16 03:01:30,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-16 03:01:30,695 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 458 transitions. [2024-11-16 03:01:30,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-16 03:01:30,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:30,696 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:30,698 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 (25)] Ended with exit code 0 [2024-11-16 03:01:30,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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-16 03:01:30,897 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:30,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:30,897 INFO L85 PathProgramCache]: Analyzing trace with hash -75463734, now seen corresponding path program 1 times [2024-11-16 03:01:30,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:30,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1869091606] [2024-11-16 03:01:30,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:30,897 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-16 03:01:30,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:30,900 INFO L229 MonitoredProcess]: Starting monitored process 26 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-16 03:01:30,901 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 (26)] Waiting until timeout for monitored process [2024-11-16 03:01:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:30,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 03:01:30,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:31,041 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:31,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:31,131 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:31,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:31,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1869091606] [2024-11-16 03:01:31,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1869091606] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 03:01:31,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 03:01:31,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-16 03:01:31,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428363424] [2024-11-16 03:01:31,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 03:01:31,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 03:01:31,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:31,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 03:01:31,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-16 03:01:31,133 INFO L87 Difference]: Start difference. First operand 362 states and 458 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 11 states have internal predecessors, (55), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-16 03:01:31,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:31,248 INFO L93 Difference]: Finished difference Result 450 states and 570 transitions. [2024-11-16 03:01:31,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 03:01:31,248 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 11 states have internal predecessors, (55), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 60 [2024-11-16 03:01:31,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:31,251 INFO L225 Difference]: With dead ends: 450 [2024-11-16 03:01:31,251 INFO L226 Difference]: Without dead ends: 369 [2024-11-16 03:01:31,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-11-16 03:01:31,252 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 55 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:31,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 706 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:31,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-16 03:01:31,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 336. [2024-11-16 03:01:31,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 293 states have (on average 1.1945392491467577) internal successors, (350), 296 states have internal predecessors, (350), 36 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (37), 37 states have call predecessors, (37), 34 states have call successors, (37) [2024-11-16 03:01:31,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 423 transitions. [2024-11-16 03:01:31,264 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 423 transitions. Word has length 60 [2024-11-16 03:01:31,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:31,265 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 423 transitions. [2024-11-16 03:01:31,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 11 states have internal predecessors, (55), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-16 03:01:31,265 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 423 transitions. [2024-11-16 03:01:31,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-16 03:01:31,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:31,266 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:31,269 INFO L540 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 (26)] Forceful destruction successful, exit code 0 [2024-11-16 03:01:31,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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-16 03:01:31,469 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:31,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:31,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1609106870, now seen corresponding path program 1 times [2024-11-16 03:01:31,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:31,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817072041] [2024-11-16 03:01:31,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:31,470 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-16 03:01:31,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:31,472 INFO L229 MonitoredProcess]: Starting monitored process 27 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-16 03:01:31,473 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 (27)] Waiting until timeout for monitored process [2024-11-16 03:01:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:31,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 03:01:31,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:31,684 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 03:01:31,684 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:31,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:31,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817072041] [2024-11-16 03:01:31,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817072041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:01:31,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1528230939] [2024-11-16 03:01:31,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:31,852 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 03:01:31,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 03:01:31,854 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 03:01:31,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-16 03:01:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:31,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 03:01:31,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:32,117 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 03:01:32,118 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:32,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1528230939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:01:32,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 03:01:32,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2024-11-16 03:01:32,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485711170] [2024-11-16 03:01:32,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 03:01:32,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 03:01:32,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:32,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 03:01:32,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-16 03:01:32,159 INFO L87 Difference]: Start difference. First operand 336 states and 423 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-16 03:01:32,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:32,331 INFO L93 Difference]: Finished difference Result 389 states and 487 transitions. [2024-11-16 03:01:32,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 03:01:32,332 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 60 [2024-11-16 03:01:32,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:32,333 INFO L225 Difference]: With dead ends: 389 [2024-11-16 03:01:32,333 INFO L226 Difference]: Without dead ends: 337 [2024-11-16 03:01:32,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 126 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-16 03:01:32,334 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 36 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:32,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 703 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:32,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-16 03:01:32,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 313. [2024-11-16 03:01:32,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 273 states have (on average 1.1941391941391941) internal successors, (326), 275 states have internal predecessors, (326), 33 states have call successors, (33), 4 states have call predecessors, (33), 6 states have return successors, (34), 34 states have call predecessors, (34), 31 states have call successors, (34) [2024-11-16 03:01:32,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 393 transitions. [2024-11-16 03:01:32,344 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 393 transitions. Word has length 60 [2024-11-16 03:01:32,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:32,345 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 393 transitions. [2024-11-16 03:01:32,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-16 03:01:32,345 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 393 transitions. [2024-11-16 03:01:32,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-16 03:01:32,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:32,347 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:32,352 INFO L540 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 (27)] Forceful destruction successful, exit code 0 [2024-11-16 03:01:32,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2024-11-16 03:01:32,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-16 03:01:32,750 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:32,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:32,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1718244615, now seen corresponding path program 1 times [2024-11-16 03:01:32,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:32,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584790920] [2024-11-16 03:01:32,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:32,751 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-16 03:01:32,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:32,753 INFO L229 MonitoredProcess]: Starting monitored process 29 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-16 03:01:32,754 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 (29)] Waiting until timeout for monitored process [2024-11-16 03:01:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:32,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 03:01:32,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 03:01:32,908 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:32,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:32,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584790920] [2024-11-16 03:01:32,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584790920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:32,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:32,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 03:01:32,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830921870] [2024-11-16 03:01:32,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:32,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 03:01:32,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:32,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 03:01:32,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-16 03:01:32,910 INFO L87 Difference]: Start difference. First operand 313 states and 393 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:01:33,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:33,148 INFO L93 Difference]: Finished difference Result 389 states and 485 transitions. [2024-11-16 03:01:33,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 03:01:33,148 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 60 [2024-11-16 03:01:33,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:33,149 INFO L225 Difference]: With dead ends: 389 [2024-11-16 03:01:33,149 INFO L226 Difference]: Without dead ends: 331 [2024-11-16 03:01:33,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-11-16 03:01:33,150 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 58 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:33,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 964 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:33,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-16 03:01:33,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 313. [2024-11-16 03:01:33,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 273 states have (on average 1.1831501831501832) internal successors, (323), 275 states have internal predecessors, (323), 33 states have call successors, (33), 4 states have call predecessors, (33), 6 states have return successors, (34), 34 states have call predecessors, (34), 31 states have call successors, (34) [2024-11-16 03:01:33,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 390 transitions. [2024-11-16 03:01:33,162 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 390 transitions. Word has length 60 [2024-11-16 03:01:33,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:33,163 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 390 transitions. [2024-11-16 03:01:33,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:01:33,163 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 390 transitions. [2024-11-16 03:01:33,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-16 03:01:33,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:33,164 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:33,167 INFO L540 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 (29)] Forceful destruction successful, exit code 0 [2024-11-16 03:01:33,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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-16 03:01:33,364 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:33,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:33,365 INFO L85 PathProgramCache]: Analyzing trace with hash -700053452, now seen corresponding path program 1 times [2024-11-16 03:01:33,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:33,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [400599718] [2024-11-16 03:01:33,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:33,365 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-16 03:01:33,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:33,368 INFO L229 MonitoredProcess]: Starting monitored process 30 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-16 03:01:33,368 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 (30)] Waiting until timeout for monitored process [2024-11-16 03:01:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:33,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 03:01:33,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:33,462 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 03:01:33,462 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:33,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:33,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [400599718] [2024-11-16 03:01:33,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [400599718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:33,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:33,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 03:01:33,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525823833] [2024-11-16 03:01:33,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:33,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 03:01:33,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:33,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 03:01:33,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 03:01:33,464 INFO L87 Difference]: Start difference. First operand 313 states and 390 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:01:33,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:33,578 INFO L93 Difference]: Finished difference Result 343 states and 421 transitions. [2024-11-16 03:01:33,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 03:01:33,579 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 61 [2024-11-16 03:01:33,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:33,580 INFO L225 Difference]: With dead ends: 343 [2024-11-16 03:01:33,580 INFO L226 Difference]: Without dead ends: 258 [2024-11-16 03:01:33,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-16 03:01:33,580 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 39 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:33,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 717 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:33,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-16 03:01:33,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 242. [2024-11-16 03:01:33,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 212 states have (on average 1.1745283018867925) internal successors, (249), 214 states have internal predecessors, (249), 23 states have call successors, (23), 4 states have call predecessors, (23), 6 states have return successors, (24), 24 states have call predecessors, (24), 21 states have call successors, (24) [2024-11-16 03:01:33,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 296 transitions. [2024-11-16 03:01:33,590 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 296 transitions. Word has length 61 [2024-11-16 03:01:33,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:33,590 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 296 transitions. [2024-11-16 03:01:33,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:01:33,590 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 296 transitions. [2024-11-16 03:01:33,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-16 03:01:33,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:33,591 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:33,594 INFO L540 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 (30)] Forceful destruction successful, exit code 0 [2024-11-16 03:01:33,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /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-16 03:01:33,794 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:33,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:33,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1365864898, now seen corresponding path program 1 times [2024-11-16 03:01:33,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:33,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638891792] [2024-11-16 03:01:33,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:33,795 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-16 03:01:33,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:33,797 INFO L229 MonitoredProcess]: Starting monitored process 31 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-16 03:01:33,798 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 (31)] Waiting until timeout for monitored process [2024-11-16 03:01:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:33,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 03:01:33,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:34,058 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-16 03:01:34,058 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:34,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:34,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1638891792] [2024-11-16 03:01:34,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1638891792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:34,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:34,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 03:01:34,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065946880] [2024-11-16 03:01:34,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:34,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 03:01:34,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:34,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 03:01:34,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-16 03:01:34,060 INFO L87 Difference]: Start difference. First operand 242 states and 296 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:01:34,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:34,183 INFO L93 Difference]: Finished difference Result 263 states and 319 transitions. [2024-11-16 03:01:34,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 03:01:34,183 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 61 [2024-11-16 03:01:34,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:34,184 INFO L225 Difference]: With dead ends: 263 [2024-11-16 03:01:34,184 INFO L226 Difference]: Without dead ends: 260 [2024-11-16 03:01:34,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-16 03:01:34,185 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 8 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:34,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 545 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:34,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-16 03:01:34,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 249. [2024-11-16 03:01:34,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 215 states have (on average 1.172093023255814) internal successors, (252), 220 states have internal predecessors, (252), 26 states have call successors, (26), 5 states have call predecessors, (26), 7 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2024-11-16 03:01:34,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 305 transitions. [2024-11-16 03:01:34,193 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 305 transitions. Word has length 61 [2024-11-16 03:01:34,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:34,193 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 305 transitions. [2024-11-16 03:01:34,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:01:34,194 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 305 transitions. [2024-11-16 03:01:34,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-16 03:01:34,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:34,194 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:34,197 INFO L540 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 (31)] Forceful destruction successful, exit code 0 [2024-11-16 03:01:34,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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-16 03:01:34,397 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:34,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:34,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1818167843, now seen corresponding path program 1 times [2024-11-16 03:01:34,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:34,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [910686183] [2024-11-16 03:01:34,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:34,398 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-16 03:01:34,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:34,401 INFO L229 MonitoredProcess]: Starting monitored process 32 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-16 03:01:34,405 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 (32)] Waiting until timeout for monitored process [2024-11-16 03:01:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:34,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 03:01:34,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:43,135 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-16 03:01:43,135 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:43,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:43,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [910686183] [2024-11-16 03:01:43,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [910686183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:43,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:43,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 03:01:43,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682983866] [2024-11-16 03:01:43,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:43,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 03:01:43,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:43,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 03:01:43,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=37, Unknown=3, NotChecked=0, Total=56 [2024-11-16 03:01:43,136 INFO L87 Difference]: Start difference. First operand 249 states and 305 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:01:47,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 03:01:51,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.95s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 03:01:55,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 03:01:58,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 03:02:01,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.77s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 03:02:06,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 03:02:10,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 03:02:12,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 03:02:12,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:02:12,816 INFO L93 Difference]: Finished difference Result 261 states and 316 transitions. [2024-11-16 03:02:12,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 03:02:12,816 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 62 [2024-11-16 03:02:12,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:02:12,817 INFO L225 Difference]: With dead ends: 261 [2024-11-16 03:02:12,817 INFO L226 Difference]: Without dead ends: 258 [2024-11-16 03:02:12,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=20, Invalid=49, Unknown=3, NotChecked=0, Total=72 [2024-11-16 03:02:12,818 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 7 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.6s IncrementalHoareTripleChecker+Time [2024-11-16 03:02:12,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 541 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 7 Unknown, 0 Unchecked, 29.6s Time] [2024-11-16 03:02:12,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-16 03:02:12,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 246. [2024-11-16 03:02:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 215 states have (on average 1.172093023255814) internal successors, (252), 217 states have internal predecessors, (252), 23 states have call successors, (23), 5 states have call predecessors, (23), 7 states have return successors, (24), 24 states have call predecessors, (24), 21 states have call successors, (24) [2024-11-16 03:02:12,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 299 transitions. [2024-11-16 03:02:12,827 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 299 transitions. Word has length 62 [2024-11-16 03:02:12,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:02:12,828 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 299 transitions. [2024-11-16 03:02:12,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:02:12,828 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 299 transitions. [2024-11-16 03:02:12,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-16 03:02:12,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:02:12,829 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:02:12,834 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 (32)] Ended with exit code 0 [2024-11-16 03:02:13,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /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-16 03:02:13,029 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:02:13,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:02:13,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1895138400, now seen corresponding path program 1 times [2024-11-16 03:02:13,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:02:13,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525141667] [2024-11-16 03:02:13,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:02:13,030 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-16 03:02:13,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:02:13,032 INFO L229 MonitoredProcess]: Starting monitored process 33 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-16 03:02:13,034 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 (33)] Waiting until timeout for monitored process [2024-11-16 03:02:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:02:13,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 03:02:13,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:02:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 03:02:13,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:02:13,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:02:13,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525141667] [2024-11-16 03:02:13,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525141667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:02:13,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:02:13,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 03:02:13,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225742129] [2024-11-16 03:02:13,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:02:13,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 03:02:13,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:02:13,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 03:02:13,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:02:13,119 INFO L87 Difference]: Start difference. First operand 246 states and 299 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-16 03:02:13,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:02:13,177 INFO L93 Difference]: Finished difference Result 259 states and 312 transitions. [2024-11-16 03:02:13,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 03:02:13,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 66 [2024-11-16 03:02:13,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:02:13,179 INFO L225 Difference]: With dead ends: 259 [2024-11-16 03:02:13,179 INFO L226 Difference]: Without dead ends: 256 [2024-11-16 03:02:13,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:02:13,179 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 8 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:02:13,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 486 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:02:13,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-16 03:02:13,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 252. [2024-11-16 03:02:13,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 219 states have (on average 1.1689497716894977) internal successors, (256), 222 states have internal predecessors, (256), 24 states have call successors, (24), 6 states have call predecessors, (24), 8 states have return successors, (25), 24 states have call predecessors, (25), 22 states have call successors, (25) [2024-11-16 03:02:13,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 305 transitions. [2024-11-16 03:02:13,189 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 305 transitions. Word has length 66 [2024-11-16 03:02:13,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:02:13,189 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 305 transitions. [2024-11-16 03:02:13,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-16 03:02:13,189 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 305 transitions. [2024-11-16 03:02:13,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-16 03:02:13,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:02:13,190 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:02:13,195 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 (33)] Ended with exit code 0 [2024-11-16 03:02:13,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /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-16 03:02:13,394 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:02:13,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:02:13,395 INFO L85 PathProgramCache]: Analyzing trace with hash -2063134992, now seen corresponding path program 1 times [2024-11-16 03:02:13,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:02:13,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063087619] [2024-11-16 03:02:13,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:02:13,395 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-16 03:02:13,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:02:13,396 INFO L229 MonitoredProcess]: Starting monitored process 34 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-16 03:02:13,398 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 (34)] Waiting until timeout for monitored process [2024-11-16 03:02:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:02:13,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 03:02:13,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:02:13,484 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 03:02:13,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:02:13,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:02:13,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2063087619] [2024-11-16 03:02:13,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2063087619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:02:13,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:02:13,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 03:02:13,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246818138] [2024-11-16 03:02:13,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:02:13,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 03:02:13,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:02:13,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 03:02:13,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:02:13,485 INFO L87 Difference]: Start difference. First operand 252 states and 305 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-16 03:02:13,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:02:13,578 INFO L93 Difference]: Finished difference Result 275 states and 328 transitions. [2024-11-16 03:02:13,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 03:02:13,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 66 [2024-11-16 03:02:13,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:02:13,579 INFO L225 Difference]: With dead ends: 275 [2024-11-16 03:02:13,580 INFO L226 Difference]: Without dead ends: 272 [2024-11-16 03:02:13,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:02:13,580 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 20 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:02:13,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 577 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:02:13,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-16 03:02:13,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 256. [2024-11-16 03:02:13,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 222 states have (on average 1.1666666666666667) internal successors, (259), 225 states have internal predecessors, (259), 24 states have call successors, (24), 7 states have call predecessors, (24), 9 states have return successors, (25), 24 states have call predecessors, (25), 22 states have call successors, (25) [2024-11-16 03:02:13,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 308 transitions. [2024-11-16 03:02:13,606 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 308 transitions. Word has length 66 [2024-11-16 03:02:13,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:02:13,607 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 308 transitions. [2024-11-16 03:02:13,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-16 03:02:13,607 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 308 transitions. [2024-11-16 03:02:13,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-16 03:02:13,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:02:13,608 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:02:13,612 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 (34)] Ended with exit code 0 [2024-11-16 03:02:13,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /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-16 03:02:13,808 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:02:13,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:02:13,809 INFO L85 PathProgramCache]: Analyzing trace with hash 958127631, now seen corresponding path program 1 times [2024-11-16 03:02:13,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:02:13,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329014672] [2024-11-16 03:02:13,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:02:13,810 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-16 03:02:13,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:02:13,817 INFO L229 MonitoredProcess]: Starting monitored process 35 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-16 03:02:13,818 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 (35)] Waiting until timeout for monitored process [2024-11-16 03:02:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:02:13,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-16 03:02:13,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:02:14,301 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-16 03:02:14,301 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:02:14,756 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-16 03:02:14,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:02:14,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329014672] [2024-11-16 03:02:14,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1329014672] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 03:02:14,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:02:14,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 22 [2024-11-16 03:02:14,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96101308] [2024-11-16 03:02:14,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:02:14,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 03:02:14,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:02:14,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 03:02:14,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2024-11-16 03:02:14,758 INFO L87 Difference]: Start difference. First operand 256 states and 308 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-16 03:02:15,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:02:15,231 INFO L93 Difference]: Finished difference Result 326 states and 392 transitions. [2024-11-16 03:02:15,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 03:02:15,232 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 72 [2024-11-16 03:02:15,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:02:15,233 INFO L225 Difference]: With dead ends: 326 [2024-11-16 03:02:15,233 INFO L226 Difference]: Without dead ends: 305 [2024-11-16 03:02:15,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2024-11-16 03:02:15,234 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 20 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:02:15,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 579 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:02:15,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-16 03:02:15,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 281. [2024-11-16 03:02:15,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 243 states have (on average 1.1563786008230452) internal successors, (281), 246 states have internal predecessors, (281), 28 states have call successors, (28), 7 states have call predecessors, (28), 9 states have return successors, (29), 28 states have call predecessors, (29), 26 states have call successors, (29) [2024-11-16 03:02:15,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 338 transitions. [2024-11-16 03:02:15,244 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 338 transitions. Word has length 72 [2024-11-16 03:02:15,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:02:15,244 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 338 transitions. [2024-11-16 03:02:15,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-16 03:02:15,245 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 338 transitions. [2024-11-16 03:02:15,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-16 03:02:15,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:02:15,246 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:02:15,248 INFO L540 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 (35)] Forceful destruction successful, exit code 0 [2024-11-16 03:02:15,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /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-16 03:02:15,448 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:02:15,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:02:15,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1636854375, now seen corresponding path program 1 times [2024-11-16 03:02:15,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:02:15,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369277929] [2024-11-16 03:02:15,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:02:15,449 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-16 03:02:15,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:02:15,451 INFO L229 MonitoredProcess]: Starting monitored process 36 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-16 03:02:15,452 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 (36)] Waiting until timeout for monitored process [2024-11-16 03:02:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:02:15,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-16 03:02:15,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:02:16,314 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-16 03:02:16,314 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:02:16,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:02:16,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369277929] [2024-11-16 03:02:16,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369277929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:02:16,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:02:16,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-16 03:02:16,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624696442] [2024-11-16 03:02:16,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:02:16,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 03:02:16,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:02:16,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 03:02:16,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-16 03:02:16,316 INFO L87 Difference]: Start difference. First operand 281 states and 338 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-16 03:02:18,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:02:18,484 INFO L93 Difference]: Finished difference Result 407 states and 494 transitions. [2024-11-16 03:02:18,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 03:02:18,485 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 72 [2024-11-16 03:02:18,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:02:18,486 INFO L225 Difference]: With dead ends: 407 [2024-11-16 03:02:18,486 INFO L226 Difference]: Without dead ends: 368 [2024-11-16 03:02:18,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-16 03:02:18,487 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 31 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:02:18,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1083 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-16 03:02:18,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-16 03:02:18,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 303. [2024-11-16 03:02:18,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 262 states have (on average 1.1564885496183206) internal successors, (303), 266 states have internal predecessors, (303), 31 states have call successors, (31), 7 states have call predecessors, (31), 9 states have return successors, (32), 31 states have call predecessors, (32), 29 states have call successors, (32) [2024-11-16 03:02:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 366 transitions. [2024-11-16 03:02:18,516 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 366 transitions. Word has length 72 [2024-11-16 03:02:18,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:02:18,516 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 366 transitions. [2024-11-16 03:02:18,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-16 03:02:18,516 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 366 transitions. [2024-11-16 03:02:18,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-16 03:02:18,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:02:18,517 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:02:18,524 INFO L540 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 (36)] Forceful destruction successful, exit code 0 [2024-11-16 03:02:18,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /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-16 03:02:18,720 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:02:18,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:02:18,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1382117830, now seen corresponding path program 1 times [2024-11-16 03:02:18,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:02:18,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814047779] [2024-11-16 03:02:18,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:02:18,721 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-16 03:02:18,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:02:18,723 INFO L229 MonitoredProcess]: Starting monitored process 37 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-16 03:02:18,724 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 (37)] Waiting until timeout for monitored process [2024-11-16 03:02:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:02:18,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-16 03:02:18,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:02:20,638 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-16 03:02:20,638 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:02:20,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:02:20,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814047779] [2024-11-16 03:02:20,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814047779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:02:20,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:02:20,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 03:02:20,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021185924] [2024-11-16 03:02:20,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:02:20,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 03:02:20,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:02:20,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 03:02:20,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-16 03:02:20,648 INFO L87 Difference]: Start difference. First operand 303 states and 366 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-16 03:02:24,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 03:02:25,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:02:25,982 INFO L93 Difference]: Finished difference Result 430 states and 523 transitions. [2024-11-16 03:02:25,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 03:02:25,983 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 72 [2024-11-16 03:02:25,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:02:25,984 INFO L225 Difference]: With dead ends: 430 [2024-11-16 03:02:25,984 INFO L226 Difference]: Without dead ends: 401 [2024-11-16 03:02:25,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-11-16 03:02:25,985 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 31 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-16 03:02:25,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 714 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 308 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2024-11-16 03:02:25,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-16 03:02:25,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 303. [2024-11-16 03:02:25,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 262 states have (on average 1.1564885496183206) internal successors, (303), 266 states have internal predecessors, (303), 31 states have call successors, (31), 7 states have call predecessors, (31), 9 states have return successors, (32), 31 states have call predecessors, (32), 29 states have call successors, (32) [2024-11-16 03:02:25,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 366 transitions. [2024-11-16 03:02:25,999 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 366 transitions. Word has length 72 [2024-11-16 03:02:26,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:02:26,000 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 366 transitions. [2024-11-16 03:02:26,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-16 03:02:26,000 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 366 transitions. [2024-11-16 03:02:26,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-16 03:02:26,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:02:26,001 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:02:26,006 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 (37)] Ended with exit code 0 [2024-11-16 03:02:26,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /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-16 03:02:26,201 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:02:26,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:02:26,202 INFO L85 PathProgramCache]: Analyzing trace with hash 321214824, now seen corresponding path program 1 times [2024-11-16 03:02:26,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:02:26,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470578623] [2024-11-16 03:02:26,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:02:26,202 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-16 03:02:26,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:02:26,203 INFO L229 MonitoredProcess]: Starting monitored process 38 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-16 03:02:26,205 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 (38)] Waiting until timeout for monitored process [2024-11-16 03:02:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:02:26,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-16 03:02:26,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:02:27,093 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-16 03:02:27,094 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:02:27,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:02:27,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470578623] [2024-11-16 03:02:27,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470578623] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:02:27,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [20351536] [2024-11-16 03:02:27,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:02:27,328 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 03:02:27,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 03:02:27,330 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 03:02:27,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2024-11-16 03:02:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:02:27,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-16 03:02:27,419 INFO L278 TraceCheckSpWp]: Computing forward predicates...