./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/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-wip.fs.cvc5-61a6796-m [2024-10-13 22:39:34,693 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 22:39:34,734 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 22:39:34,737 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 22:39:34,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 22:39:34,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 22:39:34,764 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 22:39:34,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 22:39:34,764 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 22:39:34,765 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 22:39:34,765 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 22:39:34,766 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 22:39:34,766 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 22:39:34,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 22:39:34,768 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 22:39:34,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 22:39:34,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 22:39:34,768 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 22:39:34,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 22:39:34,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 22:39:34,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 22:39:34,770 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 22:39:34,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 22:39:34,771 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 22:39:34,771 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 22:39:34,771 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 22:39:34,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 22:39:34,771 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 22:39:34,772 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 22:39:34,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 22:39:34,772 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 22:39:34,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 22:39:34,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:39:34,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 22:39:34,773 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 22:39:34,773 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 22:39:34,773 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 22:39:34,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 22:39:34,774 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 22:39:34,774 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 22:39:34,774 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 22:39:34,775 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 22:39:34,775 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-10-13 22:39:35,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 22:39:35,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 22:39:35,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 22:39:35,039 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 22:39:35,040 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 22:39:35,040 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2024-10-13 22:39:36,305 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 22:39:36,519 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 22:39:36,520 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2024-10-13 22:39:36,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f56df8f1/adaa61ffc04f47aba049265ee0ce4fcc/FLAGe8eddf385 [2024-10-13 22:39:36,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f56df8f1/adaa61ffc04f47aba049265ee0ce4fcc [2024-10-13 22:39:36,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 22:39:36,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 22:39:36,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 22:39:36,554 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 22:39:36,559 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 22:39:36,559 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:39:36" (1/1) ... [2024-10-13 22:39:36,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@764ee017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:36, skipping insertion in model container [2024-10-13 22:39:36,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:39:36" (1/1) ... [2024-10-13 22:39:36,592 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 22:39:36,733 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c[755,768] [2024-10-13 22:39:36,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:39:36,810 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 22:39:36,821 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c[755,768] [2024-10-13 22:39:36,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:39:36,868 INFO L204 MainTranslator]: Completed translation [2024-10-13 22:39:36,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:36 WrapperNode [2024-10-13 22:39:36,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 22:39:36,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 22:39:36,871 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 22:39:36,871 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 22:39:36,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:36" (1/1) ... [2024-10-13 22:39:36,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:36" (1/1) ... [2024-10-13 22:39:36,919 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 190 [2024-10-13 22:39:36,919 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 22:39:36,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 22:39:36,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 22:39:36,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 22:39:36,934 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:36" (1/1) ... [2024-10-13 22:39:36,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:36" (1/1) ... [2024-10-13 22:39:36,936 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:36" (1/1) ... [2024-10-13 22:39:36,950 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 22:39:36,951 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:36" (1/1) ... [2024-10-13 22:39:36,951 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:36" (1/1) ... [2024-10-13 22:39:36,955 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:36" (1/1) ... [2024-10-13 22:39:36,958 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:36" (1/1) ... [2024-10-13 22:39:36,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:36" (1/1) ... [2024-10-13 22:39:36,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:36" (1/1) ... [2024-10-13 22:39:36,971 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 22:39:36,972 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 22:39:36,972 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 22:39:36,972 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 22:39:36,973 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:36" (1/1) ... [2024-10-13 22:39:36,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:39:36,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:37,003 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 22:39:37,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 22:39:37,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 22:39:37,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 22:39:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-10-13 22:39:37,072 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-10-13 22:39:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 22:39:37,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 22:39:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 22:39:37,073 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 22:39:37,168 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 22:39:37,174 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 22:39:37,550 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-10-13 22:39:37,551 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 22:39:37,582 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 22:39:37,584 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 22:39:37,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:39:37 BoogieIcfgContainer [2024-10-13 22:39:37,584 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 22:39:37,586 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 22:39:37,587 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 22:39:37,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 22:39:37,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:39:36" (1/3) ... [2024-10-13 22:39:37,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68982232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:39:37, skipping insertion in model container [2024-10-13 22:39:37,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:36" (2/3) ... [2024-10-13 22:39:37,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68982232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:39:37, skipping insertion in model container [2024-10-13 22:39:37,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:39:37" (3/3) ... [2024-10-13 22:39:37,591 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2024-10-13 22:39:37,604 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 22:39:37,605 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 22:39:37,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 22:39:37,674 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;@b0939c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 22:39:37,675 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 22:39:37,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 79 states have (on average 1.620253164556962) internal successors, (128), 82 states have internal predecessors, (128), 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-10-13 22:39:37,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 22:39:37,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:37,689 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:39:37,689 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:37,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:37,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1350693099, now seen corresponding path program 1 times [2024-10-13 22:39:37,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:37,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584361959] [2024-10-13 22:39:37,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:37,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:37,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:37,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:38,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 22:39:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:39:38,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:38,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584361959] [2024-10-13 22:39:38,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584361959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:38,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:38,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:38,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152714506] [2024-10-13 22:39:38,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:38,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:38,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:38,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:38,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:38,053 INFO L87 Difference]: Start difference. First operand has 91 states, 79 states have (on average 1.620253164556962) internal successors, (128), 82 states have internal predecessors, (128), 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 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-10-13 22:39:38,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:38,113 INFO L93 Difference]: Finished difference Result 215 states and 351 transitions. [2024-10-13 22:39:38,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:38,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 32 [2024-10-13 22:39:38,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:38,122 INFO L225 Difference]: With dead ends: 215 [2024-10-13 22:39:38,123 INFO L226 Difference]: Without dead ends: 124 [2024-10-13 22:39:38,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-10-13 22:39:38,130 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 41 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:38,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 256 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:38,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-13 22:39:38,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-13 22:39:38,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 111 states have (on average 1.4864864864864864) internal successors, (165), 113 states have internal predecessors, (165), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 22:39:38,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 184 transitions. [2024-10-13 22:39:38,194 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 184 transitions. Word has length 32 [2024-10-13 22:39:38,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:38,195 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 184 transitions. [2024-10-13 22:39:38,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-10-13 22:39:38,195 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 184 transitions. [2024-10-13 22:39:38,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 22:39:38,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:38,202 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:39:38,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 22:39:38,203 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:38,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:38,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1536909670, now seen corresponding path program 1 times [2024-10-13 22:39:38,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:38,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109585062] [2024-10-13 22:39:38,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:38,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:38,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:38,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:38,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 22:39:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:38,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:39:38,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:38,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109585062] [2024-10-13 22:39:38,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109585062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:38,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:38,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 22:39:38,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363084858] [2024-10-13 22:39:38,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:38,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 22:39:38,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:38,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 22:39:38,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 22:39:38,506 INFO L87 Difference]: Start difference. First operand 124 states and 184 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-10-13 22:39:38,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:38,641 INFO L93 Difference]: Finished difference Result 256 states and 384 transitions. [2024-10-13 22:39:38,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 22:39:38,643 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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 32 [2024-10-13 22:39:38,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:38,646 INFO L225 Difference]: With dead ends: 256 [2024-10-13 22:39:38,648 INFO L226 Difference]: Without dead ends: 165 [2024-10-13 22:39:38,649 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-10-13 22:39:38,650 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 35 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:38,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 693 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:38,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-13 22:39:38,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2024-10-13 22:39:38,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 147 states have (on average 1.4557823129251701) internal successors, (214), 150 states have internal predecessors, (214), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) [2024-10-13 22:39:38,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2024-10-13 22:39:38,676 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 32 [2024-10-13 22:39:38,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:38,678 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2024-10-13 22:39:38,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-10-13 22:39:38,678 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2024-10-13 22:39:38,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 22:39:38,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:38,681 INFO L215 NwaCegarLoop]: trace histogram [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-10-13 22:39:38,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 22:39:38,681 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:38,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:38,682 INFO L85 PathProgramCache]: Analyzing trace with hash 358892418, now seen corresponding path program 1 times [2024-10-13 22:39:38,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:38,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713053877] [2024-10-13 22:39:38,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:38,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:38,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:38,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:38,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 22:39:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:38,761 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:39:38,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:38,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713053877] [2024-10-13 22:39:38,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713053877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:38,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:38,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:38,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101384757] [2024-10-13 22:39:38,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:38,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:38,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:38,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:38,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:38,767 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10-13 22:39:38,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:38,790 INFO L93 Difference]: Finished difference Result 297 states and 438 transitions. [2024-10-13 22:39:38,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:38,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 34 [2024-10-13 22:39:38,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:38,792 INFO L225 Difference]: With dead ends: 297 [2024-10-13 22:39:38,792 INFO L226 Difference]: Without dead ends: 241 [2024-10-13 22:39:38,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-10-13 22:39:38,794 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 53 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:38,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 282 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:38,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-13 22:39:38,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 227. [2024-10-13 22:39:38,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 207 states have (on average 1.4202898550724639) internal successors, (294), 211 states have internal predecessors, (294), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (17), 15 states have call predecessors, (17), 14 states have call successors, (17) [2024-10-13 22:39:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 327 transitions. [2024-10-13 22:39:38,814 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 327 transitions. Word has length 34 [2024-10-13 22:39:38,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:38,814 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 327 transitions. [2024-10-13 22:39:38,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10-13 22:39:38,815 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 327 transitions. [2024-10-13 22:39:38,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-13 22:39:38,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:38,816 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:39:38,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 22:39:38,817 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:38,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:38,818 INFO L85 PathProgramCache]: Analyzing trace with hash -648098927, now seen corresponding path program 1 times [2024-10-13 22:39:38,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:38,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206451845] [2024-10-13 22:39:38,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:38,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:38,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:38,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:38,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 22:39:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:38,934 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:39:38,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:38,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206451845] [2024-10-13 22:39:38,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206451845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:38,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:38,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 22:39:38,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495351741] [2024-10-13 22:39:38,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:38,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:39:38,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:38,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:39:38,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:39:38,938 INFO L87 Difference]: Start difference. First operand 227 states and 327 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-10-13 22:39:38,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:38,965 INFO L93 Difference]: Finished difference Result 357 states and 517 transitions. [2024-10-13 22:39:38,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:39:38,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 35 [2024-10-13 22:39:38,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:38,968 INFO L225 Difference]: With dead ends: 357 [2024-10-13 22:39:38,968 INFO L226 Difference]: Without dead ends: 315 [2024-10-13 22:39:38,969 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-10-13 22:39:38,970 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 53 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:38,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 421 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:38,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-13 22:39:38,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 289. [2024-10-13 22:39:38,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 263 states have (on average 1.4182509505703422) internal successors, (373), 269 states have internal predecessors, (373), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (23), 21 states have call predecessors, (23), 20 states have call successors, (23) [2024-10-13 22:39:38,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 418 transitions. [2024-10-13 22:39:38,997 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 418 transitions. Word has length 35 [2024-10-13 22:39:38,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:38,998 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 418 transitions. [2024-10-13 22:39:38,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-10-13 22:39:38,998 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 418 transitions. [2024-10-13 22:39:38,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-13 22:39:39,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:39,000 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:39:39,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 22:39:39,000 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:39,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:39,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1927962605, now seen corresponding path program 1 times [2024-10-13 22:39:39,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:39,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811593570] [2024-10-13 22:39:39,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:39,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:39,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:39,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:39,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 22:39:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:39,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:39:39,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:39,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811593570] [2024-10-13 22:39:39,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811593570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:39,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:39,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:39,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451150190] [2024-10-13 22:39:39,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:39,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:39,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:39,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:39,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:39,041 INFO L87 Difference]: Start difference. First operand 289 states and 418 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-10-13 22:39:39,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:39,054 INFO L93 Difference]: Finished difference Result 298 states and 428 transitions. [2024-10-13 22:39:39,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:39,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 35 [2024-10-13 22:39:39,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:39,056 INFO L225 Difference]: With dead ends: 298 [2024-10-13 22:39:39,056 INFO L226 Difference]: Without dead ends: 291 [2024-10-13 22:39:39,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-10-13 22:39:39,058 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:39,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 255 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:39,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-13 22:39:39,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2024-10-13 22:39:39,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 265 states have (on average 1.4150943396226414) internal successors, (375), 271 states have internal predecessors, (375), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (23), 21 states have call predecessors, (23), 20 states have call successors, (23) [2024-10-13 22:39:39,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 420 transitions. [2024-10-13 22:39:39,069 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 420 transitions. Word has length 35 [2024-10-13 22:39:39,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:39,070 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 420 transitions. [2024-10-13 22:39:39,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-10-13 22:39:39,070 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 420 transitions. [2024-10-13 22:39:39,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 22:39:39,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:39,071 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:39:39,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 22:39:39,072 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:39,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:39,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1807034423, now seen corresponding path program 1 times [2024-10-13 22:39:39,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:39,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543380313] [2024-10-13 22:39:39,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:39,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:39,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:39,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:39,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 22:39:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:39,117 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:39:39,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:39,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543380313] [2024-10-13 22:39:39,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543380313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:39,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:39,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 22:39:39,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556318208] [2024-10-13 22:39:39,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:39,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:39:39,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:39,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:39:39,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:39:39,119 INFO L87 Difference]: Start difference. First operand 291 states and 420 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-10-13 22:39:39,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:39,142 INFO L93 Difference]: Finished difference Result 452 states and 658 transitions. [2024-10-13 22:39:39,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:39:39,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 36 [2024-10-13 22:39:39,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:39,144 INFO L225 Difference]: With dead ends: 452 [2024-10-13 22:39:39,144 INFO L226 Difference]: Without dead ends: 392 [2024-10-13 22:39:39,144 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-10-13 22:39:39,145 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 54 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:39,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 496 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:39,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-13 22:39:39,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 341. [2024-10-13 22:39:39,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 315 states have (on average 1.403174603174603) internal successors, (442), 319 states have internal predecessors, (442), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (23), 21 states have call predecessors, (23), 20 states have call successors, (23) [2024-10-13 22:39:39,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 487 transitions. [2024-10-13 22:39:39,154 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 487 transitions. Word has length 36 [2024-10-13 22:39:39,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:39,155 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 487 transitions. [2024-10-13 22:39:39,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-10-13 22:39:39,155 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 487 transitions. [2024-10-13 22:39:39,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 22:39:39,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:39,156 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:39:39,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 22:39:39,156 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:39,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:39,156 INFO L85 PathProgramCache]: Analyzing trace with hash 669523543, now seen corresponding path program 1 times [2024-10-13 22:39:39,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:39,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342129220] [2024-10-13 22:39:39,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:39,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:39,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:39,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:39,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 22:39:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:39,250 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:39:39,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:39,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342129220] [2024-10-13 22:39:39,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342129220] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:39,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565584991] [2024-10-13 22:39:39,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:39,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:39,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:39,256 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:39,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 22:39:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:39,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 22:39:39,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:39,379 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:39:39,380 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:39,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565584991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:39,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:39:39,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-10-13 22:39:39,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718565205] [2024-10-13 22:39:39,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:39,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 22:39:39,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:39,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 22:39:39,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-13 22:39:39,382 INFO L87 Difference]: Start difference. First operand 341 states and 487 transitions. Second operand has 6 states, 5 states have (on average 5.0) 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-10-13 22:39:39,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:39,447 INFO L93 Difference]: Finished difference Result 625 states and 904 transitions. [2024-10-13 22:39:39,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 22:39:39,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) 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 36 [2024-10-13 22:39:39,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:39,450 INFO L225 Difference]: With dead ends: 625 [2024-10-13 22:39:39,450 INFO L226 Difference]: Without dead ends: 545 [2024-10-13 22:39:39,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-13 22:39:39,451 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 72 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:39,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 713 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:39,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-10-13 22:39:39,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 544. [2024-10-13 22:39:39,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 503 states have (on average 1.411530815109344) internal successors, (710), 509 states have internal predecessors, (710), 36 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (40), 36 states have call predecessors, (40), 34 states have call successors, (40) [2024-10-13 22:39:39,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 786 transitions. [2024-10-13 22:39:39,486 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 786 transitions. Word has length 36 [2024-10-13 22:39:39,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:39,486 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 786 transitions. [2024-10-13 22:39:39,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) 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-10-13 22:39:39,487 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 786 transitions. [2024-10-13 22:39:39,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-13 22:39:39,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:39,488 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:39:39,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 22:39:39,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:39,689 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:39,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:39,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1618202317, now seen corresponding path program 1 times [2024-10-13 22:39:39,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:39,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196267306] [2024-10-13 22:39:39,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:39,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:39,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:39,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:39,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 22:39:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:39:39,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:39,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196267306] [2024-10-13 22:39:39,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196267306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:39,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:39,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 22:39:39,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231216734] [2024-10-13 22:39:39,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:39,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:39:39,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:39,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:39:39,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:39:39,751 INFO L87 Difference]: Start difference. First operand 544 states and 786 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10-13 22:39:39,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:39,772 INFO L93 Difference]: Finished difference Result 557 states and 801 transitions. [2024-10-13 22:39:39,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:39:39,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 37 [2024-10-13 22:39:39,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:39,775 INFO L225 Difference]: With dead ends: 557 [2024-10-13 22:39:39,775 INFO L226 Difference]: Without dead ends: 550 [2024-10-13 22:39:39,775 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-10-13 22:39:39,776 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:39,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 382 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:39,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-10-13 22:39:39,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 547. [2024-10-13 22:39:39,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 506 states have (on average 1.4090909090909092) internal successors, (713), 512 states have internal predecessors, (713), 36 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (40), 36 states have call predecessors, (40), 34 states have call successors, (40) [2024-10-13 22:39:39,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 789 transitions. [2024-10-13 22:39:39,791 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 789 transitions. Word has length 37 [2024-10-13 22:39:39,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:39,791 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 789 transitions. [2024-10-13 22:39:39,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10-13 22:39:39,792 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 789 transitions. [2024-10-13 22:39:39,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-13 22:39:39,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:39,793 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:39:39,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 22:39:39,793 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:39,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:39,793 INFO L85 PathProgramCache]: Analyzing trace with hash -901757617, now seen corresponding path program 1 times [2024-10-13 22:39:39,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:39,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896390515] [2024-10-13 22:39:39,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:39,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:39,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:39,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:39,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 22:39:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:39,844 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:39:39,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:39,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896390515] [2024-10-13 22:39:39,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896390515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:39,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:39,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 22:39:39,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507786330] [2024-10-13 22:39:39,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:39,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 22:39:39,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:39,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 22:39:39,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 22:39:39,846 INFO L87 Difference]: Start difference. First operand 547 states and 789 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10-13 22:39:39,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:39,875 INFO L93 Difference]: Finished difference Result 554 states and 795 transitions. [2024-10-13 22:39:39,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 22:39:39,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 37 [2024-10-13 22:39:39,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:39,878 INFO L225 Difference]: With dead ends: 554 [2024-10-13 22:39:39,878 INFO L226 Difference]: Without dead ends: 547 [2024-10-13 22:39:39,878 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-10-13 22:39:39,879 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 3 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:39,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 504 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:39,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-10-13 22:39:39,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 541. [2024-10-13 22:39:39,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 500 states have (on average 1.406) internal successors, (703), 506 states have internal predecessors, (703), 36 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (40), 36 states have call predecessors, (40), 34 states have call successors, (40) [2024-10-13 22:39:39,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 779 transitions. [2024-10-13 22:39:39,891 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 779 transitions. Word has length 37 [2024-10-13 22:39:39,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:39,891 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 779 transitions. [2024-10-13 22:39:39,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10-13 22:39:39,891 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 779 transitions. [2024-10-13 22:39:39,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-13 22:39:39,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:39,892 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:39:39,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 22:39:39,892 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:39,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:39,893 INFO L85 PathProgramCache]: Analyzing trace with hash 113810481, now seen corresponding path program 1 times [2024-10-13 22:39:39,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:39,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979816806] [2024-10-13 22:39:39,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:39,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:40,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:40,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:40,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 22:39:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:39:40,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:40,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979816806] [2024-10-13 22:39:40,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979816806] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:40,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306710725] [2024-10-13 22:39:40,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:40,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:40,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:40,055 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:40,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 22:39:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:40,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 22:39:40,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:40,129 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:39:40,129 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:40,249 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:39:40,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306710725] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:39:40,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:39:40,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2024-10-13 22:39:40,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556090497] [2024-10-13 22:39:40,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:39:40,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 22:39:40,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:40,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 22:39:40,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-13 22:39:40,251 INFO L87 Difference]: Start difference. First operand 541 states and 779 transitions. Second operand has 12 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-13 22:39:40,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:40,378 INFO L93 Difference]: Finished difference Result 928 states and 1333 transitions. [2024-10-13 22:39:40,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 22:39:40,379 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 38 [2024-10-13 22:39:40,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:40,381 INFO L225 Difference]: With dead ends: 928 [2024-10-13 22:39:40,381 INFO L226 Difference]: Without dead ends: 592 [2024-10-13 22:39:40,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-13 22:39:40,382 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 14 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:40,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 871 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:40,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-10-13 22:39:40,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 570. [2024-10-13 22:39:40,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 526 states have (on average 1.3897338403041826) internal successors, (731), 526 states have internal predecessors, (731), 39 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (49), 45 states have call predecessors, (49), 37 states have call successors, (49) [2024-10-13 22:39:40,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 819 transitions. [2024-10-13 22:39:40,410 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 819 transitions. Word has length 38 [2024-10-13 22:39:40,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:40,410 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 819 transitions. [2024-10-13 22:39:40,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-13 22:39:40,411 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 819 transitions. [2024-10-13 22:39:40,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 22:39:40,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:40,412 INFO L215 NwaCegarLoop]: trace histogram [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-10-13 22:39:40,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 22:39:40,615 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,SelfDestructingSolverStorable9 [2024-10-13 22:39:40,615 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:40,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:40,616 INFO L85 PathProgramCache]: Analyzing trace with hash 2124788580, now seen corresponding path program 1 times [2024-10-13 22:39:40,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:40,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467704224] [2024-10-13 22:39:40,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:40,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:40,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:40,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:40,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 22:39:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:40,654 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:39:40,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:40,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467704224] [2024-10-13 22:39:40,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467704224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:40,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:40,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 22:39:40,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413296639] [2024-10-13 22:39:40,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:40,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:39:40,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:40,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:39:40,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:39:40,656 INFO L87 Difference]: Start difference. First operand 570 states and 819 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-10-13 22:39:40,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:40,678 INFO L93 Difference]: Finished difference Result 604 states and 864 transitions. [2024-10-13 22:39:40,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:39:40,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 40 [2024-10-13 22:39:40,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:40,680 INFO L225 Difference]: With dead ends: 604 [2024-10-13 22:39:40,680 INFO L226 Difference]: Without dead ends: 547 [2024-10-13 22:39:40,680 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-10-13 22:39:40,681 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 39 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 429 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-10-13 22:39:40,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 429 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:40,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-10-13 22:39:40,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 445. [2024-10-13 22:39:40,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 411 states have (on average 1.364963503649635) internal successors, (561), 409 states have internal predecessors, (561), 29 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (39), 35 states have call predecessors, (39), 27 states have call successors, (39) [2024-10-13 22:39:40,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 629 transitions. [2024-10-13 22:39:40,693 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 629 transitions. Word has length 40 [2024-10-13 22:39:40,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:40,693 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 629 transitions. [2024-10-13 22:39:40,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-10-13 22:39:40,693 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 629 transitions. [2024-10-13 22:39:40,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 22:39:40,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:40,696 INFO L215 NwaCegarLoop]: trace histogram [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-10-13 22:39:40,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 22:39:40,696 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:40,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:40,697 INFO L85 PathProgramCache]: Analyzing trace with hash 717424053, now seen corresponding path program 1 times [2024-10-13 22:39:40,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:40,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867687123] [2024-10-13 22:39:40,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:40,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:40,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:40,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:40,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 22:39:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:40,844 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:39:40,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:40,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867687123] [2024-10-13 22:39:40,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867687123] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:40,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897836834] [2024-10-13 22:39:40,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:40,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:40,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:40,847 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:40,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 22:39:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:40,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 22:39:40,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:40,986 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:39:40,986 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:40,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897836834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:40,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:39:40,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2024-10-13 22:39:40,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886187742] [2024-10-13 22:39:40,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:40,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 22:39:40,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:40,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 22:39:40,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-10-13 22:39:40,988 INFO L87 Difference]: Start difference. First operand 445 states and 629 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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-10-13 22:39:41,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:41,109 INFO L93 Difference]: Finished difference Result 589 states and 833 transitions. [2024-10-13 22:39:41,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 22:39:41,110 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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 40 [2024-10-13 22:39:41,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:41,111 INFO L225 Difference]: With dead ends: 589 [2024-10-13 22:39:41,112 INFO L226 Difference]: Without dead ends: 477 [2024-10-13 22:39:41,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-10-13 22:39:41,112 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 80 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:41,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 938 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:41,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-10-13 22:39:41,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 469. [2024-10-13 22:39:41,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 435 states have (on average 1.354022988505747) internal successors, (589), 433 states have internal predecessors, (589), 29 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (39), 35 states have call predecessors, (39), 27 states have call successors, (39) [2024-10-13 22:39:41,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 657 transitions. [2024-10-13 22:39:41,124 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 657 transitions. Word has length 40 [2024-10-13 22:39:41,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:41,125 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 657 transitions. [2024-10-13 22:39:41,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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-10-13 22:39:41,125 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 657 transitions. [2024-10-13 22:39:41,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 22:39:41,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:41,126 INFO L215 NwaCegarLoop]: trace histogram [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-10-13 22:39:41,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 22:39:41,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:41,328 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:41,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:41,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1110451063, now seen corresponding path program 1 times [2024-10-13 22:39:41,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:41,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424095762] [2024-10-13 22:39:41,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:41,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:41,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:41,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:41,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 22:39:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:41,471 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:39:41,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:41,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424095762] [2024-10-13 22:39:41,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424095762] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:41,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752062883] [2024-10-13 22:39:41,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:41,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:41,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:41,474 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:41,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 22:39:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:41,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 22:39:41,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:41,607 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:39:41,607 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:41,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752062883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:41,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:39:41,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2024-10-13 22:39:41,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368861409] [2024-10-13 22:39:41,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:41,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 22:39:41,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:41,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 22:39:41,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-10-13 22:39:41,611 INFO L87 Difference]: Start difference. First operand 469 states and 657 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 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-10-13 22:39:41,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:41,768 INFO L93 Difference]: Finished difference Result 685 states and 965 transitions. [2024-10-13 22:39:41,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 22:39:41,768 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 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 40 [2024-10-13 22:39:41,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:41,771 INFO L225 Difference]: With dead ends: 685 [2024-10-13 22:39:41,772 INFO L226 Difference]: Without dead ends: 557 [2024-10-13 22:39:41,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2024-10-13 22:39:41,773 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 129 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:41,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1149 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:41,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-10-13 22:39:41,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 469. [2024-10-13 22:39:41,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 435 states have (on average 1.3448275862068966) internal successors, (585), 433 states have internal predecessors, (585), 29 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (39), 35 states have call predecessors, (39), 27 states have call successors, (39) [2024-10-13 22:39:41,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 653 transitions. [2024-10-13 22:39:41,786 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 653 transitions. Word has length 40 [2024-10-13 22:39:41,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:41,786 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 653 transitions. [2024-10-13 22:39:41,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 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-10-13 22:39:41,787 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 653 transitions. [2024-10-13 22:39:41,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-13 22:39:41,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:41,787 INFO L215 NwaCegarLoop]: trace histogram [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-10-13 22:39:41,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 22:39:41,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:41,992 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:41,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:41,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1869285858, now seen corresponding path program 1 times [2024-10-13 22:39:41,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:41,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088139622] [2024-10-13 22:39:41,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:41,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:42,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:42,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:42,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 22:39:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:42,051 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:39:42,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:42,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088139622] [2024-10-13 22:39:42,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088139622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:42,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:42,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 22:39:42,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219704904] [2024-10-13 22:39:42,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:42,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 22:39:42,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:42,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 22:39:42,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 22:39:42,054 INFO L87 Difference]: Start difference. First operand 469 states and 653 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-10-13 22:39:42,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:42,168 INFO L93 Difference]: Finished difference Result 548 states and 760 transitions. [2024-10-13 22:39:42,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 22:39:42,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 41 [2024-10-13 22:39:42,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:42,170 INFO L225 Difference]: With dead ends: 548 [2024-10-13 22:39:42,170 INFO L226 Difference]: Without dead ends: 535 [2024-10-13 22:39:42,171 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-10-13 22:39:42,171 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 48 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:42,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 508 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:42,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-13 22:39:42,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 524. [2024-10-13 22:39:42,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 487 states have (on average 1.3408624229979467) internal successors, (653), 485 states have internal predecessors, (653), 32 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (42), 38 states have call predecessors, (42), 30 states have call successors, (42) [2024-10-13 22:39:42,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 727 transitions. [2024-10-13 22:39:42,183 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 727 transitions. Word has length 41 [2024-10-13 22:39:42,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:42,184 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 727 transitions. [2024-10-13 22:39:42,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-10-13 22:39:42,184 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 727 transitions. [2024-10-13 22:39:42,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-13 22:39:42,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:42,185 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:39:42,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 22:39:42,185 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:42,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:42,186 INFO L85 PathProgramCache]: Analyzing trace with hash -2139996302, now seen corresponding path program 1 times [2024-10-13 22:39:42,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:42,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217416821] [2024-10-13 22:39:42,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:42,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:42,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:42,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:42,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 22:39:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:42,293 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:39:42,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:42,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217416821] [2024-10-13 22:39:42,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217416821] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:42,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675256156] [2024-10-13 22:39:42,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:42,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:42,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:42,297 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:42,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 22:39:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:42,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 22:39:42,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 22:39:42,469 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:42,706 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 22:39:42,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675256156] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:39:42,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:39:42,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 12] total 23 [2024-10-13 22:39:42,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955144200] [2024-10-13 22:39:42,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:39:42,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-13 22:39:42,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:42,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 22:39:42,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2024-10-13 22:39:42,709 INFO L87 Difference]: Start difference. First operand 524 states and 727 transitions. Second operand has 23 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 19 states have internal predecessors, (58), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 22:39:43,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:43,102 INFO L93 Difference]: Finished difference Result 1292 states and 1805 transitions. [2024-10-13 22:39:43,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 22:39:43,102 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 19 states have internal predecessors, (58), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2024-10-13 22:39:43,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:43,105 INFO L225 Difference]: With dead ends: 1292 [2024-10-13 22:39:43,105 INFO L226 Difference]: Without dead ends: 898 [2024-10-13 22:39:43,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2024-10-13 22:39:43,107 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 388 mSDsluCounter, 1699 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1827 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:43,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1827 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 22:39:43,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-10-13 22:39:43,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 694. [2024-10-13 22:39:43,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 648 states have (on average 1.3395061728395061) internal successors, (868), 643 states have internal predecessors, (868), 41 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (53), 50 states have call predecessors, (53), 39 states have call successors, (53) [2024-10-13 22:39:43,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 962 transitions. [2024-10-13 22:39:43,123 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 962 transitions. Word has length 42 [2024-10-13 22:39:43,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:43,123 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 962 transitions. [2024-10-13 22:39:43,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 19 states have internal predecessors, (58), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 22:39:43,124 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 962 transitions. [2024-10-13 22:39:43,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-13 22:39:43,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:43,125 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:39:43,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 22:39:43,328 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,SelfDestructingSolverStorable14 [2024-10-13 22:39:43,331 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:43,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:43,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1492698540, now seen corresponding path program 1 times [2024-10-13 22:39:43,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:43,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398787612] [2024-10-13 22:39:43,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:43,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:43,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:43,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:43,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 22:39:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:43,512 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:39:43,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:43,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398787612] [2024-10-13 22:39:43,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398787612] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:43,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059519187] [2024-10-13 22:39:43,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:43,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:43,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:43,514 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:43,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 22:39:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:43,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 22:39:43,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:43,586 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:39:43,587 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:43,694 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:39:43,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059519187] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:39:43,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:39:43,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-10-13 22:39:43,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750868133] [2024-10-13 22:39:43,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:39:43,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 22:39:43,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:43,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 22:39:43,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-13 22:39:43,696 INFO L87 Difference]: Start difference. First operand 694 states and 962 transitions. Second operand has 14 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 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-10-13 22:39:43,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:43,811 INFO L93 Difference]: Finished difference Result 775 states and 1057 transitions. [2024-10-13 22:39:43,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 22:39:43,812 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 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 42 [2024-10-13 22:39:43,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:43,814 INFO L225 Difference]: With dead ends: 775 [2024-10-13 22:39:43,814 INFO L226 Difference]: Without dead ends: 612 [2024-10-13 22:39:43,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-10-13 22:39:43,815 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 16 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:43,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1038 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:43,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-10-13 22:39:43,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 586. [2024-10-13 22:39:43,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 548 states have (on average 1.322992700729927) internal successors, (725), 543 states have internal predecessors, (725), 33 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (45), 42 states have call predecessors, (45), 31 states have call successors, (45) [2024-10-13 22:39:43,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 803 transitions. [2024-10-13 22:39:43,831 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 803 transitions. Word has length 42 [2024-10-13 22:39:43,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:43,831 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 803 transitions. [2024-10-13 22:39:43,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 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-10-13 22:39:43,831 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 803 transitions. [2024-10-13 22:39:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-13 22:39:43,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:43,832 INFO L215 NwaCegarLoop]: trace histogram [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-10-13 22:39:43,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-13 22:39:44,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-13 22:39:44,037 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:44,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:44,038 INFO L85 PathProgramCache]: Analyzing trace with hash 794362524, now seen corresponding path program 1 times [2024-10-13 22:39:44,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:44,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849562476] [2024-10-13 22:39:44,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:44,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:44,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:44,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:44,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 22:39:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:44,167 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:39:44,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:44,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849562476] [2024-10-13 22:39:44,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849562476] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:44,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431559176] [2024-10-13 22:39:44,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:44,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:44,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:44,168 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:44,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 22:39:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:44,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 22:39:44,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:44,269 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:39:44,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:44,328 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:39:44,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431559176] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:44,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 22:39:44,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 10] total 13 [2024-10-13 22:39:44,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967262954] [2024-10-13 22:39:44,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:44,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 22:39:44,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:44,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 22:39:44,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-13 22:39:44,331 INFO L87 Difference]: Start difference. First operand 586 states and 803 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-10-13 22:39:44,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:44,422 INFO L93 Difference]: Finished difference Result 954 states and 1321 transitions. [2024-10-13 22:39:44,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 22:39:44,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 43 [2024-10-13 22:39:44,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:44,425 INFO L225 Difference]: With dead ends: 954 [2024-10-13 22:39:44,425 INFO L226 Difference]: Without dead ends: 906 [2024-10-13 22:39:44,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-13 22:39:44,426 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 46 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:44,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 507 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:44,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2024-10-13 22:39:44,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 776. [2024-10-13 22:39:44,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 724 states have (on average 1.3052486187845305) internal successors, (945), 721 states have internal predecessors, (945), 47 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (59), 56 states have call predecessors, (59), 45 states have call successors, (59) [2024-10-13 22:39:44,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1051 transitions. [2024-10-13 22:39:44,445 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1051 transitions. Word has length 43 [2024-10-13 22:39:44,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:44,446 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1051 transitions. [2024-10-13 22:39:44,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-10-13 22:39:44,446 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1051 transitions. [2024-10-13 22:39:44,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-13 22:39:44,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:44,447 INFO L215 NwaCegarLoop]: trace histogram [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-10-13 22:39:44,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-13 22:39:44,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:44,648 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:44,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:44,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1495427102, now seen corresponding path program 1 times [2024-10-13 22:39:44,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:44,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474911617] [2024-10-13 22:39:44,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:44,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:44,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:44,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:44,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 22:39:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:44,686 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:39:44,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:44,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474911617] [2024-10-13 22:39:44,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474911617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:44,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:44,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 22:39:44,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833269156] [2024-10-13 22:39:44,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:44,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:39:44,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:44,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:39:44,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:39:44,688 INFO L87 Difference]: Start difference. First operand 776 states and 1051 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-10-13 22:39:44,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:44,708 INFO L93 Difference]: Finished difference Result 798 states and 1075 transitions. [2024-10-13 22:39:44,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:39:44,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 43 [2024-10-13 22:39:44,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:44,711 INFO L225 Difference]: With dead ends: 798 [2024-10-13 22:39:44,711 INFO L226 Difference]: Without dead ends: 732 [2024-10-13 22:39:44,712 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-10-13 22:39:44,712 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:44,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 377 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:44,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-10-13 22:39:44,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 715. [2024-10-13 22:39:44,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 663 states have (on average 1.3092006033182504) internal successors, (868), 663 states have internal predecessors, (868), 47 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (57), 54 states have call predecessors, (57), 45 states have call successors, (57) [2024-10-13 22:39:44,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 972 transitions. [2024-10-13 22:39:44,730 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 972 transitions. Word has length 43 [2024-10-13 22:39:44,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:44,731 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 972 transitions. [2024-10-13 22:39:44,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-10-13 22:39:44,731 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 972 transitions. [2024-10-13 22:39:44,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 22:39:44,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:44,732 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:44,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 22:39:44,732 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:44,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:44,733 INFO L85 PathProgramCache]: Analyzing trace with hash -377347303, now seen corresponding path program 1 times [2024-10-13 22:39:44,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:44,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324505721] [2024-10-13 22:39:44,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:44,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:44,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:44,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:44,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 22:39:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:44,857 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:39:44,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:44,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324505721] [2024-10-13 22:39:44,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324505721] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:44,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406686055] [2024-10-13 22:39:44,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:44,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:44,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:44,859 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:44,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 22:39:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:44,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 22:39:44,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:45,003 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:39:45,004 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:45,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406686055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:45,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:39:45,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 13 [2024-10-13 22:39:45,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935865946] [2024-10-13 22:39:45,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:45,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 22:39:45,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:45,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 22:39:45,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-13 22:39:45,005 INFO L87 Difference]: Start difference. First operand 715 states and 972 transitions. Second operand has 12 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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-10-13 22:39:45,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:45,343 INFO L93 Difference]: Finished difference Result 1562 states and 2142 transitions. [2024-10-13 22:39:45,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 22:39:45,343 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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 44 [2024-10-13 22:39:45,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:45,347 INFO L225 Difference]: With dead ends: 1562 [2024-10-13 22:39:45,347 INFO L226 Difference]: Without dead ends: 1070 [2024-10-13 22:39:45,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2024-10-13 22:39:45,348 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 205 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:45,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1355 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 22:39:45,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2024-10-13 22:39:45,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 954. [2024-10-13 22:39:45,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 885 states have (on average 1.3016949152542372) internal successors, (1152), 883 states have internal predecessors, (1152), 64 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (75), 73 states have call predecessors, (75), 61 states have call successors, (75) [2024-10-13 22:39:45,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1291 transitions. [2024-10-13 22:39:45,373 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1291 transitions. Word has length 44 [2024-10-13 22:39:45,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:45,373 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1291 transitions. [2024-10-13 22:39:45,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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-10-13 22:39:45,373 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1291 transitions. [2024-10-13 22:39:45,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 22:39:45,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:45,374 INFO L215 NwaCegarLoop]: trace histogram [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-10-13 22:39:45,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 22:39:45,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:45,576 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:45,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:45,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1420221009, now seen corresponding path program 1 times [2024-10-13 22:39:45,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:45,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188254756] [2024-10-13 22:39:45,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:45,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:45,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:45,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:45,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 22:39:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:45,674 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:39:45,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:45,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188254756] [2024-10-13 22:39:45,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188254756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:45,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:45,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 22:39:45,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119849241] [2024-10-13 22:39:45,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:45,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 22:39:45,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:45,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 22:39:45,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 22:39:45,676 INFO L87 Difference]: Start difference. First operand 954 states and 1291 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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-10-13 22:39:45,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:45,868 INFO L93 Difference]: Finished difference Result 1211 states and 1657 transitions. [2024-10-13 22:39:45,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 22:39:45,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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 45 [2024-10-13 22:39:45,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:45,872 INFO L225 Difference]: With dead ends: 1211 [2024-10-13 22:39:45,872 INFO L226 Difference]: Without dead ends: 1191 [2024-10-13 22:39:45,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 22:39:45,873 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 71 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:45,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 651 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:45,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2024-10-13 22:39:45,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1034. [2024-10-13 22:39:45,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 957 states have (on average 1.2936259143155695) internal successors, (1238), 956 states have internal predecessors, (1238), 72 states have call successors, (72), 2 states have call predecessors, (72), 4 states have return successors, (83), 81 states have call predecessors, (83), 69 states have call successors, (83) [2024-10-13 22:39:45,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1393 transitions. [2024-10-13 22:39:45,900 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1393 transitions. Word has length 45 [2024-10-13 22:39:45,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:45,900 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1393 transitions. [2024-10-13 22:39:45,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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-10-13 22:39:45,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1393 transitions. [2024-10-13 22:39:45,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 22:39:45,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:45,902 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:45,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 22:39:45,902 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:45,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:45,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1252728667, now seen corresponding path program 1 times [2024-10-13 22:39:45,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:45,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410514219] [2024-10-13 22:39:45,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:45,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:46,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:46,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:46,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 22:39:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:46,050 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:39:46,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:46,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410514219] [2024-10-13 22:39:46,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410514219] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:46,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240426484] [2024-10-13 22:39:46,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:46,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:46,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:46,053 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-10-13 22:39:46,059 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-10-13 22:39:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:46,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-13 22:39:46,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:46,246 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:39:46,246 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:46,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240426484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:46,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:39:46,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 15 [2024-10-13 22:39:46,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555338292] [2024-10-13 22:39:46,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:46,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 22:39:46,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:46,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 22:39:46,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-13 22:39:46,248 INFO L87 Difference]: Start difference. First operand 1034 states and 1393 transitions. Second operand has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 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-10-13 22:39:46,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:46,528 INFO L93 Difference]: Finished difference Result 1136 states and 1522 transitions. [2024-10-13 22:39:46,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 22:39:46,528 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 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 46 [2024-10-13 22:39:46,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:46,532 INFO L225 Difference]: With dead ends: 1136 [2024-10-13 22:39:46,532 INFO L226 Difference]: Without dead ends: 1134 [2024-10-13 22:39:46,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-10-13 22:39:46,533 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 130 mSDsluCounter, 1432 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:46,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1568 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 22:39:46,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2024-10-13 22:39:46,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1042. [2024-10-13 22:39:46,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 963 states have (on average 1.291796469366563) internal successors, (1244), 963 states have internal predecessors, (1244), 73 states have call successors, (73), 3 states have call predecessors, (73), 5 states have return successors, (84), 81 states have call predecessors, (84), 70 states have call successors, (84) [2024-10-13 22:39:46,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1401 transitions. [2024-10-13 22:39:46,562 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1401 transitions. Word has length 46 [2024-10-13 22:39:46,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:46,562 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1401 transitions. [2024-10-13 22:39:46,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 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-10-13 22:39:46,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1401 transitions. [2024-10-13 22:39:46,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-13 22:39:46,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:46,564 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:39:46,578 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-10-13 22:39:46,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:46,765 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:46,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:46,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1469021491, now seen corresponding path program 1 times [2024-10-13 22:39:46,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:46,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989640016] [2024-10-13 22:39:46,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:46,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:46,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:46,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:46,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 22:39:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:46,816 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:39:46,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:46,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989640016] [2024-10-13 22:39:46,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989640016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:46,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:46,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 22:39:46,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619880198] [2024-10-13 22:39:46,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:46,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:39:46,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:46,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:39:46,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:39:46,818 INFO L87 Difference]: Start difference. First operand 1042 states and 1401 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-10-13 22:39:46,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:46,847 INFO L93 Difference]: Finished difference Result 1051 states and 1409 transitions. [2024-10-13 22:39:46,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:39:46,847 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 47 [2024-10-13 22:39:46,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:46,850 INFO L225 Difference]: With dead ends: 1051 [2024-10-13 22:39:46,850 INFO L226 Difference]: Without dead ends: 1005 [2024-10-13 22:39:46,851 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-10-13 22:39:46,852 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:46,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 374 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:46,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2024-10-13 22:39:46,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 934. [2024-10-13 22:39:46,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 864 states have (on average 1.306712962962963) internal successors, (1129), 865 states have internal predecessors, (1129), 64 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (73), 70 states have call predecessors, (73), 61 states have call successors, (73) [2024-10-13 22:39:46,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1266 transitions. [2024-10-13 22:39:46,880 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1266 transitions. Word has length 47 [2024-10-13 22:39:46,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:46,881 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1266 transitions. [2024-10-13 22:39:46,881 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-10-13 22:39:46,881 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1266 transitions. [2024-10-13 22:39:46,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-13 22:39:46,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:46,882 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:46,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 22:39:46,882 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:46,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:46,883 INFO L85 PathProgramCache]: Analyzing trace with hash -419675748, now seen corresponding path program 1 times [2024-10-13 22:39:46,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:46,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908151577] [2024-10-13 22:39:46,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:46,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:46,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:46,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:46,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 22:39:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:46,910 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:39:46,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:46,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908151577] [2024-10-13 22:39:46,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908151577] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:46,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081848783] [2024-10-13 22:39:46,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:46,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:46,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:46,912 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-10-13 22:39:46,917 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-10-13 22:39:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:46,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 22:39:46,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:46,973 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 22:39:46,973 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:46,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081848783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:46,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:39:46,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-10-13 22:39:46,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496037303] [2024-10-13 22:39:46,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:46,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:46,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:46,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:46,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:39:46,974 INFO L87 Difference]: Start difference. First operand 934 states and 1266 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-10-13 22:39:47,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:47,021 INFO L93 Difference]: Finished difference Result 1865 states and 2532 transitions. [2024-10-13 22:39:47,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:47,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 47 [2024-10-13 22:39:47,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:47,024 INFO L225 Difference]: With dead ends: 1865 [2024-10-13 22:39:47,024 INFO L226 Difference]: Without dead ends: 939 [2024-10-13 22:39:47,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:39:47,027 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 5 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:47,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 229 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:47,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2024-10-13 22:39:47,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 937. [2024-10-13 22:39:47,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 867 states have (on average 1.3068050749711648) internal successors, (1133), 868 states have internal predecessors, (1133), 64 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (73), 70 states have call predecessors, (73), 61 states have call successors, (73) [2024-10-13 22:39:47,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1270 transitions. [2024-10-13 22:39:47,055 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1270 transitions. Word has length 47 [2024-10-13 22:39:47,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:47,055 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1270 transitions. [2024-10-13 22:39:47,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-10-13 22:39:47,055 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1270 transitions. [2024-10-13 22:39:47,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-13 22:39:47,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:47,057 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:47,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-13 22:39:47,258 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,SelfDestructingSolverStorable22 [2024-10-13 22:39:47,258 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:47,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:47,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1415483536, now seen corresponding path program 1 times [2024-10-13 22:39:47,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:47,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346068324] [2024-10-13 22:39:47,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:47,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:47,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:47,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:47,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 22:39:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:47,285 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 22:39:47,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:47,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346068324] [2024-10-13 22:39:47,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346068324] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:47,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432224909] [2024-10-13 22:39:47,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:47,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:47,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:47,288 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-10-13 22:39:47,290 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-10-13 22:39:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:47,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 22:39:47,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:47,345 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 22:39:47,346 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:47,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432224909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:47,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:39:47,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-10-13 22:39:47,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065418062] [2024-10-13 22:39:47,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:47,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:47,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:47,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:47,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:47,347 INFO L87 Difference]: Start difference. First operand 937 states and 1270 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-10-13 22:39:47,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:47,387 INFO L93 Difference]: Finished difference Result 1871 states and 2542 transitions. [2024-10-13 22:39:47,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:47,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 48 [2024-10-13 22:39:47,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:47,390 INFO L225 Difference]: With dead ends: 1871 [2024-10-13 22:39:47,390 INFO L226 Difference]: Without dead ends: 942 [2024-10-13 22:39:47,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:47,393 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 4 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:47,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 230 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:47,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2024-10-13 22:39:47,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 939. [2024-10-13 22:39:47,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 869 states have (on average 1.3060989643268124) internal successors, (1135), 870 states have internal predecessors, (1135), 64 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (73), 70 states have call predecessors, (73), 61 states have call successors, (73) [2024-10-13 22:39:47,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1272 transitions. [2024-10-13 22:39:47,417 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1272 transitions. Word has length 48 [2024-10-13 22:39:47,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:47,417 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1272 transitions. [2024-10-13 22:39:47,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-10-13 22:39:47,417 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1272 transitions. [2024-10-13 22:39:47,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-13 22:39:47,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:47,419 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:47,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-13 22:39:47,619 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,SelfDestructingSolverStorable23 [2024-10-13 22:39:47,620 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:47,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:47,620 INFO L85 PathProgramCache]: Analyzing trace with hash 855722105, now seen corresponding path program 1 times [2024-10-13 22:39:47,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:47,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145263434] [2024-10-13 22:39:47,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:47,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:47,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:47,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:47,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-13 22:39:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:47,947 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 22:39:47,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:47,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145263434] [2024-10-13 22:39:47,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145263434] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:47,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296445021] [2024-10-13 22:39:47,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:47,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:47,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:47,950 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-10-13 22:39:47,951 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-10-13 22:39:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:47,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 22:39:47,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:48,121 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 22:39:48,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:48,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296445021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:48,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:39:48,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2024-10-13 22:39:48,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305638528] [2024-10-13 22:39:48,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:48,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 22:39:48,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:48,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 22:39:48,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2024-10-13 22:39:48,123 INFO L87 Difference]: Start difference. First operand 939 states and 1272 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 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-10-13 22:39:48,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:48,356 INFO L93 Difference]: Finished difference Result 1200 states and 1616 transitions. [2024-10-13 22:39:48,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 22:39:48,357 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 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 49 [2024-10-13 22:39:48,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:48,360 INFO L225 Difference]: With dead ends: 1200 [2024-10-13 22:39:48,360 INFO L226 Difference]: Without dead ends: 1132 [2024-10-13 22:39:48,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2024-10-13 22:39:48,361 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 146 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:48,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1386 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 22:39:48,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2024-10-13 22:39:48,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 983. [2024-10-13 22:39:48,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 908 states have (on average 1.2907488986784141) internal successors, (1172), 910 states have internal predecessors, (1172), 69 states have call successors, (69), 3 states have call predecessors, (69), 5 states have return successors, (78), 75 states have call predecessors, (78), 66 states have call successors, (78) [2024-10-13 22:39:48,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1319 transitions. [2024-10-13 22:39:48,387 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1319 transitions. Word has length 49 [2024-10-13 22:39:48,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:48,387 INFO L471 AbstractCegarLoop]: Abstraction has 983 states and 1319 transitions. [2024-10-13 22:39:48,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 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-10-13 22:39:48,387 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1319 transitions. [2024-10-13 22:39:48,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-13 22:39:48,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:48,389 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:48,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-13 22:39:48,589 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,SelfDestructingSolverStorable24 [2024-10-13 22:39:48,590 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:48,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:48,590 INFO L85 PathProgramCache]: Analyzing trace with hash 496994524, now seen corresponding path program 1 times [2024-10-13 22:39:48,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:48,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904200187] [2024-10-13 22:39:48,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:48,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:48,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:48,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:48,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 22:39:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:48,776 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 22:39:48,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:48,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904200187] [2024-10-13 22:39:48,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904200187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:48,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:48,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 22:39:48,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798472202] [2024-10-13 22:39:48,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:48,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 22:39:48,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:48,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 22:39:48,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 22:39:48,779 INFO L87 Difference]: Start difference. First operand 983 states and 1319 transitions. Second operand has 7 states, 7 states have (on average 5.0) 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-10-13 22:39:48,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:48,853 INFO L93 Difference]: Finished difference Result 989 states and 1324 transitions. [2024-10-13 22:39:48,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 22:39:48,853 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 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 49 [2024-10-13 22:39:48,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:48,856 INFO L225 Difference]: With dead ends: 989 [2024-10-13 22:39:48,856 INFO L226 Difference]: Without dead ends: 987 [2024-10-13 22:39:48,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-13 22:39:48,857 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 14 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:48,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 674 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:48,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2024-10-13 22:39:48,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 987. [2024-10-13 22:39:48,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 911 states have (on average 1.2897914379802415) internal successors, (1175), 913 states have internal predecessors, (1175), 69 states have call successors, (69), 4 states have call predecessors, (69), 6 states have return successors, (78), 75 states have call predecessors, (78), 66 states have call successors, (78) [2024-10-13 22:39:48,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1322 transitions. [2024-10-13 22:39:48,883 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1322 transitions. Word has length 49 [2024-10-13 22:39:48,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:48,884 INFO L471 AbstractCegarLoop]: Abstraction has 987 states and 1322 transitions. [2024-10-13 22:39:48,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 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-10-13 22:39:48,884 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1322 transitions. [2024-10-13 22:39:48,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-13 22:39:48,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:48,885 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:48,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-13 22:39:48,885 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:48,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:48,886 INFO L85 PathProgramCache]: Analyzing trace with hash 794453919, now seen corresponding path program 1 times [2024-10-13 22:39:48,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:48,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082430018] [2024-10-13 22:39:48,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:48,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:48,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:48,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:48,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-13 22:39:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:48,945 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 22:39:48,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:48,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082430018] [2024-10-13 22:39:48,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082430018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:48,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:48,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 22:39:48,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959075473] [2024-10-13 22:39:48,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:48,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 22:39:48,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:48,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 22:39:48,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:39:48,947 INFO L87 Difference]: Start difference. First operand 987 states and 1322 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 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-10-13 22:39:49,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:49,002 INFO L93 Difference]: Finished difference Result 1024 states and 1362 transitions. [2024-10-13 22:39:49,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 22:39:49,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 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 51 [2024-10-13 22:39:49,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:49,006 INFO L225 Difference]: With dead ends: 1024 [2024-10-13 22:39:49,006 INFO L226 Difference]: Without dead ends: 1022 [2024-10-13 22:39:49,007 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-10-13 22:39:49,007 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 20 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:49,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 704 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:49,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2024-10-13 22:39:49,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 993. [2024-10-13 22:39:49,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 915 states have (on average 1.2885245901639344) internal successors, (1179), 918 states have internal predecessors, (1179), 70 states have call successors, (70), 5 states have call predecessors, (70), 7 states have return successors, (79), 75 states have call predecessors, (79), 67 states have call successors, (79) [2024-10-13 22:39:49,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1328 transitions. [2024-10-13 22:39:49,033 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1328 transitions. Word has length 51 [2024-10-13 22:39:49,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:49,033 INFO L471 AbstractCegarLoop]: Abstraction has 993 states and 1328 transitions. [2024-10-13 22:39:49,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 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-10-13 22:39:49,034 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1328 transitions. [2024-10-13 22:39:49,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-13 22:39:49,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:49,035 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:49,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-13 22:39:49,035 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:49,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:49,035 INFO L85 PathProgramCache]: Analyzing trace with hash 851712221, now seen corresponding path program 1 times [2024-10-13 22:39:49,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:49,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794998771] [2024-10-13 22:39:49,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:49,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:49,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:49,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:49,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-13 22:39:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:49,090 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 22:39:49,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:49,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794998771] [2024-10-13 22:39:49,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794998771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:49,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:49,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 22:39:49,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505998686] [2024-10-13 22:39:49,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:49,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 22:39:49,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:49,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 22:39:49,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:39:49,091 INFO L87 Difference]: Start difference. First operand 993 states and 1328 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 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-10-13 22:39:49,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:49,137 INFO L93 Difference]: Finished difference Result 1032 states and 1374 transitions. [2024-10-13 22:39:49,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 22:39:49,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 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 51 [2024-10-13 22:39:49,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:49,140 INFO L225 Difference]: With dead ends: 1032 [2024-10-13 22:39:49,140 INFO L226 Difference]: Without dead ends: 1030 [2024-10-13 22:39:49,141 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-10-13 22:39:49,141 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 17 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:49,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 661 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:49,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2024-10-13 22:39:49,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 999. [2024-10-13 22:39:49,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 918 states have (on average 1.2875816993464053) internal successors, (1182), 923 states have internal predecessors, (1182), 72 states have call successors, (72), 6 states have call predecessors, (72), 8 states have return successors, (81), 75 states have call predecessors, (81), 69 states have call successors, (81) [2024-10-13 22:39:49,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1335 transitions. [2024-10-13 22:39:49,187 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1335 transitions. Word has length 51 [2024-10-13 22:39:49,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:49,187 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1335 transitions. [2024-10-13 22:39:49,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 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-10-13 22:39:49,188 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1335 transitions. [2024-10-13 22:39:49,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-13 22:39:49,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:49,189 INFO L215 NwaCegarLoop]: trace histogram [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-10-13 22:39:49,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-13 22:39:49,189 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:49,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:49,189 INFO L85 PathProgramCache]: Analyzing trace with hash -605018731, now seen corresponding path program 1 times [2024-10-13 22:39:49,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:49,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032650934] [2024-10-13 22:39:49,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:49,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:49,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:49,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:49,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 22:39:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:49,281 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:39:49,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:49,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032650934] [2024-10-13 22:39:49,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032650934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:49,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:49,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 22:39:49,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661279736] [2024-10-13 22:39:49,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:49,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 22:39:49,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:49,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 22:39:49,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 22:39:49,283 INFO L87 Difference]: Start difference. First operand 999 states and 1335 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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-10-13 22:39:49,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:49,456 INFO L93 Difference]: Finished difference Result 1484 states and 1967 transitions. [2024-10-13 22:39:49,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 22:39:49,456 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 52 [2024-10-13 22:39:49,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:49,460 INFO L225 Difference]: With dead ends: 1484 [2024-10-13 22:39:49,460 INFO L226 Difference]: Without dead ends: 1390 [2024-10-13 22:39:49,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 22:39:49,462 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 127 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:49,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 780 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:49,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2024-10-13 22:39:49,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 991. [2024-10-13 22:39:49,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 914 states have (on average 1.2822757111597374) internal successors, (1172), 918 states have internal predecessors, (1172), 68 states have call successors, (68), 6 states have call predecessors, (68), 8 states have return successors, (77), 71 states have call predecessors, (77), 65 states have call successors, (77) [2024-10-13 22:39:49,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1317 transitions. [2024-10-13 22:39:49,492 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1317 transitions. Word has length 52 [2024-10-13 22:39:49,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:49,492 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1317 transitions. [2024-10-13 22:39:49,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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-10-13 22:39:49,492 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1317 transitions. [2024-10-13 22:39:49,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-13 22:39:49,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:49,494 INFO L215 NwaCegarLoop]: trace histogram [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-10-13 22:39:49,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-13 22:39:49,494 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:49,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:49,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1422667181, now seen corresponding path program 1 times [2024-10-13 22:39:49,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:49,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124377584] [2024-10-13 22:39:49,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:49,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:49,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:49,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:49,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 22:39:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:49,908 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 22:39:49,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:49,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124377584] [2024-10-13 22:39:49,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124377584] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:49,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963752992] [2024-10-13 22:39:49,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:49,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:49,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:49,910 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-10-13 22:39:49,911 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-10-13 22:39:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:49,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 22:39:49,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:39:50,138 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:50,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963752992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:50,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:39:50,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2024-10-13 22:39:50,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954138415] [2024-10-13 22:39:50,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:50,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 22:39:50,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:50,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 22:39:50,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2024-10-13 22:39:50,140 INFO L87 Difference]: Start difference. First operand 991 states and 1317 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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-10-13 22:39:50,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:50,432 INFO L93 Difference]: Finished difference Result 1439 states and 1920 transitions. [2024-10-13 22:39:50,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 22:39:50,432 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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 52 [2024-10-13 22:39:50,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:50,436 INFO L225 Difference]: With dead ends: 1439 [2024-10-13 22:39:50,437 INFO L226 Difference]: Without dead ends: 1264 [2024-10-13 22:39:50,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2024-10-13 22:39:50,438 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 120 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:50,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 971 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 22:39:50,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2024-10-13 22:39:50,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 955. [2024-10-13 22:39:50,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 879 states have (on average 1.2821387940841866) internal successors, (1127), 886 states have internal predecessors, (1127), 67 states have call successors, (67), 6 states have call predecessors, (67), 8 states have return successors, (73), 67 states have call predecessors, (73), 64 states have call successors, (73) [2024-10-13 22:39:50,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1267 transitions. [2024-10-13 22:39:50,467 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1267 transitions. Word has length 52 [2024-10-13 22:39:50,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:50,467 INFO L471 AbstractCegarLoop]: Abstraction has 955 states and 1267 transitions. [2024-10-13 22:39:50,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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-10-13 22:39:50,467 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1267 transitions. [2024-10-13 22:39:50,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-13 22:39:50,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:50,469 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:39:50,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-13 22:39:50,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:50,670 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:50,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:50,670 INFO L85 PathProgramCache]: Analyzing trace with hash 502303469, now seen corresponding path program 1 times [2024-10-13 22:39:50,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:50,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558123141] [2024-10-13 22:39:50,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:50,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:50,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:50,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:51,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-13 22:39:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:51,032 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-13 22:39:51,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:51,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558123141] [2024-10-13 22:39:51,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558123141] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:51,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46389282] [2024-10-13 22:39:51,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:51,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:51,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:51,034 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:51,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-13 22:39:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:51,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 22:39:51,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:51,184 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 22:39:51,184 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:51,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46389282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:51,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:39:51,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2024-10-13 22:39:51,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009102063] [2024-10-13 22:39:51,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:51,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 22:39:51,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:51,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 22:39:51,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-10-13 22:39:51,186 INFO L87 Difference]: Start difference. First operand 955 states and 1267 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-10-13 22:39:51,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:51,434 INFO L93 Difference]: Finished difference Result 1159 states and 1533 transitions. [2024-10-13 22:39:51,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 22:39:51,438 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 54 [2024-10-13 22:39:51,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:51,442 INFO L225 Difference]: With dead ends: 1159 [2024-10-13 22:39:51,442 INFO L226 Difference]: Without dead ends: 1102 [2024-10-13 22:39:51,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2024-10-13 22:39:51,444 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 133 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:51,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 495 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:51,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2024-10-13 22:39:51,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 955. [2024-10-13 22:39:51,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 879 states have (on average 1.2787258248009101) internal successors, (1124), 886 states have internal predecessors, (1124), 67 states have call successors, (67), 6 states have call predecessors, (67), 8 states have return successors, (73), 67 states have call predecessors, (73), 64 states have call successors, (73) [2024-10-13 22:39:51,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1264 transitions. [2024-10-13 22:39:51,474 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1264 transitions. Word has length 54 [2024-10-13 22:39:51,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:51,474 INFO L471 AbstractCegarLoop]: Abstraction has 955 states and 1264 transitions. [2024-10-13 22:39:51,474 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-10-13 22:39:51,474 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1264 transitions. [2024-10-13 22:39:51,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-13 22:39:51,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:51,475 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:51,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-13 22:39:51,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:51,680 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:51,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:51,680 INFO L85 PathProgramCache]: Analyzing trace with hash -433624224, now seen corresponding path program 1 times [2024-10-13 22:39:51,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:51,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203220763] [2024-10-13 22:39:51,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:51,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:51,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:51,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 22:39:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:51,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 22:39:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:51,729 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 22:39:51,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:51,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203220763] [2024-10-13 22:39:51,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203220763] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:51,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093278508] [2024-10-13 22:39:51,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:51,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:51,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:51,732 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:51,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-13 22:39:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:51,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 22:39:51,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:51,806 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 22:39:51,806 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:51,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093278508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:51,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:39:51,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-13 22:39:51,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438064235] [2024-10-13 22:39:51,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:51,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:39:51,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:51,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:39:51,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:39:51,809 INFO L87 Difference]: Start difference. First operand 955 states and 1264 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-10-13 22:39:51,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:51,870 INFO L93 Difference]: Finished difference Result 1897 states and 2514 transitions. [2024-10-13 22:39:51,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:39:51,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 54 [2024-10-13 22:39:51,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:51,873 INFO L225 Difference]: With dead ends: 1897 [2024-10-13 22:39:51,873 INFO L226 Difference]: Without dead ends: 966 [2024-10-13 22:39:51,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:39:51,876 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 14 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:51,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 327 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:51,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2024-10-13 22:39:51,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 958. [2024-10-13 22:39:51,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 881 states have (on average 1.2792281498297389) internal successors, (1127), 889 states have internal predecessors, (1127), 67 states have call successors, (67), 6 states have call predecessors, (67), 9 states have return successors, (79), 67 states have call predecessors, (79), 64 states have call successors, (79) [2024-10-13 22:39:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1273 transitions. [2024-10-13 22:39:51,904 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1273 transitions. Word has length 54 [2024-10-13 22:39:51,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:51,904 INFO L471 AbstractCegarLoop]: Abstraction has 958 states and 1273 transitions. [2024-10-13 22:39:51,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-10-13 22:39:51,904 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1273 transitions. [2024-10-13 22:39:51,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-13 22:39:51,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:51,905 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:39:51,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-13 22:39:52,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:52,106 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:52,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:52,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1506645198, now seen corresponding path program 1 times [2024-10-13 22:39:52,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:52,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157932949] [2024-10-13 22:39:52,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:52,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:52,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:52,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:52,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-13 22:39:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:52,214 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-13 22:39:52,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:52,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157932949] [2024-10-13 22:39:52,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157932949] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:52,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823673466] [2024-10-13 22:39:52,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:52,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:52,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:52,218 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:52,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-13 22:39:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:52,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 22:39:52,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-13 22:39:52,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:52,401 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-13 22:39:52,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823673466] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:39:52,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:39:52,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 13 [2024-10-13 22:39:52,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795561269] [2024-10-13 22:39:52,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:39:52,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 22:39:52,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:52,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 22:39:52,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-13 22:39:52,403 INFO L87 Difference]: Start difference. First operand 958 states and 1273 transitions. Second operand has 13 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 22:39:52,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:52,552 INFO L93 Difference]: Finished difference Result 1138 states and 1505 transitions. [2024-10-13 22:39:52,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 22:39:52,552 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 57 [2024-10-13 22:39:52,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:52,555 INFO L225 Difference]: With dead ends: 1138 [2024-10-13 22:39:52,556 INFO L226 Difference]: Without dead ends: 1119 [2024-10-13 22:39:52,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 114 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-13 22:39:52,557 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 43 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:52,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1406 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2024-10-13 22:39:52,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1064. [2024-10-13 22:39:52,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 982 states have (on average 1.2769857433808554) internal successors, (1254), 990 states have internal predecessors, (1254), 72 states have call successors, (72), 6 states have call predecessors, (72), 9 states have return successors, (84), 72 states have call predecessors, (84), 69 states have call successors, (84) [2024-10-13 22:39:52,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1410 transitions. [2024-10-13 22:39:52,587 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1410 transitions. Word has length 57 [2024-10-13 22:39:52,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:52,587 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1410 transitions. [2024-10-13 22:39:52,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 22:39:52,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1410 transitions. [2024-10-13 22:39:52,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-13 22:39:52,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:52,589 INFO L215 NwaCegarLoop]: trace histogram [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-10-13 22:39:52,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-13 22:39:52,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-10-13 22:39:52,793 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:52,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:52,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1741007806, now seen corresponding path program 1 times [2024-10-13 22:39:52,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:52,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570292973] [2024-10-13 22:39:52,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:52,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:52,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:52,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:52,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 22:39:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:52,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 22:39:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:52,852 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 22:39:52,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:52,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570292973] [2024-10-13 22:39:52,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570292973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:52,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:52,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 22:39:52,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432302462] [2024-10-13 22:39:52,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:52,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 22:39:52,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:52,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 22:39:52,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 22:39:52,854 INFO L87 Difference]: Start difference. First operand 1064 states and 1410 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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-10-13 22:39:52,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:52,935 INFO L93 Difference]: Finished difference Result 1148 states and 1537 transitions. [2024-10-13 22:39:52,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 22:39:52,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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 58 [2024-10-13 22:39:52,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:52,941 INFO L225 Difference]: With dead ends: 1148 [2024-10-13 22:39:52,942 INFO L226 Difference]: Without dead ends: 1143 [2024-10-13 22:39:52,943 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-10-13 22:39:52,943 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 9 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:52,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 448 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:52,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2024-10-13 22:39:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1119. [2024-10-13 22:39:52,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 1019 states have (on average 1.2914622178606476) internal successors, (1316), 1044 states have internal predecessors, (1316), 89 states have call successors, (89), 7 states have call predecessors, (89), 10 states have return successors, (101), 72 states have call predecessors, (101), 86 states have call successors, (101) [2024-10-13 22:39:52,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1506 transitions. [2024-10-13 22:39:52,985 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1506 transitions. Word has length 58 [2024-10-13 22:39:52,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:52,985 INFO L471 AbstractCegarLoop]: Abstraction has 1119 states and 1506 transitions. [2024-10-13 22:39:52,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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-10-13 22:39:52,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1506 transitions. [2024-10-13 22:39:52,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-13 22:39:52,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:52,988 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:52,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-13 22:39:52,988 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:52,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:52,988 INFO L85 PathProgramCache]: Analyzing trace with hash -622087411, now seen corresponding path program 1 times [2024-10-13 22:39:52,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:52,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001506419] [2024-10-13 22:39:52,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:52,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:53,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:53,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 22:39:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:53,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 22:39:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 22:39:53,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:53,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001506419] [2024-10-13 22:39:53,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001506419] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:53,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735126933] [2024-10-13 22:39:53,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:53,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:53,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:53,067 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:53,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-13 22:39:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:53,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 22:39:53,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:53,151 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 22:39:53,151 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:53,205 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 22:39:53,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735126933] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:39:53,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:39:53,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-13 22:39:53,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918096626] [2024-10-13 22:39:53,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:39:53,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 22:39:53,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:53,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 22:39:53,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-13 22:39:53,207 INFO L87 Difference]: Start difference. First operand 1119 states and 1506 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-13 22:39:53,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:53,340 INFO L93 Difference]: Finished difference Result 2290 states and 3102 transitions. [2024-10-13 22:39:53,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 22:39:53,340 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2024-10-13 22:39:53,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:53,344 INFO L225 Difference]: With dead ends: 2290 [2024-10-13 22:39:53,347 INFO L226 Difference]: Without dead ends: 1173 [2024-10-13 22:39:53,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-10-13 22:39:53,350 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 65 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:53,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 752 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:53,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2024-10-13 22:39:53,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1140. [2024-10-13 22:39:53,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1038 states have (on average 1.2947976878612717) internal successors, (1344), 1065 states have internal predecessors, (1344), 89 states have call successors, (89), 7 states have call predecessors, (89), 12 states have return successors, (109), 72 states have call predecessors, (109), 86 states have call successors, (109) [2024-10-13 22:39:53,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1542 transitions. [2024-10-13 22:39:53,392 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1542 transitions. Word has length 57 [2024-10-13 22:39:53,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:53,392 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1542 transitions. [2024-10-13 22:39:53,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-13 22:39:53,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1542 transitions. [2024-10-13 22:39:53,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 22:39:53,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:53,394 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:39:53,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-13 22:39:53,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:53,599 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:53,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:53,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1180623593, now seen corresponding path program 1 times [2024-10-13 22:39:53,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:53,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394682685] [2024-10-13 22:39:53,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:53,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:53,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:53,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:53,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 22:39:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:53,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 22:39:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:53,732 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:39:53,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:53,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394682685] [2024-10-13 22:39:53,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394682685] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:53,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591708378] [2024-10-13 22:39:53,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:53,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:53,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:53,736 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:53,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-13 22:39:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:53,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 22:39:53,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:53,852 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 22:39:53,852 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:53,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591708378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:53,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:39:53,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-10-13 22:39:53,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240462129] [2024-10-13 22:39:53,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:53,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 22:39:53,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:53,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 22:39:53,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-13 22:39:53,854 INFO L87 Difference]: Start difference. First operand 1140 states and 1542 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-10-13 22:39:53,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:53,975 INFO L93 Difference]: Finished difference Result 1739 states and 2331 transitions. [2024-10-13 22:39:53,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 22:39:53,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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 59 [2024-10-13 22:39:53,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:53,982 INFO L225 Difference]: With dead ends: 1739 [2024-10-13 22:39:53,982 INFO L226 Difference]: Without dead ends: 1510 [2024-10-13 22:39:53,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-13 22:39:53,983 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 13 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:53,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 580 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:53,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2024-10-13 22:39:54,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1158. [2024-10-13 22:39:54,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1056 states have (on average 1.2897727272727273) internal successors, (1362), 1083 states have internal predecessors, (1362), 89 states have call successors, (89), 7 states have call predecessors, (89), 12 states have return successors, (109), 72 states have call predecessors, (109), 86 states have call successors, (109) [2024-10-13 22:39:54,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1560 transitions. [2024-10-13 22:39:54,026 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1560 transitions. Word has length 59 [2024-10-13 22:39:54,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:54,026 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1560 transitions. [2024-10-13 22:39:54,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-10-13 22:39:54,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1560 transitions. [2024-10-13 22:39:54,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 22:39:54,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:54,030 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:39:54,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-10-13 22:39:54,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:54,235 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:54,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:54,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1729934775, now seen corresponding path program 1 times [2024-10-13 22:39:54,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:54,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096248459] [2024-10-13 22:39:54,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:54,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:54,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:54,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:54,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 22:39:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:54,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 22:39:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:54,315 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 22:39:54,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:54,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096248459] [2024-10-13 22:39:54,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096248459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:54,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:54,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 22:39:54,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117217122] [2024-10-13 22:39:54,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:54,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 22:39:54,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:54,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 22:39:54,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:39:54,316 INFO L87 Difference]: Start difference. First operand 1158 states and 1560 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-10-13 22:39:54,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:54,412 INFO L93 Difference]: Finished difference Result 1224 states and 1651 transitions. [2024-10-13 22:39:54,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 22:39:54,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 60 [2024-10-13 22:39:54,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:54,416 INFO L225 Difference]: With dead ends: 1224 [2024-10-13 22:39:54,416 INFO L226 Difference]: Without dead ends: 1219 [2024-10-13 22:39:54,416 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-10-13 22:39:54,417 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 8 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:54,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 578 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:54,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2024-10-13 22:39:54,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1157. [2024-10-13 22:39:54,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1055 states have (on average 1.2890995260663507) internal successors, (1360), 1082 states have internal predecessors, (1360), 89 states have call successors, (89), 7 states have call predecessors, (89), 12 states have return successors, (109), 72 states have call predecessors, (109), 86 states have call successors, (109) [2024-10-13 22:39:54,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1558 transitions. [2024-10-13 22:39:54,452 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1558 transitions. Word has length 60 [2024-10-13 22:39:54,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:54,452 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1558 transitions. [2024-10-13 22:39:54,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-10-13 22:39:54,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1558 transitions. [2024-10-13 22:39:54,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 22:39:54,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:54,454 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:39:54,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-13 22:39:54,454 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:54,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:54,454 INFO L85 PathProgramCache]: Analyzing trace with hash -902694721, now seen corresponding path program 1 times [2024-10-13 22:39:54,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:54,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082744041] [2024-10-13 22:39:54,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:54,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:54,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:54,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 22:39:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:54,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 22:39:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:54,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 22:39:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:54,554 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:39:54,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:54,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082744041] [2024-10-13 22:39:54,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082744041] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:54,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512572154] [2024-10-13 22:39:54,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:54,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:54,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:54,556 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:54,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-13 22:39:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:54,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-13 22:39:54,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:54,689 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-13 22:39:54,690 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:54,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512572154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:54,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:39:54,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 12 [2024-10-13 22:39:54,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864146031] [2024-10-13 22:39:54,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:54,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 22:39:54,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:54,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 22:39:54,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-13 22:39:54,691 INFO L87 Difference]: Start difference. First operand 1157 states and 1558 transitions. Second operand has 10 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 22:39:54,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:54,924 INFO L93 Difference]: Finished difference Result 1407 states and 1876 transitions. [2024-10-13 22:39:54,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 22:39:54,925 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 60 [2024-10-13 22:39:54,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:54,928 INFO L225 Difference]: With dead ends: 1407 [2024-10-13 22:39:54,929 INFO L226 Difference]: Without dead ends: 1254 [2024-10-13 22:39:54,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-13 22:39:54,930 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 176 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:54,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 860 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:54,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-10-13 22:39:54,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1157. [2024-10-13 22:39:54,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1055 states have (on average 1.2853080568720379) internal successors, (1356), 1082 states have internal predecessors, (1356), 89 states have call successors, (89), 7 states have call predecessors, (89), 12 states have return successors, (109), 72 states have call predecessors, (109), 86 states have call successors, (109) [2024-10-13 22:39:54,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1554 transitions. [2024-10-13 22:39:54,983 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1554 transitions. Word has length 60 [2024-10-13 22:39:54,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:54,983 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1554 transitions. [2024-10-13 22:39:54,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 22:39:54,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1554 transitions. [2024-10-13 22:39:54,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 22:39:54,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:54,985 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:39:54,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-10-13 22:39:55,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:55,190 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:55,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:55,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1266171930, now seen corresponding path program 1 times [2024-10-13 22:39:55,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:55,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123518246] [2024-10-13 22:39:55,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:55,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:55,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:55,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 22:39:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:55,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-13 22:39:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:55,314 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 22:39:55,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:55,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123518246] [2024-10-13 22:39:55,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123518246] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:55,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753443822] [2024-10-13 22:39:55,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:55,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:55,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:55,316 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:55,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-13 22:39:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:55,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 22:39:55,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 22:39:55,431 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:55,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753443822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:55,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:39:55,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-10-13 22:39:55,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798401347] [2024-10-13 22:39:55,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:55,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 22:39:55,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:55,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 22:39:55,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-13 22:39:55,432 INFO L87 Difference]: Start difference. First operand 1157 states and 1554 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-10-13 22:39:55,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:55,519 INFO L93 Difference]: Finished difference Result 2182 states and 2936 transitions. [2024-10-13 22:39:55,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 22:39:55,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 59 [2024-10-13 22:39:55,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:55,522 INFO L225 Difference]: With dead ends: 2182 [2024-10-13 22:39:55,522 INFO L226 Difference]: Without dead ends: 1163 [2024-10-13 22:39:55,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-13 22:39:55,524 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 19 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:55,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 331 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:55,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2024-10-13 22:39:55,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1158. [2024-10-13 22:39:55,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1056 states have (on average 1.285037878787879) internal successors, (1357), 1083 states have internal predecessors, (1357), 89 states have call successors, (89), 7 states have call predecessors, (89), 12 states have return successors, (109), 72 states have call predecessors, (109), 86 states have call successors, (109) [2024-10-13 22:39:55,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1555 transitions. [2024-10-13 22:39:55,561 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1555 transitions. Word has length 59 [2024-10-13 22:39:55,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:55,561 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1555 transitions. [2024-10-13 22:39:55,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-10-13 22:39:55,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1555 transitions. [2024-10-13 22:39:55,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 22:39:55,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:55,563 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:55,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-10-13 22:39:55,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-10-13 22:39:55,764 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:55,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:55,764 INFO L85 PathProgramCache]: Analyzing trace with hash 400855533, now seen corresponding path program 1 times [2024-10-13 22:39:55,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:55,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996768615] [2024-10-13 22:39:55,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:55,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:55,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:55,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 22:39:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:55,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-13 22:39:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 22:39:55,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:55,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996768615] [2024-10-13 22:39:55,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996768615] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:55,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043672304] [2024-10-13 22:39:55,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:55,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:55,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:55,894 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:55,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-13 22:39:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:55,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 22:39:55,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:56,000 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 22:39:56,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:56,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043672304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:56,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:39:56,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-13 22:39:56,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248097184] [2024-10-13 22:39:56,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:56,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:56,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:56,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:56,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:39:56,001 INFO L87 Difference]: Start difference. First operand 1158 states and 1555 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), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 22:39:56,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:56,060 INFO L93 Difference]: Finished difference Result 2294 states and 3083 transitions. [2024-10-13 22:39:56,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:56,060 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), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-10-13 22:39:56,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:56,063 INFO L225 Difference]: With dead ends: 2294 [2024-10-13 22:39:56,063 INFO L226 Difference]: Without dead ends: 1161 [2024-10-13 22:39:56,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 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-10-13 22:39:56,065 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 5 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 234 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-10-13 22:39:56,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 234 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:56,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2024-10-13 22:39:56,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1157. [2024-10-13 22:39:56,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1055 states have (on average 1.2843601895734598) internal successors, (1355), 1082 states have internal predecessors, (1355), 89 states have call successors, (89), 7 states have call predecessors, (89), 12 states have return successors, (109), 72 states have call predecessors, (109), 86 states have call successors, (109) [2024-10-13 22:39:56,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1553 transitions. [2024-10-13 22:39:56,106 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1553 transitions. Word has length 59 [2024-10-13 22:39:56,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:56,106 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1553 transitions. [2024-10-13 22:39:56,106 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), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 22:39:56,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1553 transitions. [2024-10-13 22:39:56,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 22:39:56,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:56,107 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-10-13 22:39:56,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-10-13 22:39:56,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-10-13 22:39:56,308 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:56,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:56,308 INFO L85 PathProgramCache]: Analyzing trace with hash 377707772, now seen corresponding path program 1 times [2024-10-13 22:39:56,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:56,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348285034] [2024-10-13 22:39:56,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:56,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:56,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 22:39:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:56,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 22:39:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:56,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 22:39:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:56,366 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 22:39:56,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:56,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348285034] [2024-10-13 22:39:56,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348285034] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:56,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412422531] [2024-10-13 22:39:56,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:56,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:56,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:56,368 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:56,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-10-13 22:39:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:56,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 22:39:56,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:56,477 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-13 22:39:56,477 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:56,579 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-13 22:39:56,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412422531] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:39:56,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:39:56,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 15 [2024-10-13 22:39:56,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968273000] [2024-10-13 22:39:56,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:39:56,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 22:39:56,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:56,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 22:39:56,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-10-13 22:39:56,580 INFO L87 Difference]: Start difference. First operand 1157 states and 1553 transitions. Second operand has 15 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-13 22:39:56,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:56,786 INFO L93 Difference]: Finished difference Result 2296 states and 3087 transitions. [2024-10-13 22:39:56,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 22:39:56,786 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 60 [2024-10-13 22:39:56,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:56,789 INFO L225 Difference]: With dead ends: 2296 [2024-10-13 22:39:56,789 INFO L226 Difference]: Without dead ends: 1161 [2024-10-13 22:39:56,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-10-13 22:39:56,791 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 37 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:56,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1337 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 22:39:56,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2024-10-13 22:39:56,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1150. [2024-10-13 22:39:56,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1048 states have (on average 1.284351145038168) internal successors, (1346), 1075 states have internal predecessors, (1346), 89 states have call successors, (89), 7 states have call predecessors, (89), 12 states have return successors, (109), 72 states have call predecessors, (109), 86 states have call successors, (109) [2024-10-13 22:39:56,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1544 transitions. [2024-10-13 22:39:56,827 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1544 transitions. Word has length 60 [2024-10-13 22:39:56,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:56,827 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1544 transitions. [2024-10-13 22:39:56,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-13 22:39:56,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1544 transitions. [2024-10-13 22:39:56,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 22:39:56,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:56,829 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:39:56,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-10-13 22:39:57,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:57,031 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:57,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:57,032 INFO L85 PathProgramCache]: Analyzing trace with hash -333583012, now seen corresponding path program 1 times [2024-10-13 22:39:57,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:57,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962651511] [2024-10-13 22:39:57,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:57,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 22:39:57,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 22:39:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 22:39:57,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 22:39:57,145 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 22:39:57,146 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 22:39:57,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-13 22:39:57,152 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:57,214 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 22:39:57,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:39:57 BoogieIcfgContainer [2024-10-13 22:39:57,216 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 22:39:57,216 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 22:39:57,216 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 22:39:57,216 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 22:39:57,217 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:39:37" (3/4) ... [2024-10-13 22:39:57,218 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 22:39:57,219 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 22:39:57,220 INFO L158 Benchmark]: Toolchain (without parser) took 20667.89ms. Allocated memory was 201.3MB in the beginning and 513.8MB in the end (delta: 312.5MB). Free memory was 171.1MB in the beginning and 213.5MB in the end (delta: -42.4MB). Peak memory consumption was 271.1MB. Max. memory is 16.1GB. [2024-10-13 22:39:57,220 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 119.5MB. Free memory is still 90.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 22:39:57,220 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.89ms. Allocated memory is still 201.3MB. Free memory was 171.1MB in the beginning and 155.4MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 22:39:57,220 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.06ms. Allocated memory is still 201.3MB. Free memory was 155.4MB in the beginning and 153.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 22:39:57,220 INFO L158 Benchmark]: Boogie Preprocessor took 51.90ms. Allocated memory is still 201.3MB. Free memory was 153.3MB in the beginning and 151.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 22:39:57,220 INFO L158 Benchmark]: RCFGBuilder took 612.36ms. Allocated memory is still 201.3MB. Free memory was 151.2MB in the beginning and 153.9MB in the end (delta: -2.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 22:39:57,220 INFO L158 Benchmark]: TraceAbstraction took 19629.72ms. Allocated memory was 201.3MB in the beginning and 513.8MB in the end (delta: 312.5MB). Free memory was 152.9MB in the beginning and 213.5MB in the end (delta: -60.6MB). Peak memory consumption was 253.9MB. Max. memory is 16.1GB. [2024-10-13 22:39:57,221 INFO L158 Benchmark]: Witness Printer took 3.15ms. Allocated memory is still 513.8MB. Free memory is still 213.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 22:39:57,221 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 119.5MB. Free memory is still 90.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.89ms. Allocated memory is still 201.3MB. Free memory was 171.1MB in the beginning and 155.4MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.06ms. Allocated memory is still 201.3MB. Free memory was 155.4MB in the beginning and 153.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.90ms. Allocated memory is still 201.3MB. Free memory was 153.3MB in the beginning and 151.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 612.36ms. Allocated memory is still 201.3MB. Free memory was 151.2MB in the beginning and 153.9MB in the end (delta: -2.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 19629.72ms. Allocated memory was 201.3MB in the beginning and 513.8MB in the end (delta: 312.5MB). Free memory was 152.9MB in the beginning and 213.5MB in the end (delta: -60.6MB). Peak memory consumption was 253.9MB. Max. memory is 16.1GB. * Witness Printer took 3.15ms. Allocated memory is still 513.8MB. Free memory is still 213.5MB. 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); [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); [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); [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=-4261412865, mb=16777215] [L114] EXPR mb | (1U << 24U) VAL [a=4294967295, ea=127, eb=127, ma=-4261412865] [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=-4261412865, mb=-4278190080] [L116] delta = ea - eb VAL [a=4294967295, delta=0, ea=127, ma=-4261412865, mb=-4278190080] [L117] COND FALSE !(!(delta < sizeof(mb) * 8)) VAL [a=4294967295, delta=0, ea=127, ma=-4261412865, mb=-4278190080] [L118] EXPR mb >> delta VAL [a=4294967295, ea=127, ma=-4261412865] [L118] mb = mb >> delta [L120] COND FALSE !(! mb) [L126] ma = ma + mb VAL [a=4294967295, ea=127, ma=-8539602945] [L127] ma & (1U << 25U) VAL [a=4294967295, ea=127, ma=-8539602945] [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, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.5s, OverallIterations: 42, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2555 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2452 mSDsluCounter, 28577 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22969 mSDsCounter, 147 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5361 IncrementalHoareTripleChecker+Invalid, 5508 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 147 mSolverCounterUnsat, 5608 mSDtfsCounter, 5361 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1995 GetRequests, 1641 SyntacticMatches, 5 SemanticMatches, 349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1158occurred in iteration=36, InterpolantAutomatonStates: 290, 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, 41 MinimizatonAttempts, 2867 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 3049 NumberOfCodeBlocks, 3049 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 3256 ConstructedInterpolants, 0 QuantifiedInterpolants, 7290 SizeOfPredicates, 31 NumberOfNonLiveVariables, 3364 ConjunctsInSsa, 301 ConjunctsInUnsatCore, 70 InterpolantComputations, 35 PerfectInterpolantSequences, 896/1057 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 22:39:57,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/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-wip.fs.cvc5-61a6796-m [2024-10-13 22:39:59,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 22:39:59,618 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 22:39:59,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 22:39:59,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 22:39:59,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 22:39:59,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 22:39:59,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 22:39:59,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 22:39:59,649 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 22:39:59,649 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 22:39:59,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 22:39:59,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 22:39:59,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 22:39:59,653 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 22:39:59,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 22:39:59,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 22:39:59,654 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 22:39:59,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 22:39:59,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 22:39:59,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 22:39:59,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 22:39:59,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 22:39:59,656 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 22:39:59,656 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 22:39:59,656 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 22:39:59,656 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 22:39:59,657 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 22:39:59,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 22:39:59,657 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 22:39:59,657 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 22:39:59,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 22:39:59,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 22:39:59,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 22:39:59,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:39:59,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 22:39:59,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 22:39:59,658 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 22:39:59,658 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 22:39:59,659 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-13 22:39:59,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 22:39:59,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 22:39:59,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 22:39:59,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 22:39:59,660 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 22:39:59,661 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-10-13 22:39:59,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 22:39:59,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 22:39:59,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 22:39:59,967 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 22:39:59,968 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 22:39:59,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2024-10-13 22:40:01,325 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 22:40:01,508 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 22:40:01,509 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2024-10-13 22:40:01,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ea959de3/c8a3f58295824ee79080a44da0b65719/FLAGad7ffe48b [2024-10-13 22:40:01,886 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ea959de3/c8a3f58295824ee79080a44da0b65719 [2024-10-13 22:40:01,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 22:40:01,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 22:40:01,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 22:40:01,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 22:40:01,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 22:40:01,896 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:40:01" (1/1) ... [2024-10-13 22:40:01,900 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72226343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:01, skipping insertion in model container [2024-10-13 22:40:01,900 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:40:01" (1/1) ... [2024-10-13 22:40:01,924 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 22:40:02,057 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c[755,768] [2024-10-13 22:40:02,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:40:02,132 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 22:40:02,140 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c[755,768] [2024-10-13 22:40:02,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:40:02,200 INFO L204 MainTranslator]: Completed translation [2024-10-13 22:40:02,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:02 WrapperNode [2024-10-13 22:40:02,204 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 22:40:02,205 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 22:40:02,205 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 22:40:02,206 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 22:40:02,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:02" (1/1) ... [2024-10-13 22:40:02,231 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:02" (1/1) ... [2024-10-13 22:40:02,252 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 149 [2024-10-13 22:40:02,255 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 22:40:02,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 22:40:02,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 22:40:02,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 22:40:02,264 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:02" (1/1) ... [2024-10-13 22:40:02,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:02" (1/1) ... [2024-10-13 22:40:02,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:02" (1/1) ... [2024-10-13 22:40:02,283 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 22:40:02,285 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:02" (1/1) ... [2024-10-13 22:40:02,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:02" (1/1) ... [2024-10-13 22:40:02,289 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:02" (1/1) ... [2024-10-13 22:40:02,292 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:02" (1/1) ... [2024-10-13 22:40:02,293 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:02" (1/1) ... [2024-10-13 22:40:02,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:02" (1/1) ... [2024-10-13 22:40:02,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 22:40:02,297 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 22:40:02,297 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 22:40:02,297 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 22:40:02,297 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:02" (1/1) ... [2024-10-13 22:40:02,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:40:02,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:40:02,326 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 22:40:02,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 22:40:02,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 22:40:02,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 22:40:02,362 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-10-13 22:40:02,362 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-10-13 22:40:02,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 22:40:02,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 22:40:02,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 22:40:02,362 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 22:40:02,420 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 22:40:02,422 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 22:40:02,679 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-10-13 22:40:02,680 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 22:40:02,705 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 22:40:02,705 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 22:40:02,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:40:02 BoogieIcfgContainer [2024-10-13 22:40:02,705 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 22:40:02,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 22:40:02,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 22:40:02,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 22:40:02,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:40:01" (1/3) ... [2024-10-13 22:40:02,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fdc922d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:40:02, skipping insertion in model container [2024-10-13 22:40:02,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:02" (2/3) ... [2024-10-13 22:40:02,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fdc922d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:40:02, skipping insertion in model container [2024-10-13 22:40:02,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:40:02" (3/3) ... [2024-10-13 22:40:02,717 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2024-10-13 22:40:02,738 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 22:40:02,739 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 22:40:02,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 22:40:02,803 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;@414c5e4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 22:40:02,804 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 22:40:02,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 55 states have (on average 1.6545454545454545) internal successors, (91), 58 states have internal predecessors, (91), 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-10-13 22:40:02,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 22:40:02,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:02,815 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:40:02,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:02,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:02,821 INFO L85 PathProgramCache]: Analyzing trace with hash 132641120, now seen corresponding path program 1 times [2024-10-13 22:40:02,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:40:02,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629330067] [2024-10-13 22:40:02,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:02,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:02,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:40:02,834 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 22:40:02,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 22:40:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:02,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 22:40:02,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:40:03,005 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:40:03,005 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:40:03,050 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:40:03,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:40:03,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629330067] [2024-10-13 22:40:03,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629330067] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:40:03,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 22:40:03,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-10-13 22:40:03,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935606946] [2024-10-13 22:40:03,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 22:40:03,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 22:40:03,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:40:03,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 22:40:03,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:40:03,091 INFO L87 Difference]: Start difference. First operand has 67 states, 55 states have (on average 1.6545454545454545) internal successors, (91), 58 states have internal predecessors, (91), 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, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-10-13 22:40:03,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:03,178 INFO L93 Difference]: Finished difference Result 144 states and 243 transitions. [2024-10-13 22:40:03,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 22:40:03,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 28 [2024-10-13 22:40:03,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:03,190 INFO L225 Difference]: With dead ends: 144 [2024-10-13 22:40:03,191 INFO L226 Difference]: Without dead ends: 77 [2024-10-13 22:40:03,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 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-10-13 22:40:03,196 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 5 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:03,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 492 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:40:03,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-13 22:40:03,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2024-10-13 22:40:03,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 64 states have internal predecessors, (92), 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-10-13 22:40:03,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 116 transitions. [2024-10-13 22:40:03,228 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 116 transitions. Word has length 28 [2024-10-13 22:40:03,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:03,229 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 116 transitions. [2024-10-13 22:40:03,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-10-13 22:40:03,229 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 116 transitions. [2024-10-13 22:40:03,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 22:40:03,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:03,231 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:40:03,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 22:40:03,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:03,433 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:03,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:03,435 INFO L85 PathProgramCache]: Analyzing trace with hash 575955966, now seen corresponding path program 1 times [2024-10-13 22:40:03,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:40:03,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468000099] [2024-10-13 22:40:03,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:03,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:03,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:40:03,438 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 22:40:03,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 22:40:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:03,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 22:40:03,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:40:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:40:03,554 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:40:03,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:40:03,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468000099] [2024-10-13 22:40:03,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [468000099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:03,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:03,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 22:40:03,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056095938] [2024-10-13 22:40:03,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:03,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 22:40:03,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:40:03,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 22:40:03,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:40:03,557 INFO L87 Difference]: Start difference. First operand 76 states and 116 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-10-13 22:40:03,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:03,636 INFO L93 Difference]: Finished difference Result 161 states and 248 transitions. [2024-10-13 22:40:03,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 22:40:03,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 32 [2024-10-13 22:40:03,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:03,638 INFO L225 Difference]: With dead ends: 161 [2024-10-13 22:40:03,638 INFO L226 Difference]: Without dead ends: 120 [2024-10-13 22:40:03,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 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-10-13 22:40:03,639 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 45 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:03,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 412 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:40:03,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-13 22:40:03,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2024-10-13 22:40:03,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 100 states have (on average 1.48) internal successors, (148), 101 states have internal predecessors, (148), 14 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (18), 16 states have call predecessors, (18), 13 states have call successors, (18) [2024-10-13 22:40:03,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 180 transitions. [2024-10-13 22:40:03,651 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 180 transitions. Word has length 32 [2024-10-13 22:40:03,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:03,652 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 180 transitions. [2024-10-13 22:40:03,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-10-13 22:40:03,652 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 180 transitions. [2024-10-13 22:40:03,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 22:40:03,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:03,653 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:40:03,656 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-10-13 22:40:03,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:03,856 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:03,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:03,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1256014336, now seen corresponding path program 1 times [2024-10-13 22:40:03,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:40:03,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450759056] [2024-10-13 22:40:03,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:03,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:03,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:40:03,870 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 22:40:03,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 22:40:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:03,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 22:40:03,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:40:03,955 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:40:03,955 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:40:03,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:40:03,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450759056] [2024-10-13 22:40:03,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450759056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:03,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:03,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 22:40:03,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787236307] [2024-10-13 22:40:03,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:03,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 22:40:03,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:40:03,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 22:40:03,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 22:40:03,957 INFO L87 Difference]: Start difference. First operand 118 states and 180 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-10-13 22:40:04,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:04,063 INFO L93 Difference]: Finished difference Result 149 states and 225 transitions. [2024-10-13 22:40:04,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 22:40:04,064 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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 32 [2024-10-13 22:40:04,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:04,065 INFO L225 Difference]: With dead ends: 149 [2024-10-13 22:40:04,065 INFO L226 Difference]: Without dead ends: 111 [2024-10-13 22:40:04,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 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-10-13 22:40:04,067 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 32 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:04,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 484 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:40:04,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-13 22:40:04,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2024-10-13 22:40:04,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 states have internal predecessors, (136), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (16), 14 states have call predecessors, (16), 11 states have call successors, (16) [2024-10-13 22:40:04,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 164 transitions. [2024-10-13 22:40:04,081 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 164 transitions. Word has length 32 [2024-10-13 22:40:04,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:04,082 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 164 transitions. [2024-10-13 22:40:04,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-10-13 22:40:04,082 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 164 transitions. [2024-10-13 22:40:04,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 22:40:04,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:04,086 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:40:04,091 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-10-13 22:40:04,287 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-10-13 22:40:04,287 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:04,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:04,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1734345439, now seen corresponding path program 1 times [2024-10-13 22:40:04,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:40:04,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [916953906] [2024-10-13 22:40:04,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:04,288 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:04,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:40:04,291 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-10-13 22:40:04,291 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-10-13 22:40:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:04,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 22:40:04,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:40:04,350 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:40:04,351 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:40:04,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:40:04,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [916953906] [2024-10-13 22:40:04,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [916953906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:04,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:04,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 22:40:04,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641104354] [2024-10-13 22:40:04,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:04,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:40:04,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:40:04,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:40:04,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:40:04,352 INFO L87 Difference]: Start difference. First operand 109 states and 164 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-10-13 22:40:04,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:04,412 INFO L93 Difference]: Finished difference Result 184 states and 276 transitions. [2024-10-13 22:40:04,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:40:04,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 36 [2024-10-13 22:40:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:04,414 INFO L225 Difference]: With dead ends: 184 [2024-10-13 22:40:04,414 INFO L226 Difference]: Without dead ends: 142 [2024-10-13 22:40:04,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:40:04,416 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 15 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:04,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 298 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:04,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-13 22:40:04,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-13 22:40:04,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4112903225806452) internal successors, (175), 125 states have internal predecessors, (175), 14 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (18), 16 states have call predecessors, (18), 13 states have call successors, (18) [2024-10-13 22:40:04,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 207 transitions. [2024-10-13 22:40:04,440 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 207 transitions. Word has length 36 [2024-10-13 22:40:04,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:04,443 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 207 transitions. [2024-10-13 22:40:04,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-10-13 22:40:04,443 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 207 transitions. [2024-10-13 22:40:04,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 22:40:04,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:04,444 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:40:04,447 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-10-13 22:40:04,644 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-10-13 22:40:04,645 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:04,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:04,646 INFO L85 PathProgramCache]: Analyzing trace with hash -713277085, now seen corresponding path program 1 times [2024-10-13 22:40:04,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:40:04,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941911749] [2024-10-13 22:40:04,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:04,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:04,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:40:04,648 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-10-13 22:40:04,649 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-10-13 22:40:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:04,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 22:40:04,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:40:04,751 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:40:04,751 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:40:04,799 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:40:04,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:40:04,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941911749] [2024-10-13 22:40:04,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941911749] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:40:04,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 22:40:04,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-10-13 22:40:04,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906398530] [2024-10-13 22:40:04,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 22:40:04,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 22:40:04,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:40:04,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 22:40:04,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:40:04,801 INFO L87 Difference]: Start difference. First operand 142 states and 207 transitions. Second operand has 6 states, 5 states have (on average 5.0) 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-10-13 22:40:04,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:04,863 INFO L93 Difference]: Finished difference Result 315 states and 466 transitions. [2024-10-13 22:40:04,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 22:40:04,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) 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 36 [2024-10-13 22:40:04,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:04,865 INFO L225 Difference]: With dead ends: 315 [2024-10-13 22:40:04,865 INFO L226 Difference]: Without dead ends: 242 [2024-10-13 22:40:04,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 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-10-13 22:40:04,866 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 41 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:04,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 412 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:40:04,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-10-13 22:40:04,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2024-10-13 22:40:04,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 212 states have (on average 1.3773584905660377) internal successors, (292), 211 states have internal predecessors, (292), 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-10-13 22:40:04,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 346 transitions. [2024-10-13 22:40:04,878 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 346 transitions. Word has length 36 [2024-10-13 22:40:04,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:04,878 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 346 transitions. [2024-10-13 22:40:04,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) 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-10-13 22:40:04,879 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 346 transitions. [2024-10-13 22:40:04,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 22:40:04,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:04,880 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:40:04,886 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-10-13 22:40:05,080 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-10-13 22:40:05,081 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:05,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:05,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1892344627, now seen corresponding path program 1 times [2024-10-13 22:40:05,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:40:05,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038791091] [2024-10-13 22:40:05,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:05,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:05,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:40:05,084 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-10-13 22:40:05,085 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-10-13 22:40:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:05,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 22:40:05,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:40:05,199 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:40:05,203 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:40:05,242 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:40:05,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:40:05,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038791091] [2024-10-13 22:40:05,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038791091] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:40:05,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 22:40:05,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-10-13 22:40:05,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297188792] [2024-10-13 22:40:05,243 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 22:40:05,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 22:40:05,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:40:05,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 22:40:05,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 22:40:05,244 INFO L87 Difference]: Start difference. First operand 240 states and 346 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-10-13 22:40:05,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:05,357 INFO L93 Difference]: Finished difference Result 275 states and 397 transitions. [2024-10-13 22:40:05,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 22:40:05,358 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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 36 [2024-10-13 22:40:05,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:05,359 INFO L225 Difference]: With dead ends: 275 [2024-10-13 22:40:05,359 INFO L226 Difference]: Without dead ends: 226 [2024-10-13 22:40:05,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 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-10-13 22:40:05,360 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 27 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:05,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 559 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:40:05,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-13 22:40:05,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 222. [2024-10-13 22:40:05,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 198 states have (on average 1.3636363636363635) internal successors, (270), 197 states have internal predecessors, (270), 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-10-13 22:40:05,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 316 transitions. [2024-10-13 22:40:05,374 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 316 transitions. Word has length 36 [2024-10-13 22:40:05,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:05,374 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 316 transitions. [2024-10-13 22:40:05,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-10-13 22:40:05,374 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 316 transitions. [2024-10-13 22:40:05,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-13 22:40:05,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:05,375 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:40:05,381 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 (7)] Forceful destruction successful, exit code 0 [2024-10-13 22:40:05,575 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-10-13 22:40:05,576 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:05,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:05,576 INFO L85 PathProgramCache]: Analyzing trace with hash 189552572, now seen corresponding path program 1 times [2024-10-13 22:40:05,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:40:05,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008146474] [2024-10-13 22:40:05,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:05,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:05,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:40:05,581 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-10-13 22:40:05,583 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-10-13 22:40:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:05,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 22:40:05,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:40:05,645 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 22:40:05,646 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:40:05,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:40:05,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008146474] [2024-10-13 22:40:05,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008146474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:05,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:05,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 22:40:05,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786497245] [2024-10-13 22:40:05,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:05,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:40:05,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:40:05,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:40:05,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:40:05,647 INFO L87 Difference]: Start difference. First operand 222 states and 316 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-10-13 22:40:05,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:05,693 INFO L93 Difference]: Finished difference Result 386 states and 547 transitions. [2024-10-13 22:40:05,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 22:40:05,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 38 [2024-10-13 22:40:05,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:05,695 INFO L225 Difference]: With dead ends: 386 [2024-10-13 22:40:05,695 INFO L226 Difference]: Without dead ends: 166 [2024-10-13 22:40:05,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 22:40:05,696 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 25 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:05,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 236 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:05,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-13 22:40:05,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 156. [2024-10-13 22:40:05,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 138 states have (on average 1.326086956521739) internal successors, (183), 140 states have internal predecessors, (183), 13 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (18), 15 states have call predecessors, (18), 12 states have call successors, (18) [2024-10-13 22:40:05,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 214 transitions. [2024-10-13 22:40:05,703 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 214 transitions. Word has length 38 [2024-10-13 22:40:05,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:05,703 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 214 transitions. [2024-10-13 22:40:05,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-10-13 22:40:05,704 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 214 transitions. [2024-10-13 22:40:05,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 22:40:05,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:05,707 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:40:05,710 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 (8)] Forceful destruction successful, exit code 0 [2024-10-13 22:40:05,909 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-10-13 22:40:05,909 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:05,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:05,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1073353582, now seen corresponding path program 1 times [2024-10-13 22:40:05,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:40:05,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013192247] [2024-10-13 22:40:05,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:05,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:05,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:40:05,913 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-10-13 22:40:05,914 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-10-13 22:40:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:05,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 22:40:05,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:40:06,080 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:40:06,082 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:40:06,144 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:40:06,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:40:06,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013192247] [2024-10-13 22:40:06,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013192247] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 22:40:06,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:40:06,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-13 22:40:06,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175039071] [2024-10-13 22:40:06,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:06,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 22:40:06,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:40:06,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 22:40:06,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-13 22:40:06,147 INFO L87 Difference]: Start difference. First operand 156 states and 214 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-10-13 22:40:06,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:06,274 INFO L93 Difference]: Finished difference Result 237 states and 335 transitions. [2024-10-13 22:40:06,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 22:40:06,274 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 39 [2024-10-13 22:40:06,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:06,276 INFO L225 Difference]: With dead ends: 237 [2024-10-13 22:40:06,276 INFO L226 Difference]: Without dead ends: 201 [2024-10-13 22:40:06,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-13 22:40:06,277 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 24 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:06,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 324 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:40:06,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-13 22:40:06,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 191. [2024-10-13 22:40:06,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 169 states have (on average 1.319526627218935) internal successors, (223), 172 states have internal predecessors, (223), 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-10-13 22:40:06,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 262 transitions. [2024-10-13 22:40:06,285 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 262 transitions. Word has length 39 [2024-10-13 22:40:06,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:06,285 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 262 transitions. [2024-10-13 22:40:06,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-10-13 22:40:06,286 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 262 transitions. [2024-10-13 22:40:06,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 22:40:06,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:06,287 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:40:06,290 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-10-13 22:40:06,489 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-10-13 22:40:06,489 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:06,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:06,491 INFO L85 PathProgramCache]: Analyzing trace with hash 701653780, now seen corresponding path program 1 times [2024-10-13 22:40:06,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:40:06,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948735913] [2024-10-13 22:40:06,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:06,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:06,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:40:06,494 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-10-13 22:40:06,495 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-10-13 22:40:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:06,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 22:40:06,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:40:06,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:40:06,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:40:06,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:40:06,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1948735913] [2024-10-13 22:40:06,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1948735913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:06,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:06,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 22:40:06,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25225700] [2024-10-13 22:40:06,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:06,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 22:40:06,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:40:06,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 22:40:06,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 22:40:06,565 INFO L87 Difference]: Start difference. First operand 191 states and 262 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-10-13 22:40:06,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:06,590 INFO L93 Difference]: Finished difference Result 198 states and 268 transitions. [2024-10-13 22:40:06,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 22:40:06,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 39 [2024-10-13 22:40:06,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:06,592 INFO L225 Difference]: With dead ends: 198 [2024-10-13 22:40:06,592 INFO L226 Difference]: Without dead ends: 191 [2024-10-13 22:40:06,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:40:06,593 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 3 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:06,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 356 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:06,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-13 22:40:06,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-10-13 22:40:06,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 169 states have (on average 1.301775147928994) internal successors, (220), 172 states have internal predecessors, (220), 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-10-13 22:40:06,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 259 transitions. [2024-10-13 22:40:06,602 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 259 transitions. Word has length 39 [2024-10-13 22:40:06,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:06,602 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 259 transitions. [2024-10-13 22:40:06,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-10-13 22:40:06,602 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 259 transitions. [2024-10-13 22:40:06,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 22:40:06,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:06,603 INFO L215 NwaCegarLoop]: trace histogram [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-10-13 22:40:06,608 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-10-13 22:40:06,805 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-10-13 22:40:06,806 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:06,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:06,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1960026152, now seen corresponding path program 1 times [2024-10-13 22:40:06,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:40:06,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370847892] [2024-10-13 22:40:06,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:06,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:06,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:40:06,809 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-10-13 22:40:06,810 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-10-13 22:40:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:06,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 22:40:06,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:40:06,857 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:40:06,858 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:40:06,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:40:06,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370847892] [2024-10-13 22:40:06,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370847892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:06,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:06,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 22:40:06,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443718489] [2024-10-13 22:40:06,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:06,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:40:06,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:40:06,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:40:06,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:40:06,859 INFO L87 Difference]: Start difference. First operand 191 states and 259 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-10-13 22:40:06,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:06,880 INFO L93 Difference]: Finished difference Result 318 states and 438 transitions. [2024-10-13 22:40:06,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:40:06,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 40 [2024-10-13 22:40:06,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:06,882 INFO L225 Difference]: With dead ends: 318 [2024-10-13 22:40:06,882 INFO L226 Difference]: Without dead ends: 266 [2024-10-13 22:40:06,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:40:06,883 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 28 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:06,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 295 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:06,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-10-13 22:40:06,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 208. [2024-10-13 22:40:06,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 185 states have (on average 1.308108108108108) internal successors, (242), 187 states have internal predecessors, (242), 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-10-13 22:40:06,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 283 transitions. [2024-10-13 22:40:06,890 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 283 transitions. Word has length 40 [2024-10-13 22:40:06,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:06,891 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 283 transitions. [2024-10-13 22:40:06,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-10-13 22:40:06,891 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 283 transitions. [2024-10-13 22:40:06,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 22:40:06,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:06,892 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:40:06,897 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 (11)] Ended with exit code 0 [2024-10-13 22:40:07,094 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-10-13 22:40:07,094 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:07,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:07,095 INFO L85 PathProgramCache]: Analyzing trace with hash 645595560, now seen corresponding path program 2 times [2024-10-13 22:40:07,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:40:07,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004605162] [2024-10-13 22:40:07,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 22:40:07,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:07,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:40:07,098 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-10-13 22:40:07,099 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-10-13 22:40:07,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 22:40:07,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 22:40:07,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 22:40:07,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:40:07,228 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 22:40:07,228 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:40:07,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:40:07,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004605162] [2024-10-13 22:40:07,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1004605162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:07,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:07,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 22:40:07,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549557021] [2024-10-13 22:40:07,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:07,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 22:40:07,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:40:07,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 22:40:07,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:40:07,230 INFO L87 Difference]: Start difference. First operand 208 states and 283 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-10-13 22:40:07,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:07,303 INFO L93 Difference]: Finished difference Result 214 states and 288 transitions. [2024-10-13 22:40:07,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 22:40:07,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 40 [2024-10-13 22:40:07,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:07,304 INFO L225 Difference]: With dead ends: 214 [2024-10-13 22:40:07,304 INFO L226 Difference]: Without dead ends: 212 [2024-10-13 22:40:07,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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-10-13 22:40:07,305 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 3 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:07,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 427 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:40:07,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-13 22:40:07,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-10-13 22:40:07,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 188 states have (on average 1.303191489361702) internal successors, (245), 190 states have internal predecessors, (245), 18 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (23), 20 states have call predecessors, (23), 17 states have call successors, (23) [2024-10-13 22:40:07,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 286 transitions. [2024-10-13 22:40:07,312 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 286 transitions. Word has length 40 [2024-10-13 22:40:07,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:07,313 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 286 transitions. [2024-10-13 22:40:07,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-10-13 22:40:07,313 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 286 transitions. [2024-10-13 22:40:07,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 22:40:07,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:07,314 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:40:07,317 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-10-13 22:40:07,516 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-10-13 22:40:07,516 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:07,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:07,517 INFO L85 PathProgramCache]: Analyzing trace with hash 702853862, now seen corresponding path program 1 times [2024-10-13 22:40:07,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:40:07,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834478892] [2024-10-13 22:40:07,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:07,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:07,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:40:07,520 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-10-13 22:40:07,520 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-10-13 22:40:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:07,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 22:40:07,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:40:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:40:07,768 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:40:07,867 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 22:40:07,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:40:07,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834478892] [2024-10-13 22:40:07,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834478892] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 22:40:07,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:40:07,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2024-10-13 22:40:07,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933684342] [2024-10-13 22:40:07,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:07,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 22:40:07,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:40:07,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 22:40:07,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-10-13 22:40:07,869 INFO L87 Difference]: Start difference. First operand 212 states and 286 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-10-13 22:40:07,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:07,939 INFO L93 Difference]: Finished difference Result 218 states and 291 transitions. [2024-10-13 22:40:07,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 22:40:07,939 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 40 [2024-10-13 22:40:07,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:07,941 INFO L225 Difference]: With dead ends: 218 [2024-10-13 22:40:07,941 INFO L226 Difference]: Without dead ends: 216 [2024-10-13 22:40:07,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-10-13 22:40:07,942 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 3 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:07,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 422 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:07,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-13 22:40:07,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2024-10-13 22:40:07,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 191 states have (on average 1.2984293193717278) internal successors, (248), 193 states have internal predecessors, (248), 18 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (23), 20 states have call predecessors, (23), 17 states have call successors, (23) [2024-10-13 22:40:07,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 289 transitions. [2024-10-13 22:40:07,953 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 289 transitions. Word has length 40 [2024-10-13 22:40:07,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:07,954 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 289 transitions. [2024-10-13 22:40:07,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-10-13 22:40:07,954 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 289 transitions. [2024-10-13 22:40:07,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-13 22:40:07,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:07,955 INFO L215 NwaCegarLoop]: trace histogram [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-10-13 22:40:07,962 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-10-13 22:40:08,156 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-10-13 22:40:08,156 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:08,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:08,157 INFO L85 PathProgramCache]: Analyzing trace with hash -795813825, now seen corresponding path program 1 times [2024-10-13 22:40:08,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:40:08,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938160436] [2024-10-13 22:40:08,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:08,157 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:08,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:40:08,160 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-10-13 22:40:08,161 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-10-13 22:40:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:08,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 22:40:08,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:40:08,205 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:40:08,206 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:40:08,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:40:08,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [938160436] [2024-10-13 22:40:08,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [938160436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:08,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:08,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 22:40:08,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964979570] [2024-10-13 22:40:08,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:08,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:40:08,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:40:08,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:40:08,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:40:08,208 INFO L87 Difference]: Start difference. First operand 216 states and 289 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-10-13 22:40:08,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:08,228 INFO L93 Difference]: Finished difference Result 231 states and 305 transitions. [2024-10-13 22:40:08,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:40:08,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 43 [2024-10-13 22:40:08,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:08,230 INFO L225 Difference]: With dead ends: 231 [2024-10-13 22:40:08,230 INFO L226 Difference]: Without dead ends: 194 [2024-10-13 22:40:08,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:40:08,230 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:08,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 266 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:08,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-13 22:40:08,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2024-10-13 22:40:08,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 169 states have (on average 1.3136094674556213) internal successors, (222), 172 states have internal predecessors, (222), 18 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (21), 19 states have call predecessors, (21), 17 states have call successors, (21) [2024-10-13 22:40:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 261 transitions. [2024-10-13 22:40:08,242 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 261 transitions. Word has length 43 [2024-10-13 22:40:08,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:08,242 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 261 transitions. [2024-10-13 22:40:08,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-10-13 22:40:08,243 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 261 transitions. [2024-10-13 22:40:08,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 22:40:08,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:08,244 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:40:08,248 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 (14)] Ended with exit code 0 [2024-10-13 22:40:08,444 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-10-13 22:40:08,445 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:08,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:08,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1053756109, now seen corresponding path program 1 times [2024-10-13 22:40:08,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:40:08,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634668973] [2024-10-13 22:40:08,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:08,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:08,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:40:08,449 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-10-13 22:40:08,449 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-10-13 22:40:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:08,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 22:40:08,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:40:08,511 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 22:40:08,511 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:40:08,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:40:08,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634668973] [2024-10-13 22:40:08,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634668973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:08,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:08,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 22:40:08,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893388522] [2024-10-13 22:40:08,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:08,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 22:40:08,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:40:08,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 22:40:08,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 22:40:08,513 INFO L87 Difference]: Start difference. First operand 194 states and 261 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-10-13 22:40:08,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:08,582 INFO L93 Difference]: Finished difference Result 245 states and 333 transitions. [2024-10-13 22:40:08,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 22:40:08,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-10-13 22:40:08,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:08,583 INFO L225 Difference]: With dead ends: 245 [2024-10-13 22:40:08,584 INFO L226 Difference]: Without dead ends: 205 [2024-10-13 22:40:08,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 22:40:08,584 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 56 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:08,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 330 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:40:08,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-13 22:40:08,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 194. [2024-10-13 22:40:08,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 169 states have (on average 1.301775147928994) internal successors, (220), 172 states have internal predecessors, (220), 18 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (21), 19 states have call predecessors, (21), 17 states have call successors, (21) [2024-10-13 22:40:08,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 259 transitions. [2024-10-13 22:40:08,602 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 259 transitions. Word has length 44 [2024-10-13 22:40:08,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:08,603 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 259 transitions. [2024-10-13 22:40:08,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-10-13 22:40:08,603 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 259 transitions. [2024-10-13 22:40:08,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 22:40:08,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:08,604 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:40:08,611 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-10-13 22:40:08,806 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-10-13 22:40:08,806 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:08,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:08,807 INFO L85 PathProgramCache]: Analyzing trace with hash 660729099, now seen corresponding path program 1 times [2024-10-13 22:40:08,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:40:08,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [931849981] [2024-10-13 22:40:08,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:08,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:08,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:40:08,810 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-10-13 22:40:08,810 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-10-13 22:40:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:08,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 22:40:08,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:40:08,857 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 22:40:08,858 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:40:08,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:40:08,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [931849981] [2024-10-13 22:40:08,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [931849981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:08,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:08,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 22:40:08,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327869121] [2024-10-13 22:40:08,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:08,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:40:08,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:40:08,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:40:08,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:40:08,859 INFO L87 Difference]: Start difference. First operand 194 states and 259 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-10-13 22:40:08,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:08,901 INFO L93 Difference]: Finished difference Result 267 states and 356 transitions. [2024-10-13 22:40:08,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:40:08,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-10-13 22:40:08,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:08,903 INFO L225 Difference]: With dead ends: 267 [2024-10-13 22:40:08,903 INFO L226 Difference]: Without dead ends: 238 [2024-10-13 22:40:08,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 22:40:08,904 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 39 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:08,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 258 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:08,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-13 22:40:08,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 198. [2024-10-13 22:40:08,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 173 states have (on average 1.2947976878612717) internal successors, (224), 176 states have internal predecessors, (224), 18 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (21), 19 states have call predecessors, (21), 17 states have call successors, (21) [2024-10-13 22:40:08,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 263 transitions. [2024-10-13 22:40:08,911 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 263 transitions. Word has length 44 [2024-10-13 22:40:08,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:08,911 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 263 transitions. [2024-10-13 22:40:08,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-10-13 22:40:08,911 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 263 transitions. [2024-10-13 22:40:08,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 22:40:08,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:08,912 INFO L215 NwaCegarLoop]: trace histogram [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-10-13 22:40:08,915 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-10-13 22:40:09,114 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-10-13 22:40:09,115 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:09,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:09,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1173785422, now seen corresponding path program 1 times [2024-10-13 22:40:09,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:40:09,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411919363] [2024-10-13 22:40:09,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:09,116 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:09,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:40:09,119 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-10-13 22:40:09,120 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-10-13 22:40:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:09,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 22:40:09,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:40:09,196 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:40:09,196 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:40:09,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:40:09,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411919363] [2024-10-13 22:40:09,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1411919363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:09,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:09,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 22:40:09,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175226035] [2024-10-13 22:40:09,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:09,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 22:40:09,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:40:09,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 22:40:09,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:40:09,198 INFO L87 Difference]: Start difference. First operand 198 states and 263 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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-10-13 22:40:09,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:09,323 INFO L93 Difference]: Finished difference Result 271 states and 369 transitions. [2024-10-13 22:40:09,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 22:40:09,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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 45 [2024-10-13 22:40:09,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:09,324 INFO L225 Difference]: With dead ends: 271 [2024-10-13 22:40:09,325 INFO L226 Difference]: Without dead ends: 247 [2024-10-13 22:40:09,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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-10-13 22:40:09,326 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 26 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:09,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 352 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:40:09,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-13 22:40:09,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 232. [2024-10-13 22:40:09,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 203 states have (on average 1.29064039408867) internal successors, (262), 207 states have internal predecessors, (262), 22 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (25), 23 states have call predecessors, (25), 21 states have call successors, (25) [2024-10-13 22:40:09,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 309 transitions. [2024-10-13 22:40:09,334 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 309 transitions. Word has length 45 [2024-10-13 22:40:09,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:09,334 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 309 transitions. [2024-10-13 22:40:09,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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-10-13 22:40:09,335 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 309 transitions. [2024-10-13 22:40:09,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 22:40:09,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:09,335 INFO L215 NwaCegarLoop]: trace histogram [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-10-13 22:40:09,339 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-10-13 22:40:09,538 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-10-13 22:40:09,538 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:09,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:09,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1256313678, now seen corresponding path program 1 times [2024-10-13 22:40:09,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:40:09,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008413659] [2024-10-13 22:40:09,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:09,539 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:09,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:40:09,542 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-10-13 22:40:09,543 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-10-13 22:40:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:09,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 22:40:09,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:40:09,639 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:40:09,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:40:09,687 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:40:09,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:40:09,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008413659] [2024-10-13 22:40:09,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008413659] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:40:09,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 22:40:09,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2024-10-13 22:40:09,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237008213] [2024-10-13 22:40:09,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 22:40:09,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 22:40:09,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:40:09,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 22:40:09,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 22:40:09,689 INFO L87 Difference]: Start difference. First operand 232 states and 309 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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-10-13 22:40:09,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:09,758 INFO L93 Difference]: Finished difference Result 255 states and 335 transitions. [2024-10-13 22:40:09,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 22:40:09,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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 45 [2024-10-13 22:40:09,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:09,760 INFO L225 Difference]: With dead ends: 255 [2024-10-13 22:40:09,760 INFO L226 Difference]: Without dead ends: 223 [2024-10-13 22:40:09,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 81 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-10-13 22:40:09,761 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 20 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:09,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 524 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:40:09,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-13 22:40:09,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 213. [2024-10-13 22:40:09,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 184 states have (on average 1.298913043478261) internal successors, (239), 188 states have internal predecessors, (239), 22 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (25), 23 states have call predecessors, (25), 21 states have call successors, (25) [2024-10-13 22:40:09,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 286 transitions. [2024-10-13 22:40:09,769 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 286 transitions. Word has length 45 [2024-10-13 22:40:09,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:09,769 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 286 transitions. [2024-10-13 22:40:09,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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-10-13 22:40:09,769 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 286 transitions. [2024-10-13 22:40:09,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 22:40:09,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:09,770 INFO L215 NwaCegarLoop]: trace histogram [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-10-13 22:40:09,774 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-10-13 22:40:09,970 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-10-13 22:40:09,970 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:09,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:09,971 INFO L85 PathProgramCache]: Analyzing trace with hash 833611852, now seen corresponding path program 1 times [2024-10-13 22:40:09,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:40:09,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758953887] [2024-10-13 22:40:09,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:09,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:09,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:40:09,972 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-10-13 22:40:09,974 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-10-13 22:40:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:10,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 22:40:10,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:40:10,032 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:40:10,032 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:40:10,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:40:10,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1758953887] [2024-10-13 22:40:10,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1758953887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:10,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:10,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 22:40:10,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625423591] [2024-10-13 22:40:10,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:10,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:40:10,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:40:10,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:40:10,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:40:10,034 INFO L87 Difference]: Start difference. First operand 213 states and 286 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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-10-13 22:40:10,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:10,059 INFO L93 Difference]: Finished difference Result 247 states and 327 transitions. [2024-10-13 22:40:10,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:40:10,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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 45 [2024-10-13 22:40:10,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:10,060 INFO L225 Difference]: With dead ends: 247 [2024-10-13 22:40:10,060 INFO L226 Difference]: Without dead ends: 213 [2024-10-13 22:40:10,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:40:10,061 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 26 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 263 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-10-13 22:40:10,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 263 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:10,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-13 22:40:10,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-10-13 22:40:10,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 184 states have (on average 1.233695652173913) internal successors, (227), 188 states have internal predecessors, (227), 22 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (25), 23 states have call predecessors, (25), 21 states have call successors, (25) [2024-10-13 22:40:10,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 274 transitions. [2024-10-13 22:40:10,072 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 274 transitions. Word has length 45 [2024-10-13 22:40:10,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:10,073 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 274 transitions. [2024-10-13 22:40:10,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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-10-13 22:40:10,073 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 274 transitions. [2024-10-13 22:40:10,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-13 22:40:10,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:10,074 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:40:10,077 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-10-13 22:40:10,274 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-10-13 22:40:10,274 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:10,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:10,276 INFO L85 PathProgramCache]: Analyzing trace with hash -2070421974, now seen corresponding path program 1 times [2024-10-13 22:40:10,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:40:10,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964501756] [2024-10-13 22:40:10,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:10,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:10,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:40:10,277 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-10-13 22:40:10,280 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-10-13 22:40:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:10,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 22:40:10,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:40:10,328 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:40:10,329 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:40:10,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:40:10,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964501756] [2024-10-13 22:40:10,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964501756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:10,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:10,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 22:40:10,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994712724] [2024-10-13 22:40:10,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:10,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:40:10,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:40:10,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:40:10,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:40:10,330 INFO L87 Difference]: Start difference. First operand 213 states and 274 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-10-13 22:40:10,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:10,348 INFO L93 Difference]: Finished difference Result 222 states and 282 transitions. [2024-10-13 22:40:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:40:10,349 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 47 [2024-10-13 22:40:10,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:10,350 INFO L225 Difference]: With dead ends: 222 [2024-10-13 22:40:10,350 INFO L226 Difference]: Without dead ends: 183 [2024-10-13 22:40:10,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:40:10,351 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:10,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 263 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:10,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-13 22:40:10,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 173. [2024-10-13 22:40:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 147 states have (on average 1.2448979591836735) internal successors, (183), 153 states have internal predecessors, (183), 19 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2024-10-13 22:40:10,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 221 transitions. [2024-10-13 22:40:10,378 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 221 transitions. Word has length 47 [2024-10-13 22:40:10,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:10,379 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 221 transitions. [2024-10-13 22:40:10,379 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-10-13 22:40:10,379 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 221 transitions. [2024-10-13 22:40:10,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-13 22:40:10,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:10,380 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:40:10,384 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-10-13 22:40:10,582 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-10-13 22:40:10,582 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:10,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:10,583 INFO L85 PathProgramCache]: Analyzing trace with hash 322717964, now seen corresponding path program 1 times [2024-10-13 22:40:10,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:40:10,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985927993] [2024-10-13 22:40:10,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:10,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:10,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:40:10,586 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-10-13 22:40:10,586 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-10-13 22:40:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:10,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 22:40:10,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:40:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:40:10,647 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:40:10,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:40:10,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985927993] [2024-10-13 22:40:10,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [985927993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:10,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:10,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 22:40:10,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833473958] [2024-10-13 22:40:10,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:10,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 22:40:10,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:40:10,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 22:40:10,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 22:40:10,649 INFO L87 Difference]: Start difference. First operand 173 states and 221 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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-10-13 22:40:10,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:10,737 INFO L93 Difference]: Finished difference Result 221 states and 286 transitions. [2024-10-13 22:40:10,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 22:40:10,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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 47 [2024-10-13 22:40:10,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:10,739 INFO L225 Difference]: With dead ends: 221 [2024-10-13 22:40:10,739 INFO L226 Difference]: Without dead ends: 175 [2024-10-13 22:40:10,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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-10-13 22:40:10,740 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 19 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:10,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 350 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:40:10,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-13 22:40:10,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 150. [2024-10-13 22:40:10,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 124 states have (on average 1.2661290322580645) internal successors, (157), 130 states have internal predecessors, (157), 20 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 22:40:10,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 195 transitions. [2024-10-13 22:40:10,747 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 195 transitions. Word has length 47 [2024-10-13 22:40:10,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:10,747 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 195 transitions. [2024-10-13 22:40:10,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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-10-13 22:40:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 195 transitions. [2024-10-13 22:40:10,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-13 22:40:10,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:10,748 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:40:10,751 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-10-13 22:40:10,950 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-10-13 22:40:10,951 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:10,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:10,951 INFO L85 PathProgramCache]: Analyzing trace with hash 914926325, now seen corresponding path program 1 times [2024-10-13 22:40:10,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:40:10,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249604420] [2024-10-13 22:40:10,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:10,952 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:10,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:40:10,956 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-10-13 22:40:10,961 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-10-13 22:40:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:11,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 22:40:11,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:40:11,176 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 22:40:11,177 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:40:11,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:40:11,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [249604420] [2024-10-13 22:40:11,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [249604420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:11,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:11,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 22:40:11,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952743911] [2024-10-13 22:40:11,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:11,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 22:40:11,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:40:11,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 22:40:11,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 22:40:11,179 INFO L87 Difference]: Start difference. First operand 150 states and 195 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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-10-13 22:40:11,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:11,302 INFO L93 Difference]: Finished difference Result 165 states and 212 transitions. [2024-10-13 22:40:11,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 22:40:11,302 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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 50 [2024-10-13 22:40:11,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:11,303 INFO L225 Difference]: With dead ends: 165 [2024-10-13 22:40:11,303 INFO L226 Difference]: Without dead ends: 163 [2024-10-13 22:40:11,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-13 22:40:11,304 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 6 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:11,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 381 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:40:11,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-13 22:40:11,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2024-10-13 22:40:11,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 127 states have (on average 1.2598425196850394) internal successors, (160), 136 states have internal predecessors, (160), 23 states have call successors, (23), 5 states have call predecessors, (23), 6 states have return successors, (21), 16 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 22:40:11,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 204 transitions. [2024-10-13 22:40:11,327 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 204 transitions. Word has length 50 [2024-10-13 22:40:11,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:11,327 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 204 transitions. [2024-10-13 22:40:11,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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-10-13 22:40:11,328 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 204 transitions. [2024-10-13 22:40:11,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-13 22:40:11,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:11,330 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:40:11,336 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 (22)] Ended with exit code 0 [2024-10-13 22:40:11,532 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-10-13 22:40:11,533 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:11,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:11,533 INFO L85 PathProgramCache]: Analyzing trace with hash -2015488813, now seen corresponding path program 1 times [2024-10-13 22:40:11,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:40:11,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [285127086] [2024-10-13 22:40:11,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:11,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:11,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:40:11,535 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-10-13 22:40:11,537 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-10-13 22:40:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:11,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 22:40:11,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:40:24,233 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 22:40:24,233 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:40:24,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:40:24,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [285127086] [2024-10-13 22:40:24,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [285127086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:24,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:24,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 22:40:24,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915464381] [2024-10-13 22:40:24,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:24,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 22:40:24,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:40:24,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 22:40:24,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=36, Unknown=4, NotChecked=0, Total=56 [2024-10-13 22:40:24,238 INFO L87 Difference]: Start difference. First operand 157 states and 204 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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-10-13 22:40:28,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 22:40:31,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 22:40:35,720 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-10-13 22:40:39,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.85s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 22:40:43,589 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-10-13 22:40:47,657 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-10-13 22:40:51,678 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-10-13 22:40:55,707 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-10-13 22:40:56,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:56,018 INFO L93 Difference]: Finished difference Result 169 states and 215 transitions. [2024-10-13 22:40:56,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 22:40:56,019 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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 51 [2024-10-13 22:40:56,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:56,019 INFO L225 Difference]: With dead ends: 169 [2024-10-13 22:40:56,019 INFO L226 Difference]: Without dead ends: 167 [2024-10-13 22:40:56,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=20, Invalid=48, Unknown=4, NotChecked=0, Total=72 [2024-10-13 22:40:56,020 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 6 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.7s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:56,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 460 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 8 Unknown, 0 Unchecked, 31.7s Time] [2024-10-13 22:40:56,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-13 22:40:56,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 154. [2024-10-13 22:40:56,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 127 states have (on average 1.2598425196850394) internal successors, (160), 133 states have internal predecessors, (160), 20 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 22:40:56,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 198 transitions. [2024-10-13 22:40:56,029 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 198 transitions. Word has length 51 [2024-10-13 22:40:56,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:56,030 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 198 transitions. [2024-10-13 22:40:56,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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-10-13 22:40:56,030 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 198 transitions. [2024-10-13 22:40:56,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-13 22:40:56,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:56,031 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:40:56,035 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 (23)] Forceful destruction successful, exit code 0 [2024-10-13 22:40:56,233 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-10-13 22:40:56,234 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:56,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:56,235 INFO L85 PathProgramCache]: Analyzing trace with hash -53360271, now seen corresponding path program 1 times [2024-10-13 22:40:56,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:40:56,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834438276] [2024-10-13 22:40:56,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:56,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:56,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:40:56,241 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-10-13 22:40:56,244 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-10-13 22:40:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:56,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 22:40:56,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:40:56,752 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 22:40:56,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:40:56,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:40:56,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834438276] [2024-10-13 22:40:56,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834438276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:56,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:56,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 22:40:56,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076531837] [2024-10-13 22:40:56,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:56,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 22:40:56,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:40:56,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 22:40:56,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-13 22:40:56,753 INFO L87 Difference]: Start difference. First operand 154 states and 198 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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-10-13 22:40:57,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:57,178 INFO L93 Difference]: Finished difference Result 191 states and 244 transitions. [2024-10-13 22:40:57,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 22:40:57,179 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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 53 [2024-10-13 22:40:57,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:57,179 INFO L225 Difference]: With dead ends: 191 [2024-10-13 22:40:57,180 INFO L226 Difference]: Without dead ends: 179 [2024-10-13 22:40:57,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-13 22:40:57,180 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 17 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:57,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 598 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 22:40:57,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-13 22:40:57,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 154. [2024-10-13 22:40:57,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 127 states have (on average 1.2440944881889764) internal successors, (158), 133 states have internal predecessors, (158), 20 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 22:40:57,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 196 transitions. [2024-10-13 22:40:57,187 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 196 transitions. Word has length 53 [2024-10-13 22:40:57,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:57,188 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 196 transitions. [2024-10-13 22:40:57,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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-10-13 22:40:57,188 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 196 transitions. [2024-10-13 22:40:57,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 22:40:57,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:57,188 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:40:57,192 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-10-13 22:40:57,391 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-10-13 22:40:57,391 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:57,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:57,392 INFO L85 PathProgramCache]: Analyzing trace with hash -955350985, now seen corresponding path program 1 times [2024-10-13 22:40:57,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:40:57,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [695697393] [2024-10-13 22:40:57,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:57,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:57,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:40:57,395 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-10-13 22:40:57,399 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-10-13 22:40:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:57,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 22:40:57,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:40:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 22:40:57,494 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:40:57,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:40:57,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [695697393] [2024-10-13 22:40:57,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [695697393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:57,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:57,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 22:40:57,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516730785] [2024-10-13 22:40:57,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:57,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 22:40:57,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:40:57,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 22:40:57,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:40:57,495 INFO L87 Difference]: Start difference. First operand 154 states and 196 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-10-13 22:40:57,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:57,598 INFO L93 Difference]: Finished difference Result 173 states and 216 transitions. [2024-10-13 22:40:57,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 22:40:57,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 55 [2024-10-13 22:40:57,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:57,599 INFO L225 Difference]: With dead ends: 173 [2024-10-13 22:40:57,599 INFO L226 Difference]: Without dead ends: 171 [2024-10-13 22:40:57,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 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-10-13 22:40:57,600 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 20 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:57,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 486 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:40:57,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-13 22:40:57,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2024-10-13 22:40:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 130 states have (on average 1.2384615384615385) internal successors, (161), 136 states have internal predecessors, (161), 20 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 22:40:57,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 199 transitions. [2024-10-13 22:40:57,611 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 199 transitions. Word has length 55 [2024-10-13 22:40:57,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:57,612 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 199 transitions. [2024-10-13 22:40:57,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-10-13 22:40:57,612 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 199 transitions. [2024-10-13 22:40:57,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 22:40:57,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:57,613 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:40:57,620 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-10-13 22:40:57,813 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-10-13 22:40:57,814 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:57,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:57,814 INFO L85 PathProgramCache]: Analyzing trace with hash -980561674, now seen corresponding path program 1 times [2024-10-13 22:40:57,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:40:57,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123584524] [2024-10-13 22:40:57,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:57,814 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:57,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:40:57,817 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-10-13 22:40:57,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 (26)] Waiting until timeout for monitored process [2024-10-13 22:40:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:57,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 22:40:57,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:40:58,300 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 22:40:58,300 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:40:58,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:40:58,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1123584524] [2024-10-13 22:40:58,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1123584524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:58,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:58,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 22:40:58,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888479286] [2024-10-13 22:40:58,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:58,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 22:40:58,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:40:58,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 22:40:58,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-13 22:40:58,302 INFO L87 Difference]: Start difference. First operand 158 states and 199 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-10-13 22:40:59,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:59,401 INFO L93 Difference]: Finished difference Result 253 states and 327 transitions. [2024-10-13 22:40:59,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 22:40:59,402 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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 55 [2024-10-13 22:40:59,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:59,404 INFO L225 Difference]: With dead ends: 253 [2024-10-13 22:40:59,404 INFO L226 Difference]: Without dead ends: 224 [2024-10-13 22:40:59,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-13 22:40:59,404 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 32 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:59,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 653 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 22:40:59,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-13 22:40:59,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 177. [2024-10-13 22:40:59,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 146 states have (on average 1.2328767123287672) internal successors, (180), 153 states have internal predecessors, (180), 23 states have call successors, (23), 6 states have call predecessors, (23), 7 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 22:40:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 224 transitions. [2024-10-13 22:40:59,414 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 224 transitions. Word has length 55 [2024-10-13 22:40:59,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:59,415 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 224 transitions. [2024-10-13 22:40:59,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-10-13 22:40:59,418 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 224 transitions. [2024-10-13 22:40:59,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 22:40:59,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:59,419 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:40:59,426 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 (26)] Ended with exit code 0 [2024-10-13 22:40:59,620 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-10-13 22:40:59,620 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:59,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:59,621 INFO L85 PathProgramCache]: Analyzing trace with hash -475390857, now seen corresponding path program 1 times [2024-10-13 22:40:59,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:40:59,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [940063691] [2024-10-13 22:40:59,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:59,622 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:40:59,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:40:59,623 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-10-13 22:40:59,625 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-10-13 22:40:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:59,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 22:40:59,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:40:59,742 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 22:40:59,743 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:40:59,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:40:59,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [940063691] [2024-10-13 22:40:59,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [940063691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:59,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:59,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 22:40:59,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993885715] [2024-10-13 22:40:59,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:59,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 22:40:59,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:40:59,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 22:40:59,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:40:59,744 INFO L87 Difference]: Start difference. First operand 177 states and 224 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-10-13 22:40:59,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:59,850 INFO L93 Difference]: Finished difference Result 199 states and 250 transitions. [2024-10-13 22:40:59,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 22:40:59,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 55 [2024-10-13 22:40:59,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:59,852 INFO L225 Difference]: With dead ends: 199 [2024-10-13 22:40:59,852 INFO L226 Difference]: Without dead ends: 197 [2024-10-13 22:40:59,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 22:40:59,852 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 17 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:59,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 485 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:40:59,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-13 22:40:59,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 182. [2024-10-13 22:40:59,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 149 states have (on average 1.2281879194630871) internal successors, (183), 157 states have internal predecessors, (183), 24 states have call successors, (24), 7 states have call predecessors, (24), 8 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 22:40:59,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 229 transitions. [2024-10-13 22:40:59,865 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 229 transitions. Word has length 55 [2024-10-13 22:40:59,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:59,866 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 229 transitions. [2024-10-13 22:40:59,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-10-13 22:40:59,866 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 229 transitions. [2024-10-13 22:40:59,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 22:40:59,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:59,867 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:40:59,870 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-10-13 22:41:00,069 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 [2024-10-13 22:41:00,070 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:41:00,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:41:00,070 INFO L85 PathProgramCache]: Analyzing trace with hash 950980566, now seen corresponding path program 1 times [2024-10-13 22:41:00,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:41:00,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874652565] [2024-10-13 22:41:00,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:41:00,071 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:41:00,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:41:00,075 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 22:41:00,079 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 (28)] Waiting until timeout for monitored process [2024-10-13 22:41:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:41:00,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 22:41:00,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:41:01,277 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 22:41:01,278 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:41:01,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:41:01,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874652565] [2024-10-13 22:41:01,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874652565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:41:01,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:41:01,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 22:41:01,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148134437] [2024-10-13 22:41:01,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:41:01,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 22:41:01,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:41:01,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 22:41:01,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-13 22:41:01,279 INFO L87 Difference]: Start difference. First operand 182 states and 229 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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-10-13 22:41:03,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:41:03,630 INFO L93 Difference]: Finished difference Result 261 states and 332 transitions. [2024-10-13 22:41:03,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 22:41:03,631 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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 60 [2024-10-13 22:41:03,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:41:03,632 INFO L225 Difference]: With dead ends: 261 [2024-10-13 22:41:03,632 INFO L226 Difference]: Without dead ends: 235 [2024-10-13 22:41:03,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-13 22:41:03,633 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 27 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:41:03,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 775 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 22:41:03,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-13 22:41:03,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 200. [2024-10-13 22:41:03,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 164 states have (on average 1.2317073170731707) internal successors, (202), 171 states have internal predecessors, (202), 27 states have call successors, (27), 7 states have call predecessors, (27), 8 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 22:41:03,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 254 transitions. [2024-10-13 22:41:03,666 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 254 transitions. Word has length 60 [2024-10-13 22:41:03,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:41:03,666 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 254 transitions. [2024-10-13 22:41:03,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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-10-13 22:41:03,666 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 254 transitions. [2024-10-13 22:41:03,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 22:41:03,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:41:03,667 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:41:03,672 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 (28)] Ended with exit code 0 [2024-10-13 22:41:03,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:41:03,868 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:41:03,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:41:03,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1013020180, now seen corresponding path program 1 times [2024-10-13 22:41:03,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:41:03,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705180202] [2024-10-13 22:41:03,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:41:03,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:41:03,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:41:03,870 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-10-13 22:41:03,872 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-10-13 22:41:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:41:03,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 22:41:03,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:41:04,403 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 22:41:04,404 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:41:04,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:41:04,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705180202] [2024-10-13 22:41:04,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705180202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:41:04,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:41:04,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 22:41:04,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332439912] [2024-10-13 22:41:04,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:41:04,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 22:41:04,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:41:04,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 22:41:04,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 22:41:04,405 INFO L87 Difference]: Start difference. First operand 200 states and 254 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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-10-13 22:41:09,051 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-10-13 22:41:09,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:41:09,577 INFO L93 Difference]: Finished difference Result 279 states and 360 transitions. [2024-10-13 22:41:09,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 22:41:09,578 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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 60 [2024-10-13 22:41:09,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:41:09,580 INFO L225 Difference]: With dead ends: 279 [2024-10-13 22:41:09,580 INFO L226 Difference]: Without dead ends: 256 [2024-10-13 22:41:09,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-13 22:41:09,580 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 29 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-10-13 22:41:09,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 397 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 186 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2024-10-13 22:41:09,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-13 22:41:09,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 202. [2024-10-13 22:41:09,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 165 states have (on average 1.2363636363636363) internal successors, (204), 173 states have internal predecessors, (204), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 22:41:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 258 transitions. [2024-10-13 22:41:09,597 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 258 transitions. Word has length 60 [2024-10-13 22:41:09,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:41:09,597 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 258 transitions. [2024-10-13 22:41:09,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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-10-13 22:41:09,597 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 258 transitions. [2024-10-13 22:41:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 22:41:09,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:41:09,598 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:41:09,601 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-10-13 22:41:09,800 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-10-13 22:41:09,801 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:41:09,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:41:09,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1405821100, now seen corresponding path program 1 times [2024-10-13 22:41:09,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:41:09,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496021306] [2024-10-13 22:41:09,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:41:09,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 22:41:09,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:41:09,804 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-10-13 22:41:09,805 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-10-13 22:41:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:41:09,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 22:41:09,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:41:10,335 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:41:10,335 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:41:10,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:41:10,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496021306] [2024-10-13 22:41:10,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496021306] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:41:10,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [684980431] [2024-10-13 22:41:10,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:41:10,897 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-13 22:41:10,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-13 22:41:10,901 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 22:41:10,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2024-10-13 22:41:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:41:10,980 WARN L253 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-10-13 22:41:10,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:41:11,448 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:41:11,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:41:12,181 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:41:12,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [684980431] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:41:12,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:41:12,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 21 [2024-10-13 22:41:12,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965120331] [2024-10-13 22:41:12,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:41:12,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-13 22:41:12,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:41:12,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-13 22:41:12,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2024-10-13 22:41:12,182 INFO L87 Difference]: Start difference. First operand 202 states and 258 transitions. Second operand has 21 states, 18 states have (on average 4.055555555555555) internal successors, (73), 19 states have internal predecessors, (73), 5 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11)