./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 a046e57d 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-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:11:18,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:11:18,134 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:11:18,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:11:18,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:11:18,180 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:11:18,181 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:11:18,182 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:11:18,183 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:11:18,183 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:11:18,184 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:11:18,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:11:18,185 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:11:18,186 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:11:18,188 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:11:18,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:11:18,189 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:11:18,189 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:11:18,190 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:11:18,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:11:18,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:11:18,191 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:11:18,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:11:18,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:11:18,192 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:11:18,192 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:11:18,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:11:18,196 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:11:18,196 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:11:18,197 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:11:18,197 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:11:18,197 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:11:18,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:11:18,197 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:11:18,198 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:11:18,198 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:11:18,198 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:11:18,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:11:18,198 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:11:18,199 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:11:18,199 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:11:18,201 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:11:18,201 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-12 15:11:18,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:11:18,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:11:18,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:11:18,487 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:11:18,487 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:11:18,489 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-12 15:11:19,996 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:11:20,200 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:11:20,201 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2024-10-12 15:11:20,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80e73c7ac/42112369b0fd4a3ca800127488061ee7/FLAG6c9ed8507 [2024-10-12 15:11:20,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80e73c7ac/42112369b0fd4a3ca800127488061ee7 [2024-10-12 15:11:20,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:11:20,579 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:11:20,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:11:20,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:11:20,586 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:11:20,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:11:20" (1/1) ... [2024-10-12 15:11:20,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600e5280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:20, skipping insertion in model container [2024-10-12 15:11:20,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:11:20" (1/1) ... [2024-10-12 15:11:20,624 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:11:20,790 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-12 15:11:20,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:11:20,890 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:11:20,905 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-12 15:11:20,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:11:20,980 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:11:20,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:20 WrapperNode [2024-10-12 15:11:20,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:11:20,985 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:11:20,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:11:20,986 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:11:20,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:20" (1/1) ... [2024-10-12 15:11:21,003 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:20" (1/1) ... [2024-10-12 15:11:21,035 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 190 [2024-10-12 15:11:21,036 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:11:21,037 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:11:21,037 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:11:21,037 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:11:21,047 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:20" (1/1) ... [2024-10-12 15:11:21,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:20" (1/1) ... [2024-10-12 15:11:21,049 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:20" (1/1) ... [2024-10-12 15:11:21,076 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-12 15:11:21,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:20" (1/1) ... [2024-10-12 15:11:21,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:20" (1/1) ... [2024-10-12 15:11:21,081 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:20" (1/1) ... [2024-10-12 15:11:21,090 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:20" (1/1) ... [2024-10-12 15:11:21,095 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:20" (1/1) ... [2024-10-12 15:11:21,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:20" (1/1) ... [2024-10-12 15:11:21,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:11:21,101 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:11:21,101 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:11:21,101 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:11:21,102 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:20" (1/1) ... [2024-10-12 15:11:21,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:11:21,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:21,139 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-12 15:11:21,143 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-12 15:11:21,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:11:21,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:11:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-10-12 15:11:21,196 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-10-12 15:11:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:11:21,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:11:21,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-12 15:11:21,197 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-12 15:11:21,286 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:11:21,289 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:11:21,752 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-10-12 15:11:21,753 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:11:21,796 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:11:21,796 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 15:11:21,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:11:21 BoogieIcfgContainer [2024-10-12 15:11:21,796 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:11:21,798 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:11:21,798 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:11:21,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:11:21,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:11:20" (1/3) ... [2024-10-12 15:11:21,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12cb7486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:11:21, skipping insertion in model container [2024-10-12 15:11:21,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:20" (2/3) ... [2024-10-12 15:11:21,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12cb7486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:11:21, skipping insertion in model container [2024-10-12 15:11:21,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:11:21" (3/3) ... [2024-10-12 15:11:21,805 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2024-10-12 15:11:21,822 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:11:21,822 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:11:21,883 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:11:21,889 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;@6f3ecb97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:11:21,890 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:11:21,895 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-12 15:11:21,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-12 15:11:21,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:21,913 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-12 15:11:21,914 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:21,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:21,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1350693099, now seen corresponding path program 1 times [2024-10-12 15:11:21,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:21,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428665646] [2024-10-12 15:11:21,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:21,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:22,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:22,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:22,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:22,272 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-12 15:11:22,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:22,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428665646] [2024-10-12 15:11:22,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428665646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:22,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:22,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:22,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98606415] [2024-10-12 15:11:22,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:22,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:22,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:22,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:22,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:22,313 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-12 15:11:22,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:22,368 INFO L93 Difference]: Finished difference Result 215 states and 351 transitions. [2024-10-12 15:11:22,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:22,374 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-12 15:11:22,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:22,386 INFO L225 Difference]: With dead ends: 215 [2024-10-12 15:11:22,387 INFO L226 Difference]: Without dead ends: 124 [2024-10-12 15:11:22,390 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-12 15:11:22,393 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-12 15:11:22,394 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-12 15:11:22,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-12 15:11:22,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-12 15:11:22,434 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-12 15:11:22,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 184 transitions. [2024-10-12 15:11:22,438 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 184 transitions. Word has length 32 [2024-10-12 15:11:22,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:22,440 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 184 transitions. [2024-10-12 15:11:22,441 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-12 15:11:22,441 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 184 transitions. [2024-10-12 15:11:22,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-12 15:11:22,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:22,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] [2024-10-12 15:11:22,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:11:22,445 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:22,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:22,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1536909670, now seen corresponding path program 1 times [2024-10-12 15:11:22,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:22,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406728344] [2024-10-12 15:11:22,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:22,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:22,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:22,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:22,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:22,796 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-12 15:11:22,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:22,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406728344] [2024-10-12 15:11:22,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406728344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:22,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:22,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 15:11:22,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273997219] [2024-10-12 15:11:22,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:22,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 15:11:22,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:22,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 15:11:22,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:11:22,803 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-12 15:11:22,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:22,955 INFO L93 Difference]: Finished difference Result 256 states and 384 transitions. [2024-10-12 15:11:22,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 15:11:22,956 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-12 15:11:22,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:22,962 INFO L225 Difference]: With dead ends: 256 [2024-10-12 15:11:22,965 INFO L226 Difference]: Without dead ends: 165 [2024-10-12 15:11:22,966 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-12 15:11:22,967 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-12 15:11:22,968 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-12 15:11:22,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-12 15:11:22,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2024-10-12 15:11:22,985 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-12 15:11:22,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2024-10-12 15:11:22,988 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 32 [2024-10-12 15:11:22,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:22,988 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2024-10-12 15:11:22,989 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-12 15:11:22,989 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2024-10-12 15:11:22,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-12 15:11:22,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:22,990 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-12 15:11:22,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:11:22,991 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:22,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:22,992 INFO L85 PathProgramCache]: Analyzing trace with hash 358892418, now seen corresponding path program 1 times [2024-10-12 15:11:22,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:22,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177853859] [2024-10-12 15:11:22,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:22,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:23,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:23,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:23,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:23,064 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-12 15:11:23,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:23,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177853859] [2024-10-12 15:11:23,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177853859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:23,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:23,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:23,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905400679] [2024-10-12 15:11:23,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:23,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:23,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:23,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:23,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:23,067 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-12 15:11:23,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:23,101 INFO L93 Difference]: Finished difference Result 297 states and 438 transitions. [2024-10-12 15:11:23,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:23,103 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-12 15:11:23,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:23,105 INFO L225 Difference]: With dead ends: 297 [2024-10-12 15:11:23,107 INFO L226 Difference]: Without dead ends: 241 [2024-10-12 15:11:23,107 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-12 15:11:23,111 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-12 15:11:23,112 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-12 15:11:23,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-12 15:11:23,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 227. [2024-10-12 15:11:23,137 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-12 15:11:23,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 327 transitions. [2024-10-12 15:11:23,141 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 327 transitions. Word has length 34 [2024-10-12 15:11:23,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:23,142 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 327 transitions. [2024-10-12 15:11:23,142 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-12 15:11:23,142 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 327 transitions. [2024-10-12 15:11:23,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 15:11:23,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:23,144 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-12 15:11:23,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:11:23,144 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:23,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:23,145 INFO L85 PathProgramCache]: Analyzing trace with hash -648098927, now seen corresponding path program 1 times [2024-10-12 15:11:23,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:23,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495359037] [2024-10-12 15:11:23,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:23,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:23,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:23,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:23,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:23,220 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-12 15:11:23,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:23,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495359037] [2024-10-12 15:11:23,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495359037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:23,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:23,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 15:11:23,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718446374] [2024-10-12 15:11:23,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:23,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:11:23,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:23,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:11:23,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:11:23,223 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-12 15:11:23,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:23,264 INFO L93 Difference]: Finished difference Result 357 states and 517 transitions. [2024-10-12 15:11:23,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:11:23,265 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-12 15:11:23,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:23,267 INFO L225 Difference]: With dead ends: 357 [2024-10-12 15:11:23,267 INFO L226 Difference]: Without dead ends: 315 [2024-10-12 15:11:23,267 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-12 15:11:23,268 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-12 15:11:23,272 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-12 15:11:23,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-12 15:11:23,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 289. [2024-10-12 15:11:23,295 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-12 15:11:23,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 418 transitions. [2024-10-12 15:11:23,300 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 418 transitions. Word has length 35 [2024-10-12 15:11:23,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:23,300 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 418 transitions. [2024-10-12 15:11:23,301 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-12 15:11:23,301 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 418 transitions. [2024-10-12 15:11:23,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 15:11:23,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:23,302 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-12 15:11:23,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:11:23,302 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:23,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:23,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1927962605, now seen corresponding path program 1 times [2024-10-12 15:11:23,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:23,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332024548] [2024-10-12 15:11:23,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:23,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:23,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:23,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:23,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:23,377 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-12 15:11:23,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:23,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332024548] [2024-10-12 15:11:23,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332024548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:23,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:23,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:23,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338008343] [2024-10-12 15:11:23,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:23,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:23,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:23,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:23,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:23,381 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-12 15:11:23,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:23,401 INFO L93 Difference]: Finished difference Result 298 states and 428 transitions. [2024-10-12 15:11:23,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:23,403 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-12 15:11:23,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:23,406 INFO L225 Difference]: With dead ends: 298 [2024-10-12 15:11:23,406 INFO L226 Difference]: Without dead ends: 291 [2024-10-12 15:11:23,406 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-12 15:11:23,409 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-12 15:11:23,409 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-12 15:11:23,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-12 15:11:23,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2024-10-12 15:11:23,426 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-12 15:11:23,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 420 transitions. [2024-10-12 15:11:23,429 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 420 transitions. Word has length 35 [2024-10-12 15:11:23,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:23,431 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 420 transitions. [2024-10-12 15:11:23,431 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-12 15:11:23,431 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 420 transitions. [2024-10-12 15:11:23,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-12 15:11:23,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:23,435 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-12 15:11:23,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:11:23,435 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:23,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:23,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1807034423, now seen corresponding path program 1 times [2024-10-12 15:11:23,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:23,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268484860] [2024-10-12 15:11:23,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:23,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:23,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:23,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:23,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:23,525 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-12 15:11:23,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:23,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268484860] [2024-10-12 15:11:23,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268484860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:23,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:23,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 15:11:23,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359840501] [2024-10-12 15:11:23,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:23,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:11:23,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:23,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:11:23,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:11:23,529 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-12 15:11:23,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:23,564 INFO L93 Difference]: Finished difference Result 452 states and 658 transitions. [2024-10-12 15:11:23,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:11:23,565 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-12 15:11:23,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:23,567 INFO L225 Difference]: With dead ends: 452 [2024-10-12 15:11:23,568 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 15:11:23,570 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-12 15:11:23,570 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-12 15:11:23,572 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-12 15:11:23,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 15:11:23,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 341. [2024-10-12 15:11:23,589 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-12 15:11:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 487 transitions. [2024-10-12 15:11:23,592 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 487 transitions. Word has length 36 [2024-10-12 15:11:23,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:23,592 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 487 transitions. [2024-10-12 15:11:23,592 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-12 15:11:23,592 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 487 transitions. [2024-10-12 15:11:23,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-12 15:11:23,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:23,594 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-12 15:11:23,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 15:11:23,594 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:23,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:23,595 INFO L85 PathProgramCache]: Analyzing trace with hash 669523543, now seen corresponding path program 1 times [2024-10-12 15:11:23,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:23,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111657913] [2024-10-12 15:11:23,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:23,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:23,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:23,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:23,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:23,745 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-12 15:11:23,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:23,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111657913] [2024-10-12 15:11:23,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111657913] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:23,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151896317] [2024-10-12 15:11:23,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:23,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:23,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:23,748 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-12 15:11:23,750 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-12 15:11:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:23,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-12 15:11:23,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:23,914 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-12 15:11:23,918 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:23,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151896317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:23,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:11:23,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-10-12 15:11:23,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402026145] [2024-10-12 15:11:23,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:23,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 15:11:23,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:23,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 15:11:23,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-12 15:11:23,922 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-12 15:11:24,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:24,023 INFO L93 Difference]: Finished difference Result 625 states and 904 transitions. [2024-10-12 15:11:24,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 15:11:24,023 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-12 15:11:24,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:24,027 INFO L225 Difference]: With dead ends: 625 [2024-10-12 15:11:24,028 INFO L226 Difference]: Without dead ends: 545 [2024-10-12 15:11:24,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-12 15:11:24,031 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 72 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12 15:11:24,032 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-12 15:11:24,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-10-12 15:11:24,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 544. [2024-10-12 15:11:24,054 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-12 15:11:24,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 786 transitions. [2024-10-12 15:11:24,058 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 786 transitions. Word has length 36 [2024-10-12 15:11:24,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:24,059 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 786 transitions. [2024-10-12 15:11:24,059 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-12 15:11:24,059 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 786 transitions. [2024-10-12 15:11:24,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 15:11:24,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:24,061 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-12 15:11:24,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 15:11:24,265 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-12 15:11:24,266 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:24,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:24,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1618202317, now seen corresponding path program 1 times [2024-10-12 15:11:24,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:24,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906168901] [2024-10-12 15:11:24,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:24,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:24,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:24,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:24,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:24,332 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-12 15:11:24,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:24,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906168901] [2024-10-12 15:11:24,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906168901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:24,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:24,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 15:11:24,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78909943] [2024-10-12 15:11:24,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:24,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:11:24,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:24,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:11:24,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:11:24,337 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-12 15:11:24,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:24,369 INFO L93 Difference]: Finished difference Result 557 states and 801 transitions. [2024-10-12 15:11:24,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:11:24,370 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-12 15:11:24,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:24,372 INFO L225 Difference]: With dead ends: 557 [2024-10-12 15:11:24,373 INFO L226 Difference]: Without dead ends: 550 [2024-10-12 15:11:24,375 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-12 15:11:24,376 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-12 15:11:24,377 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-12 15:11:24,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-10-12 15:11:24,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 547. [2024-10-12 15:11:24,394 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-12 15:11:24,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 789 transitions. [2024-10-12 15:11:24,398 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 789 transitions. Word has length 37 [2024-10-12 15:11:24,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:24,398 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 789 transitions. [2024-10-12 15:11:24,399 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-12 15:11:24,399 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 789 transitions. [2024-10-12 15:11:24,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 15:11:24,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:24,400 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-12 15:11:24,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 15:11:24,401 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:24,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:24,401 INFO L85 PathProgramCache]: Analyzing trace with hash -901757617, now seen corresponding path program 1 times [2024-10-12 15:11:24,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:24,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108343770] [2024-10-12 15:11:24,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:24,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:24,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:24,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:24,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:24,488 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-12 15:11:24,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:24,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108343770] [2024-10-12 15:11:24,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108343770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:24,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:24,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 15:11:24,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354142522] [2024-10-12 15:11:24,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:24,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 15:11:24,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:24,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 15:11:24,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:11:24,490 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-12 15:11:24,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:24,532 INFO L93 Difference]: Finished difference Result 554 states and 795 transitions. [2024-10-12 15:11:24,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 15:11:24,533 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-12 15:11:24,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:24,536 INFO L225 Difference]: With dead ends: 554 [2024-10-12 15:11:24,536 INFO L226 Difference]: Without dead ends: 547 [2024-10-12 15:11:24,537 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-12 15:11:24,538 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-12 15:11:24,538 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-12 15:11:24,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-10-12 15:11:24,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 541. [2024-10-12 15:11:24,554 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-12 15:11:24,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 779 transitions. [2024-10-12 15:11:24,558 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 779 transitions. Word has length 37 [2024-10-12 15:11:24,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:24,558 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 779 transitions. [2024-10-12 15:11:24,558 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-12 15:11:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 779 transitions. [2024-10-12 15:11:24,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 15:11:24,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:24,560 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-12 15:11:24,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 15:11:24,560 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:24,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:24,561 INFO L85 PathProgramCache]: Analyzing trace with hash 113810481, now seen corresponding path program 1 times [2024-10-12 15:11:24,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:24,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786628653] [2024-10-12 15:11:24,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:24,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:24,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:24,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:24,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:24,756 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-12 15:11:24,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:24,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786628653] [2024-10-12 15:11:24,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786628653] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:24,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228103277] [2024-10-12 15:11:24,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:24,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:24,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:24,759 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-12 15:11:24,760 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-12 15:11:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:24,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 15:11:24,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:24,841 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-12 15:11:24,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:24,958 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-12 15:11:24,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228103277] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:11:24,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:11:24,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2024-10-12 15:11:24,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486588539] [2024-10-12 15:11:24,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:11:24,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 15:11:24,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:24,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 15:11:24,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-12 15:11:24,961 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-12 15:11:25,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:25,083 INFO L93 Difference]: Finished difference Result 928 states and 1333 transitions. [2024-10-12 15:11:25,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 15:11:25,084 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-12 15:11:25,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:25,087 INFO L225 Difference]: With dead ends: 928 [2024-10-12 15:11:25,087 INFO L226 Difference]: Without dead ends: 592 [2024-10-12 15:11:25,089 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-12 15:11:25,089 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-12 15:11:25,089 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-12 15:11:25,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-10-12 15:11:25,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 570. [2024-10-12 15:11:25,105 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-12 15:11:25,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 819 transitions. [2024-10-12 15:11:25,108 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 819 transitions. Word has length 38 [2024-10-12 15:11:25,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:25,108 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 819 transitions. [2024-10-12 15:11:25,109 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-12 15:11:25,109 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 819 transitions. [2024-10-12 15:11:25,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 15:11:25,110 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:25,110 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-12 15:11:25,129 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-12 15:11:25,314 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-12 15:11:25,315 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:25,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:25,315 INFO L85 PathProgramCache]: Analyzing trace with hash 2124788580, now seen corresponding path program 1 times [2024-10-12 15:11:25,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:25,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93831183] [2024-10-12 15:11:25,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:25,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:25,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:25,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:25,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:25,368 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-12 15:11:25,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:25,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93831183] [2024-10-12 15:11:25,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93831183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:25,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:25,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 15:11:25,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928105582] [2024-10-12 15:11:25,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:25,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:11:25,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:25,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:11:25,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:11:25,371 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-12 15:11:25,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:25,400 INFO L93 Difference]: Finished difference Result 604 states and 864 transitions. [2024-10-12 15:11:25,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:11:25,401 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-12 15:11:25,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:25,404 INFO L225 Difference]: With dead ends: 604 [2024-10-12 15:11:25,404 INFO L226 Difference]: Without dead ends: 547 [2024-10-12 15:11:25,404 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-12 15:11:25,405 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-12 15:11:25,405 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-12 15:11:25,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-10-12 15:11:25,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 445. [2024-10-12 15:11:25,426 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-12 15:11:25,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 629 transitions. [2024-10-12 15:11:25,429 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 629 transitions. Word has length 40 [2024-10-12 15:11:25,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:25,429 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 629 transitions. [2024-10-12 15:11:25,429 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-12 15:11:25,430 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 629 transitions. [2024-10-12 15:11:25,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 15:11:25,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:25,431 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-12 15:11:25,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 15:11:25,431 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:25,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:25,432 INFO L85 PathProgramCache]: Analyzing trace with hash 717424053, now seen corresponding path program 1 times [2024-10-12 15:11:25,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:25,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118118076] [2024-10-12 15:11:25,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:25,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:25,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:25,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:25,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:25,570 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-12 15:11:25,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:25,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118118076] [2024-10-12 15:11:25,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118118076] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:25,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404084442] [2024-10-12 15:11:25,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:25,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:25,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:25,573 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-12 15:11:25,574 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-12 15:11:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:25,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-12 15:11:25,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:25,742 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-12 15:11:25,742 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:25,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404084442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:25,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:11:25,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2024-10-12 15:11:25,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094770547] [2024-10-12 15:11:25,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:25,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 15:11:25,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:25,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 15:11:25,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-10-12 15:11:25,744 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-12 15:11:25,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:25,899 INFO L93 Difference]: Finished difference Result 589 states and 833 transitions. [2024-10-12 15:11:25,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 15:11:25,900 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-12 15:11:25,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:25,903 INFO L225 Difference]: With dead ends: 589 [2024-10-12 15:11:25,903 INFO L226 Difference]: Without dead ends: 477 [2024-10-12 15:11:25,903 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-12 15:11:25,904 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-12 15:11:25,904 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-12 15:11:25,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-10-12 15:11:25,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 469. [2024-10-12 15:11:25,916 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-12 15:11:25,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 657 transitions. [2024-10-12 15:11:25,919 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 657 transitions. Word has length 40 [2024-10-12 15:11:25,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:25,919 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 657 transitions. [2024-10-12 15:11:25,919 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-12 15:11:25,919 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 657 transitions. [2024-10-12 15:11:25,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 15:11:25,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:25,921 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-12 15:11:25,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 15:11:26,124 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-12 15:11:26,125 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:26,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:26,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1110451063, now seen corresponding path program 1 times [2024-10-12 15:11:26,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:26,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30956128] [2024-10-12 15:11:26,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:26,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:26,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:26,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:26,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:26,272 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-12 15:11:26,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:26,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30956128] [2024-10-12 15:11:26,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30956128] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:26,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673945169] [2024-10-12 15:11:26,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:26,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:26,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:26,275 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-12 15:11:26,277 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-12 15:11:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:26,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 15:11:26,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:26,468 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-12 15:11:26,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:26,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673945169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:26,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:11:26,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2024-10-12 15:11:26,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475895567] [2024-10-12 15:11:26,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:26,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 15:11:26,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:26,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 15:11:26,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-10-12 15:11:26,470 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-12 15:11:26,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:26,675 INFO L93 Difference]: Finished difference Result 685 states and 965 transitions. [2024-10-12 15:11:26,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 15:11:26,676 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-12 15:11:26,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:26,679 INFO L225 Difference]: With dead ends: 685 [2024-10-12 15:11:26,679 INFO L226 Difference]: Without dead ends: 557 [2024-10-12 15:11:26,680 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-12 15:11:26,680 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-12 15:11:26,680 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-12 15:11:26,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-10-12 15:11:26,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 469. [2024-10-12 15:11:26,697 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-12 15:11:26,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 653 transitions. [2024-10-12 15:11:26,699 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 653 transitions. Word has length 40 [2024-10-12 15:11:26,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:26,700 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 653 transitions. [2024-10-12 15:11:26,700 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-12 15:11:26,700 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 653 transitions. [2024-10-12 15:11:26,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-12 15:11:26,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:26,701 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-12 15:11:26,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 15:11:26,902 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-12 15:11:26,902 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:26,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:26,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1869285858, now seen corresponding path program 1 times [2024-10-12 15:11:26,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:26,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393075234] [2024-10-12 15:11:26,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:26,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:26,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:26,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:26,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:26,978 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-12 15:11:26,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:26,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393075234] [2024-10-12 15:11:26,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393075234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:26,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:26,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 15:11:26,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241754680] [2024-10-12 15:11:26,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:26,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 15:11:26,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:26,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 15:11:26,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:11:26,981 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-12 15:11:27,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:27,109 INFO L93 Difference]: Finished difference Result 548 states and 760 transitions. [2024-10-12 15:11:27,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 15:11:27,109 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-12 15:11:27,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:27,112 INFO L225 Difference]: With dead ends: 548 [2024-10-12 15:11:27,112 INFO L226 Difference]: Without dead ends: 535 [2024-10-12 15:11:27,113 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-12 15:11:27,113 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-12 15:11:27,113 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-12 15:11:27,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-12 15:11:27,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 524. [2024-10-12 15:11:27,126 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-12 15:11:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 727 transitions. [2024-10-12 15:11:27,129 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 727 transitions. Word has length 41 [2024-10-12 15:11:27,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:27,129 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 727 transitions. [2024-10-12 15:11:27,129 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-12 15:11:27,129 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 727 transitions. [2024-10-12 15:11:27,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-12 15:11:27,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:27,131 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-12 15:11:27,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 15:11:27,131 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:27,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:27,131 INFO L85 PathProgramCache]: Analyzing trace with hash -2139996302, now seen corresponding path program 1 times [2024-10-12 15:11:27,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:27,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808104620] [2024-10-12 15:11:27,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:27,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:27,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:27,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:27,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:27,287 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-12 15:11:27,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:27,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808104620] [2024-10-12 15:11:27,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808104620] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:27,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896090198] [2024-10-12 15:11:27,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:27,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:27,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:27,290 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-12 15:11:27,291 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-12 15:11:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:27,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-12 15:11:27,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:27,468 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-12 15:11:27,469 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:27,800 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-12 15:11:27,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896090198] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:11:27,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:11:27,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 12] total 23 [2024-10-12 15:11:27,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133250387] [2024-10-12 15:11:27,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:11:27,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-12 15:11:27,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:27,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-12 15:11:27,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2024-10-12 15:11:27,803 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-12 15:11:28,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:28,320 INFO L93 Difference]: Finished difference Result 1292 states and 1805 transitions. [2024-10-12 15:11:28,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 15:11:28,321 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-12 15:11:28,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:28,325 INFO L225 Difference]: With dead ends: 1292 [2024-10-12 15:11:28,325 INFO L226 Difference]: Without dead ends: 898 [2024-10-12 15:11:28,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2024-10-12 15:11:28,328 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 388 mSDsluCounter, 1699 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-12 15:11:28,328 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-12 15:11:28,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-10-12 15:11:28,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 694. [2024-10-12 15:11:28,350 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-12 15:11:28,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 962 transitions. [2024-10-12 15:11:28,353 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 962 transitions. Word has length 42 [2024-10-12 15:11:28,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:28,354 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 962 transitions. [2024-10-12 15:11:28,354 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-12 15:11:28,354 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 962 transitions. [2024-10-12 15:11:28,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-12 15:11:28,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:28,356 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-12 15:11:28,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-12 15:11:28,556 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-12 15:11:28,557 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:28,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:28,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1492698540, now seen corresponding path program 1 times [2024-10-12 15:11:28,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:28,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262722171] [2024-10-12 15:11:28,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:28,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:28,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:28,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:28,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:28,695 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-12 15:11:28,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:28,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262722171] [2024-10-12 15:11:28,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262722171] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:28,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54476888] [2024-10-12 15:11:28,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:28,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:28,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:28,698 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-12 15:11:28,699 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-12 15:11:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:28,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 15:11:28,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:28,790 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-12 15:11:28,790 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:28,903 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-12 15:11:28,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54476888] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:11:28,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:11:28,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-10-12 15:11:28,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726352717] [2024-10-12 15:11:28,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:11:28,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 15:11:28,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:28,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 15:11:28,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-12 15:11:28,906 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-12 15:11:29,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:29,066 INFO L93 Difference]: Finished difference Result 775 states and 1057 transitions. [2024-10-12 15:11:29,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 15:11:29,066 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-12 15:11:29,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:29,069 INFO L225 Difference]: With dead ends: 775 [2024-10-12 15:11:29,069 INFO L226 Difference]: Without dead ends: 612 [2024-10-12 15:11:29,070 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-12 15:11:29,070 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-12 15:11:29,071 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-12 15:11:29,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-10-12 15:11:29,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 586. [2024-10-12 15:11:29,085 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-12 15:11:29,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 803 transitions. [2024-10-12 15:11:29,088 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 803 transitions. Word has length 42 [2024-10-12 15:11:29,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:29,088 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 803 transitions. [2024-10-12 15:11:29,089 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-12 15:11:29,089 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 803 transitions. [2024-10-12 15:11:29,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-12 15:11:29,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:29,090 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-12 15:11:29,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-12 15:11:29,294 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-12 15:11:29,295 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:29,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:29,295 INFO L85 PathProgramCache]: Analyzing trace with hash 794362524, now seen corresponding path program 1 times [2024-10-12 15:11:29,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:29,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36360066] [2024-10-12 15:11:29,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:29,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:29,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:29,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:29,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:29,430 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-12 15:11:29,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:29,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36360066] [2024-10-12 15:11:29,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36360066] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:29,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873858734] [2024-10-12 15:11:29,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:29,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:29,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:29,433 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-12 15:11:29,435 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-12 15:11:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:29,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-12 15:11:29,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:29,552 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-12 15:11:29,553 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:29,622 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-12 15:11:29,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873858734] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:29,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-12 15:11:29,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 10] total 13 [2024-10-12 15:11:29,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687103899] [2024-10-12 15:11:29,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:29,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 15:11:29,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:29,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 15:11:29,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-12 15:11:29,627 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-12 15:11:29,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:29,739 INFO L93 Difference]: Finished difference Result 954 states and 1321 transitions. [2024-10-12 15:11:29,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 15:11:29,740 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-12 15:11:29,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:29,744 INFO L225 Difference]: With dead ends: 954 [2024-10-12 15:11:29,744 INFO L226 Difference]: Without dead ends: 906 [2024-10-12 15:11:29,745 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-12 15:11:29,745 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-12 15:11:29,745 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-12 15:11:29,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2024-10-12 15:11:29,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 776. [2024-10-12 15:11:29,769 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-12 15:11:29,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1051 transitions. [2024-10-12 15:11:29,773 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1051 transitions. Word has length 43 [2024-10-12 15:11:29,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:29,773 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1051 transitions. [2024-10-12 15:11:29,773 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-12 15:11:29,773 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1051 transitions. [2024-10-12 15:11:29,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-12 15:11:29,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:29,775 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-12 15:11:29,791 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-12 15:11:29,978 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-12 15:11:29,979 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:29,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:29,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1495427102, now seen corresponding path program 1 times [2024-10-12 15:11:29,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:29,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073057927] [2024-10-12 15:11:29,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:29,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:30,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:30,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:30,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:30,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-12 15:11:30,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:30,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073057927] [2024-10-12 15:11:30,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073057927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:30,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:30,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 15:11:30,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241683107] [2024-10-12 15:11:30,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:30,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:11:30,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:30,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:11:30,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:11:30,026 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-12 15:11:30,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:30,053 INFO L93 Difference]: Finished difference Result 798 states and 1075 transitions. [2024-10-12 15:11:30,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:11:30,053 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-12 15:11:30,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:30,056 INFO L225 Difference]: With dead ends: 798 [2024-10-12 15:11:30,056 INFO L226 Difference]: Without dead ends: 732 [2024-10-12 15:11:30,057 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-12 15:11:30,058 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-12 15:11:30,058 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-12 15:11:30,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-10-12 15:11:30,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 715. [2024-10-12 15:11:30,078 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-12 15:11:30,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 972 transitions. [2024-10-12 15:11:30,082 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 972 transitions. Word has length 43 [2024-10-12 15:11:30,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:30,082 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 972 transitions. [2024-10-12 15:11:30,082 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-12 15:11:30,082 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 972 transitions. [2024-10-12 15:11:30,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-12 15:11:30,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:30,084 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-12 15:11:30,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 15:11:30,084 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:30,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:30,085 INFO L85 PathProgramCache]: Analyzing trace with hash -377347303, now seen corresponding path program 1 times [2024-10-12 15:11:30,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:30,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888185867] [2024-10-12 15:11:30,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:30,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:30,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:30,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:30,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 15:11:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:30,240 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-12 15:11:30,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:30,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888185867] [2024-10-12 15:11:30,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888185867] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:30,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978609346] [2024-10-12 15:11:30,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:30,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:30,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:30,243 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-12 15:11:30,244 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-12 15:11:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:30,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-12 15:11:30,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:30,423 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-12 15:11:30,423 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:30,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978609346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:30,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:11:30,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 13 [2024-10-12 15:11:30,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370153021] [2024-10-12 15:11:30,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:30,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 15:11:30,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:30,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 15:11:30,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-12 15:11:30,425 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-12 15:11:30,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:30,839 INFO L93 Difference]: Finished difference Result 1562 states and 2142 transitions. [2024-10-12 15:11:30,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 15:11:30,840 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-12 15:11:30,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:30,844 INFO L225 Difference]: With dead ends: 1562 [2024-10-12 15:11:30,844 INFO L226 Difference]: Without dead ends: 1070 [2024-10-12 15:11:30,846 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-12 15:11:30,846 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 205 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:30,847 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.3s Time] [2024-10-12 15:11:30,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2024-10-12 15:11:30,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 954. [2024-10-12 15:11:30,875 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-12 15:11:30,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1291 transitions. [2024-10-12 15:11:30,879 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1291 transitions. Word has length 44 [2024-10-12 15:11:30,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:30,880 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1291 transitions. [2024-10-12 15:11:30,880 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-12 15:11:30,880 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1291 transitions. [2024-10-12 15:11:30,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-12 15:11:30,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:30,882 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-12 15:11:30,899 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-12 15:11:31,082 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-12 15:11:31,083 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:31,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:31,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1420221009, now seen corresponding path program 1 times [2024-10-12 15:11:31,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:31,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11704907] [2024-10-12 15:11:31,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:31,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:31,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:31,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:31,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:31,248 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-12 15:11:31,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:31,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11704907] [2024-10-12 15:11:31,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11704907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:31,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:31,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 15:11:31,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651316872] [2024-10-12 15:11:31,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:31,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 15:11:31,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:31,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 15:11:31,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:11:31,250 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-12 15:11:31,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:31,480 INFO L93 Difference]: Finished difference Result 1211 states and 1657 transitions. [2024-10-12 15:11:31,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 15:11:31,481 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-12 15:11:31,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:31,486 INFO L225 Difference]: With dead ends: 1211 [2024-10-12 15:11:31,486 INFO L226 Difference]: Without dead ends: 1191 [2024-10-12 15:11:31,488 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-12 15:11:31,489 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.2s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:31,489 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.2s Time] [2024-10-12 15:11:31,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2024-10-12 15:11:31,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1034. [2024-10-12 15:11:31,533 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-12 15:11:31,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1393 transitions. [2024-10-12 15:11:31,537 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1393 transitions. Word has length 45 [2024-10-12 15:11:31,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:31,538 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1393 transitions. [2024-10-12 15:11:31,538 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-12 15:11:31,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1393 transitions. [2024-10-12 15:11:31,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 15:11:31,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:31,540 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-12 15:11:31,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 15:11:31,540 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:31,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:31,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1252728667, now seen corresponding path program 1 times [2024-10-12 15:11:31,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:31,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739501128] [2024-10-12 15:11:31,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:31,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:31,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:31,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:31,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 15:11:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:31,735 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-12 15:11:31,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:31,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739501128] [2024-10-12 15:11:31,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739501128] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:31,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070643473] [2024-10-12 15:11:31,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:31,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:31,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:31,738 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-12 15:11:31,739 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-12 15:11:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:31,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-12 15:11:31,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:31,967 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-12 15:11:31,968 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:31,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070643473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:31,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:11:31,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 15 [2024-10-12 15:11:31,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390293160] [2024-10-12 15:11:31,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:31,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 15:11:31,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:31,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 15:11:31,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-12 15:11:31,970 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-12 15:11:32,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:32,351 INFO L93 Difference]: Finished difference Result 1136 states and 1522 transitions. [2024-10-12 15:11:32,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 15:11:32,351 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-12 15:11:32,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:32,355 INFO L225 Difference]: With dead ends: 1136 [2024-10-12 15:11:32,355 INFO L226 Difference]: Without dead ends: 1134 [2024-10-12 15:11:32,356 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-12 15:11:32,356 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.3s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:32,357 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.3s Time] [2024-10-12 15:11:32,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2024-10-12 15:11:32,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1042. [2024-10-12 15:11:32,390 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-12 15:11:32,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1401 transitions. [2024-10-12 15:11:32,394 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1401 transitions. Word has length 46 [2024-10-12 15:11:32,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:32,395 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1401 transitions. [2024-10-12 15:11:32,395 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-12 15:11:32,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1401 transitions. [2024-10-12 15:11:32,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-12 15:11:32,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:32,400 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-12 15:11:32,416 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-12 15:11:32,604 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-12 15:11:32,605 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:32,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:32,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1469021491, now seen corresponding path program 1 times [2024-10-12 15:11:32,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:32,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032292949] [2024-10-12 15:11:32,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:32,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:32,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:32,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:32,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:32,652 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-12 15:11:32,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:32,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032292949] [2024-10-12 15:11:32,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032292949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:32,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:32,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 15:11:32,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670475458] [2024-10-12 15:11:32,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:32,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:11:32,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:32,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:11:32,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:11:32,655 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-12 15:11:32,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:32,690 INFO L93 Difference]: Finished difference Result 1051 states and 1409 transitions. [2024-10-12 15:11:32,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:11:32,691 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-12 15:11:32,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:32,695 INFO L225 Difference]: With dead ends: 1051 [2024-10-12 15:11:32,696 INFO L226 Difference]: Without dead ends: 1005 [2024-10-12 15:11:32,697 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-12 15:11:32,698 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-12 15:11:32,698 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-12 15:11:32,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2024-10-12 15:11:32,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 934. [2024-10-12 15:11:32,729 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-12 15:11:32,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1266 transitions. [2024-10-12 15:11:32,739 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1266 transitions. Word has length 47 [2024-10-12 15:11:32,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:32,739 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1266 transitions. [2024-10-12 15:11:32,740 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-12 15:11:32,740 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1266 transitions. [2024-10-12 15:11:32,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-12 15:11:32,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:32,742 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-12 15:11:32,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 15:11:32,742 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:32,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:32,742 INFO L85 PathProgramCache]: Analyzing trace with hash -419675748, now seen corresponding path program 1 times [2024-10-12 15:11:32,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:32,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3254630] [2024-10-12 15:11:32,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:32,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:32,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:32,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:32,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 15:11:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:32,779 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-12 15:11:32,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:32,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3254630] [2024-10-12 15:11:32,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3254630] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:32,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573953336] [2024-10-12 15:11:32,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:32,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:32,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:32,781 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-12 15:11:32,782 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-12 15:11:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:32,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:11:32,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:32,859 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-12 15:11:32,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:32,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573953336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:32,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:11:32,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-10-12 15:11:32,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102600361] [2024-10-12 15:11:32,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:32,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:32,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:32,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:32,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:11:32,861 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-12 15:11:32,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:32,919 INFO L93 Difference]: Finished difference Result 1865 states and 2532 transitions. [2024-10-12 15:11:32,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:32,919 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-12 15:11:32,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:32,923 INFO L225 Difference]: With dead ends: 1865 [2024-10-12 15:11:32,923 INFO L226 Difference]: Without dead ends: 939 [2024-10-12 15:11:32,925 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-12 15:11:32,925 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-12 15:11:32,926 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-12 15:11:32,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2024-10-12 15:11:32,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 937. [2024-10-12 15:11:32,954 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-12 15:11:32,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1270 transitions. [2024-10-12 15:11:32,960 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1270 transitions. Word has length 47 [2024-10-12 15:11:32,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:32,960 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1270 transitions. [2024-10-12 15:11:32,960 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-12 15:11:32,962 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1270 transitions. [2024-10-12 15:11:32,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-12 15:11:32,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:32,964 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-12 15:11:32,981 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-12 15:11:33,168 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-12 15:11:33,169 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:33,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:33,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1415483536, now seen corresponding path program 1 times [2024-10-12 15:11:33,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:33,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460694530] [2024-10-12 15:11:33,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:33,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:33,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:33,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:33,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 15:11:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:33,213 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-12 15:11:33,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:33,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460694530] [2024-10-12 15:11:33,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460694530] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:33,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179169129] [2024-10-12 15:11:33,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:33,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:33,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:33,215 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-12 15:11:33,216 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-12 15:11:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:33,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:11:33,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:33,286 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-12 15:11:33,286 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:33,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179169129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:33,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:11:33,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-10-12 15:11:33,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721359777] [2024-10-12 15:11:33,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:33,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:33,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:33,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:33,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:33,287 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-12 15:11:33,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:33,353 INFO L93 Difference]: Finished difference Result 1871 states and 2542 transitions. [2024-10-12 15:11:33,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:33,354 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-12 15:11:33,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:33,357 INFO L225 Difference]: With dead ends: 1871 [2024-10-12 15:11:33,358 INFO L226 Difference]: Without dead ends: 942 [2024-10-12 15:11:33,359 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-12 15:11:33,360 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-12 15:11:33,361 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-12 15:11:33,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2024-10-12 15:11:33,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 939. [2024-10-12 15:11:33,389 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-12 15:11:33,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1272 transitions. [2024-10-12 15:11:33,392 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1272 transitions. Word has length 48 [2024-10-12 15:11:33,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:33,392 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1272 transitions. [2024-10-12 15:11:33,392 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-12 15:11:33,393 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1272 transitions. [2024-10-12 15:11:33,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 15:11:33,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:33,394 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-12 15:11:33,412 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-12 15:11:33,595 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-12 15:11:33,595 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:33,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:33,596 INFO L85 PathProgramCache]: Analyzing trace with hash 855722105, now seen corresponding path program 1 times [2024-10-12 15:11:33,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:33,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977460434] [2024-10-12 15:11:33,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:33,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:33,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:33,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:33,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:33,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 15:11:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:33,966 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-12 15:11:33,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:33,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977460434] [2024-10-12 15:11:33,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977460434] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:33,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891764739] [2024-10-12 15:11:33,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:33,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:33,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:33,971 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-12 15:11:33,972 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-12 15:11:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:34,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-12 15:11:34,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:34,187 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-12 15:11:34,188 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:34,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891764739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:34,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:11:34,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2024-10-12 15:11:34,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746856500] [2024-10-12 15:11:34,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:34,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 15:11:34,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:34,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 15:11:34,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2024-10-12 15:11:34,189 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-12 15:11:34,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:34,496 INFO L93 Difference]: Finished difference Result 1200 states and 1616 transitions. [2024-10-12 15:11:34,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 15:11:34,496 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-12 15:11:34,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:34,500 INFO L225 Difference]: With dead ends: 1200 [2024-10-12 15:11:34,501 INFO L226 Difference]: Without dead ends: 1132 [2024-10-12 15:11:34,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2024-10-12 15:11:34,502 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 146 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-12 15:11:34,505 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-12 15:11:34,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2024-10-12 15:11:34,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 983. [2024-10-12 15:11:34,541 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-12 15:11:34,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1319 transitions. [2024-10-12 15:11:34,545 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1319 transitions. Word has length 49 [2024-10-12 15:11:34,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:34,545 INFO L471 AbstractCegarLoop]: Abstraction has 983 states and 1319 transitions. [2024-10-12 15:11:34,545 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-12 15:11:34,545 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1319 transitions. [2024-10-12 15:11:34,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 15:11:34,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:34,547 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-12 15:11:34,564 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-12 15:11:34,751 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-12 15:11:34,752 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:34,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:34,752 INFO L85 PathProgramCache]: Analyzing trace with hash 496994524, now seen corresponding path program 1 times [2024-10-12 15:11:34,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:34,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447880029] [2024-10-12 15:11:34,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:34,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:34,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:34,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:34,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 15:11:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:34,991 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-12 15:11:34,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:34,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447880029] [2024-10-12 15:11:34,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447880029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:34,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:34,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 15:11:34,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401596225] [2024-10-12 15:11:34,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:34,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 15:11:34,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:34,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 15:11:34,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:11:34,993 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-12 15:11:35,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:35,089 INFO L93 Difference]: Finished difference Result 989 states and 1324 transitions. [2024-10-12 15:11:35,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 15:11:35,090 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-12 15:11:35,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:35,095 INFO L225 Difference]: With dead ends: 989 [2024-10-12 15:11:35,095 INFO L226 Difference]: Without dead ends: 987 [2024-10-12 15:11:35,096 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-12 15:11:35,097 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.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:35,098 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.1s Time] [2024-10-12 15:11:35,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2024-10-12 15:11:35,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 987. [2024-10-12 15:11:35,150 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-12 15:11:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1322 transitions. [2024-10-12 15:11:35,155 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1322 transitions. Word has length 49 [2024-10-12 15:11:35,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:35,155 INFO L471 AbstractCegarLoop]: Abstraction has 987 states and 1322 transitions. [2024-10-12 15:11:35,156 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-12 15:11:35,156 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1322 transitions. [2024-10-12 15:11:35,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 15:11:35,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:35,158 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-12 15:11:35,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 15:11:35,159 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:35,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:35,160 INFO L85 PathProgramCache]: Analyzing trace with hash 794453919, now seen corresponding path program 1 times [2024-10-12 15:11:35,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:35,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500162697] [2024-10-12 15:11:35,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:35,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:35,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:35,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:35,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 15:11:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:35,264 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-12 15:11:35,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:35,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500162697] [2024-10-12 15:11:35,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500162697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:35,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:35,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 15:11:35,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359810673] [2024-10-12 15:11:35,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:35,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 15:11:35,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:35,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 15:11:35,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:11:35,267 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-12 15:11:35,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:35,339 INFO L93 Difference]: Finished difference Result 1024 states and 1362 transitions. [2024-10-12 15:11:35,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 15:11:35,339 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-12 15:11:35,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:35,343 INFO L225 Difference]: With dead ends: 1024 [2024-10-12 15:11:35,343 INFO L226 Difference]: Without dead ends: 1022 [2024-10-12 15:11:35,344 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-12 15:11:35,344 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-12 15:11:35,345 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-12 15:11:35,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2024-10-12 15:11:35,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 993. [2024-10-12 15:11:35,383 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-12 15:11:35,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1328 transitions. [2024-10-12 15:11:35,387 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1328 transitions. Word has length 51 [2024-10-12 15:11:35,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:35,387 INFO L471 AbstractCegarLoop]: Abstraction has 993 states and 1328 transitions. [2024-10-12 15:11:35,387 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-12 15:11:35,388 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1328 transitions. [2024-10-12 15:11:35,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 15:11:35,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:35,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, 1, 1] [2024-10-12 15:11:35,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 15:11:35,390 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:35,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:35,390 INFO L85 PathProgramCache]: Analyzing trace with hash 851712221, now seen corresponding path program 1 times [2024-10-12 15:11:35,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:35,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324778625] [2024-10-12 15:11:35,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:35,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:35,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:35,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:35,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 15:11:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:35,481 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-12 15:11:35,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:35,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324778625] [2024-10-12 15:11:35,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324778625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:35,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:35,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 15:11:35,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133161109] [2024-10-12 15:11:35,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:35,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 15:11:35,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:35,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 15:11:35,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:11:35,483 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-12 15:11:35,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:35,549 INFO L93 Difference]: Finished difference Result 1032 states and 1374 transitions. [2024-10-12 15:11:35,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 15:11:35,549 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-12 15:11:35,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:35,553 INFO L225 Difference]: With dead ends: 1032 [2024-10-12 15:11:35,553 INFO L226 Difference]: Without dead ends: 1030 [2024-10-12 15:11:35,554 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-12 15:11:35,555 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 17 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 657 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-12 15:11:35,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 657 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:11:35,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2024-10-12 15:11:35,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 999. [2024-10-12 15:11:35,593 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-12 15:11:35,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1335 transitions. [2024-10-12 15:11:35,601 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1335 transitions. Word has length 51 [2024-10-12 15:11:35,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:35,601 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1335 transitions. [2024-10-12 15:11:35,601 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-12 15:11:35,602 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1335 transitions. [2024-10-12 15:11:35,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 15:11:35,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:35,604 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-12 15:11:35,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-12 15:11:35,604 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:35,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:35,605 INFO L85 PathProgramCache]: Analyzing trace with hash -605018731, now seen corresponding path program 1 times [2024-10-12 15:11:35,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:35,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346462459] [2024-10-12 15:11:35,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:35,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:35,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:35,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:35,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:35,757 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-12 15:11:35,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:35,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346462459] [2024-10-12 15:11:35,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346462459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:35,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:35,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 15:11:35,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776632697] [2024-10-12 15:11:35,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:35,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 15:11:35,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:35,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 15:11:35,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:11:35,760 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-12 15:11:35,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:35,978 INFO L93 Difference]: Finished difference Result 1484 states and 1967 transitions. [2024-10-12 15:11:35,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 15:11:35,978 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-12 15:11:35,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:35,983 INFO L225 Difference]: With dead ends: 1484 [2024-10-12 15:11:35,984 INFO L226 Difference]: Without dead ends: 1390 [2024-10-12 15:11:35,985 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-12 15:11:35,986 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 121 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:35,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 700 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 15:11:35,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2024-10-12 15:11:36,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 991. [2024-10-12 15:11:36,023 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-12 15:11:36,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1317 transitions. [2024-10-12 15:11:36,026 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1317 transitions. Word has length 52 [2024-10-12 15:11:36,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:36,027 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1317 transitions. [2024-10-12 15:11:36,027 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-12 15:11:36,027 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1317 transitions. [2024-10-12 15:11:36,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 15:11:36,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:36,029 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-12 15:11:36,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-12 15:11:36,029 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:36,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:36,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1422667181, now seen corresponding path program 1 times [2024-10-12 15:11:36,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:36,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091853308] [2024-10-12 15:11:36,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:36,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:36,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:36,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:36,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:36,538 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-12 15:11:36,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:36,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091853308] [2024-10-12 15:11:36,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091853308] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:36,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151710429] [2024-10-12 15:11:36,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:36,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:36,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:36,541 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-12 15:11:36,543 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-12 15:11:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:36,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-12 15:11:36,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:36,818 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-12 15:11:36,818 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:36,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151710429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:36,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:11:36,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [17] total 25 [2024-10-12 15:11:36,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803134294] [2024-10-12 15:11:36,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:36,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 15:11:36,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:36,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 15:11:36,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2024-10-12 15:11:36,820 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-12 15:11:37,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:37,215 INFO L93 Difference]: Finished difference Result 1439 states and 1920 transitions. [2024-10-12 15:11:37,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 15:11:37,216 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-12 15:11:37,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:37,221 INFO L225 Difference]: With dead ends: 1439 [2024-10-12 15:11:37,221 INFO L226 Difference]: Without dead ends: 1264 [2024-10-12 15:11:37,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2024-10-12 15:11:37,223 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 105 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:37,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1070 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 15:11:37,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2024-10-12 15:11:37,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 955. [2024-10-12 15:11:37,260 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-12 15:11:37,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1267 transitions. [2024-10-12 15:11:37,264 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1267 transitions. Word has length 52 [2024-10-12 15:11:37,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:37,264 INFO L471 AbstractCegarLoop]: Abstraction has 955 states and 1267 transitions. [2024-10-12 15:11:37,264 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-12 15:11:37,264 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1267 transitions. [2024-10-12 15:11:37,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 15:11:37,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:37,266 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-12 15:11:37,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-12 15:11:37,466 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-12 15:11:37,467 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:37,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:37,468 INFO L85 PathProgramCache]: Analyzing trace with hash 502303469, now seen corresponding path program 1 times [2024-10-12 15:11:37,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:37,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586379562] [2024-10-12 15:11:37,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:37,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:37,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:37,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:37,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 15:11:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:37,933 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-12 15:11:37,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:37,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586379562] [2024-10-12 15:11:37,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586379562] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:37,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710801726] [2024-10-12 15:11:37,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:37,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:37,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:37,935 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-12 15:11:37,937 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-12 15:11:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:38,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 15:11:38,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:38,069 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-12 15:11:38,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:38,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710801726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:38,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:11:38,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2024-10-12 15:11:38,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798821834] [2024-10-12 15:11:38,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:38,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 15:11:38,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:38,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 15:11:38,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-10-12 15:11:38,071 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-12 15:11:38,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:38,212 INFO L93 Difference]: Finished difference Result 1159 states and 1533 transitions. [2024-10-12 15:11:38,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 15:11:38,213 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-12 15:11:38,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:38,217 INFO L225 Difference]: With dead ends: 1159 [2024-10-12 15:11:38,217 INFO L226 Difference]: Without dead ends: 1102 [2024-10-12 15:11:38,218 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-12 15:11:38,218 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 133 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 515 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-12 15:11:38,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 515 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:38,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2024-10-12 15:11:38,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 955. [2024-10-12 15:11:38,253 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-12 15:11:38,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1264 transitions. [2024-10-12 15:11:38,257 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1264 transitions. Word has length 54 [2024-10-12 15:11:38,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:38,257 INFO L471 AbstractCegarLoop]: Abstraction has 955 states and 1264 transitions. [2024-10-12 15:11:38,257 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-12 15:11:38,257 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1264 transitions. [2024-10-12 15:11:38,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 15:11:38,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:38,259 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-12 15:11:38,275 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-12 15:11:38,459 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-12 15:11:38,460 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:38,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:38,460 INFO L85 PathProgramCache]: Analyzing trace with hash -433624224, now seen corresponding path program 1 times [2024-10-12 15:11:38,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:38,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088573518] [2024-10-12 15:11:38,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:38,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:38,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:38,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 15:11:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:38,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 15:11:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:38,514 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-12 15:11:38,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:38,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088573518] [2024-10-12 15:11:38,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088573518] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:38,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994712877] [2024-10-12 15:11:38,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:38,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:38,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:38,517 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-12 15:11:38,518 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-12 15:11:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:38,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:11:38,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:38,601 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-12 15:11:38,601 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:38,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994712877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:38,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:11:38,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-12 15:11:38,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819130700] [2024-10-12 15:11:38,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:38,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:11:38,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:38,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:11:38,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:11:38,603 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-12 15:11:38,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:38,677 INFO L93 Difference]: Finished difference Result 1897 states and 2514 transitions. [2024-10-12 15:11:38,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:11:38,678 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-12 15:11:38,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:38,682 INFO L225 Difference]: With dead ends: 1897 [2024-10-12 15:11:38,682 INFO L226 Difference]: Without dead ends: 966 [2024-10-12 15:11:38,684 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-12 15:11:38,685 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-12 15:11:38,685 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-12 15:11:38,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2024-10-12 15:11:38,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 958. [2024-10-12 15:11:38,740 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-12 15:11:38,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1273 transitions. [2024-10-12 15:11:38,743 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1273 transitions. Word has length 54 [2024-10-12 15:11:38,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:38,744 INFO L471 AbstractCegarLoop]: Abstraction has 958 states and 1273 transitions. [2024-10-12 15:11:38,744 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-12 15:11:38,744 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1273 transitions. [2024-10-12 15:11:38,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 15:11:38,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:38,746 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-12 15:11:38,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-12 15:11:38,947 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-12 15:11:38,947 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:38,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:38,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1506645198, now seen corresponding path program 1 times [2024-10-12 15:11:38,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:38,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586036500] [2024-10-12 15:11:38,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:38,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:39,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:39,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:39,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 15:11:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:39,085 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-12 15:11:39,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:39,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586036500] [2024-10-12 15:11:39,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586036500] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:39,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444556294] [2024-10-12 15:11:39,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:39,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:39,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:39,088 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-12 15:11:39,091 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-12 15:11:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:39,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 15:11:39,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:39,199 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-12 15:11:39,199 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:39,318 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-12 15:11:39,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444556294] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:11:39,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:11:39,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 13 [2024-10-12 15:11:39,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503351641] [2024-10-12 15:11:39,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:11:39,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 15:11:39,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:39,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 15:11:39,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-12 15:11:39,320 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-12 15:11:39,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:39,482 INFO L93 Difference]: Finished difference Result 1138 states and 1505 transitions. [2024-10-12 15:11:39,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 15:11:39,483 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-12 15:11:39,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:39,492 INFO L225 Difference]: With dead ends: 1138 [2024-10-12 15:11:39,492 INFO L226 Difference]: Without dead ends: 1119 [2024-10-12 15:11:39,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-12 15:11:39,494 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 80 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:39,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1066 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:39,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2024-10-12 15:11:39,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1064. [2024-10-12 15:11:39,536 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-12 15:11:39,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1410 transitions. [2024-10-12 15:11:39,539 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1410 transitions. Word has length 57 [2024-10-12 15:11:39,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:39,540 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1410 transitions. [2024-10-12 15:11:39,540 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-12 15:11:39,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1410 transitions. [2024-10-12 15:11:39,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 15:11:39,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:39,542 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-12 15:11:39,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-12 15:11:39,743 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-12 15:11:39,743 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:39,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:39,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1741007806, now seen corresponding path program 1 times [2024-10-12 15:11:39,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:39,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828502969] [2024-10-12 15:11:39,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:39,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:39,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:39,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:39,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:39,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 15:11:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:39,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 15:11:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:39,827 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-12 15:11:39,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:39,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828502969] [2024-10-12 15:11:39,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828502969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:39,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:39,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 15:11:39,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725029722] [2024-10-12 15:11:39,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:39,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 15:11:39,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:39,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 15:11:39,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:11:39,830 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-12 15:11:39,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:39,954 INFO L93 Difference]: Finished difference Result 1148 states and 1537 transitions. [2024-10-12 15:11:39,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 15:11:39,955 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-12 15:11:39,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:39,960 INFO L225 Difference]: With dead ends: 1148 [2024-10-12 15:11:39,960 INFO L226 Difference]: Without dead ends: 1143 [2024-10-12 15:11:39,961 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-12 15:11:39,961 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.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:39,962 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.1s Time] [2024-10-12 15:11:39,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2024-10-12 15:11:40,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1119. [2024-10-12 15:11:40,041 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-12 15:11:40,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1506 transitions. [2024-10-12 15:11:40,049 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1506 transitions. Word has length 58 [2024-10-12 15:11:40,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:40,050 INFO L471 AbstractCegarLoop]: Abstraction has 1119 states and 1506 transitions. [2024-10-12 15:11:40,050 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-12 15:11:40,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1506 transitions. [2024-10-12 15:11:40,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 15:11:40,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:40,054 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-12 15:11:40,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-12 15:11:40,055 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:40,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:40,055 INFO L85 PathProgramCache]: Analyzing trace with hash -622087411, now seen corresponding path program 1 times [2024-10-12 15:11:40,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:40,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372188527] [2024-10-12 15:11:40,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:40,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:40,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:40,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 15:11:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:40,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 15:11:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:40,142 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-12 15:11:40,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:40,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372188527] [2024-10-12 15:11:40,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372188527] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:40,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532843005] [2024-10-12 15:11:40,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:40,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:40,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:40,146 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-12 15:11:40,147 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-12 15:11:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:40,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 15:11:40,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:40,242 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-12 15:11:40,242 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:40,315 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-12 15:11:40,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532843005] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:11:40,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:11:40,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-12 15:11:40,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42475044] [2024-10-12 15:11:40,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:11:40,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 15:11:40,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:40,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 15:11:40,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 15:11:40,317 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-12 15:11:40,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:40,462 INFO L93 Difference]: Finished difference Result 2290 states and 3102 transitions. [2024-10-12 15:11:40,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 15:11:40,463 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-12 15:11:40,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:40,467 INFO L225 Difference]: With dead ends: 2290 [2024-10-12 15:11:40,468 INFO L226 Difference]: Without dead ends: 1173 [2024-10-12 15:11:40,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-10-12 15:11:40,470 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 76 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:40,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 557 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:40,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2024-10-12 15:11:40,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1140. [2024-10-12 15:11:40,519 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-12 15:11:40,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1542 transitions. [2024-10-12 15:11:40,522 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1542 transitions. Word has length 57 [2024-10-12 15:11:40,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:40,523 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1542 transitions. [2024-10-12 15:11:40,523 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-12 15:11:40,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1542 transitions. [2024-10-12 15:11:40,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 15:11:40,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:40,527 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-12 15:11:40,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-10-12 15:11:40,727 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-12 15:11:40,728 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:40,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:40,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1180623593, now seen corresponding path program 1 times [2024-10-12 15:11:40,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:40,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570955877] [2024-10-12 15:11:40,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:40,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:40,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:40,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:40,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 15:11:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:40,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 15:11:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:40,943 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-12 15:11:40,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:40,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570955877] [2024-10-12 15:11:40,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570955877] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:40,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005595119] [2024-10-12 15:11:40,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:40,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:40,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:40,947 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-12 15:11:40,949 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-12 15:11:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:41,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 15:11:41,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:41,072 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-12 15:11:41,072 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:41,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005595119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:41,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:11:41,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-10-12 15:11:41,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313383546] [2024-10-12 15:11:41,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:41,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 15:11:41,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:41,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 15:11:41,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-12 15:11:41,075 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-12 15:11:41,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:41,193 INFO L93 Difference]: Finished difference Result 1739 states and 2331 transitions. [2024-10-12 15:11:41,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 15:11:41,194 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-12 15:11:41,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:41,202 INFO L225 Difference]: With dead ends: 1739 [2024-10-12 15:11:41,203 INFO L226 Difference]: Without dead ends: 1510 [2024-10-12 15:11:41,204 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-12 15:11:41,205 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 17 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:41,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 473 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:41,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2024-10-12 15:11:41,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1158. [2024-10-12 15:11:41,253 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-12 15:11:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1560 transitions. [2024-10-12 15:11:41,257 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1560 transitions. Word has length 59 [2024-10-12 15:11:41,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:41,257 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1560 transitions. [2024-10-12 15:11:41,257 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-12 15:11:41,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1560 transitions. [2024-10-12 15:11:41,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 15:11:41,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:41,260 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-12 15:11:41,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-10-12 15:11:41,464 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-12 15:11:41,465 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:41,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:41,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1729934775, now seen corresponding path program 1 times [2024-10-12 15:11:41,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:41,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827327321] [2024-10-12 15:11:41,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:41,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:41,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:41,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:41,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 15:11:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:41,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 15:11:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:41,582 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-12 15:11:41,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:41,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827327321] [2024-10-12 15:11:41,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827327321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:41,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:41,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 15:11:41,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236160048] [2024-10-12 15:11:41,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:41,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 15:11:41,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:41,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 15:11:41,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:11:41,585 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-12 15:11:41,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:41,703 INFO L93 Difference]: Finished difference Result 1224 states and 1651 transitions. [2024-10-12 15:11:41,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 15:11:41,703 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-12 15:11:41,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:41,707 INFO L225 Difference]: With dead ends: 1224 [2024-10-12 15:11:41,707 INFO L226 Difference]: Without dead ends: 1219 [2024-10-12 15:11:41,708 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-12 15:11:41,709 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 8 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12 15:11:41,709 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-12 15:11:41,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2024-10-12 15:11:41,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1157. [2024-10-12 15:11:41,772 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-12 15:11:41,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1558 transitions. [2024-10-12 15:11:41,776 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1558 transitions. Word has length 60 [2024-10-12 15:11:41,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:41,777 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1558 transitions. [2024-10-12 15:11:41,777 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-12 15:11:41,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1558 transitions. [2024-10-12 15:11:41,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 15:11:41,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:41,780 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-12 15:11:41,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-12 15:11:41,780 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:41,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:41,780 INFO L85 PathProgramCache]: Analyzing trace with hash -902694721, now seen corresponding path program 1 times [2024-10-12 15:11:41,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:41,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282947146] [2024-10-12 15:11:41,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:41,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:41,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:41,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:41,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 15:11:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:41,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 15:11:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:41,939 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-12 15:11:41,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:41,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282947146] [2024-10-12 15:11:41,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282947146] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:41,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116437262] [2024-10-12 15:11:41,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:41,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:41,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:41,942 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-12 15:11:41,944 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-12 15:11:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:42,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-12 15:11:42,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:42,098 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-12 15:11:42,098 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:42,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116437262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:42,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:11:42,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 12 [2024-10-12 15:11:42,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074726348] [2024-10-12 15:11:42,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:42,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 15:11:42,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:42,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 15:11:42,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-12 15:11:42,100 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-12 15:11:42,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:42,379 INFO L93 Difference]: Finished difference Result 1407 states and 1876 transitions. [2024-10-12 15:11:42,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 15:11:42,380 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-12 15:11:42,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:42,383 INFO L225 Difference]: With dead ends: 1407 [2024-10-12 15:11:42,383 INFO L226 Difference]: Without dead ends: 1254 [2024-10-12 15:11:42,384 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-12 15:11:42,385 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 123 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:42,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 957 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 15:11:42,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-10-12 15:11:42,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1157. [2024-10-12 15:11:42,435 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-12 15:11:42,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1554 transitions. [2024-10-12 15:11:42,439 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1554 transitions. Word has length 60 [2024-10-12 15:11:42,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:42,439 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1554 transitions. [2024-10-12 15:11:42,440 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-12 15:11:42,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1554 transitions. [2024-10-12 15:11:42,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 15:11:42,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:42,442 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-12 15:11:42,459 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-12 15:11:42,646 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-12 15:11:42,647 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:42,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:42,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1266171930, now seen corresponding path program 1 times [2024-10-12 15:11:42,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:42,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759842996] [2024-10-12 15:11:42,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:42,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:42,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:42,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 15:11:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:42,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 15:11:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:42,817 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-12 15:11:42,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:42,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759842996] [2024-10-12 15:11:42,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759842996] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:42,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447262306] [2024-10-12 15:11:42,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:42,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:42,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:42,819 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-12 15:11:42,821 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-12 15:11:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:42,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 15:11:42,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:42,954 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-12 15:11:42,954 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:42,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447262306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:42,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:11:42,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-10-12 15:11:42,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189216420] [2024-10-12 15:11:42,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:42,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 15:11:42,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:42,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 15:11:42,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-12 15:11:42,956 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-12 15:11:43,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:43,073 INFO L93 Difference]: Finished difference Result 2182 states and 2936 transitions. [2024-10-12 15:11:43,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 15:11:43,074 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-12 15:11:43,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:43,078 INFO L225 Difference]: With dead ends: 2182 [2024-10-12 15:11:43,078 INFO L226 Difference]: Without dead ends: 1163 [2024-10-12 15:11:43,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 15:11:43,082 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 19 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:43,082 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.1s Time] [2024-10-12 15:11:43,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2024-10-12 15:11:43,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1158. [2024-10-12 15:11:43,131 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-12 15:11:43,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1555 transitions. [2024-10-12 15:11:43,135 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1555 transitions. Word has length 59 [2024-10-12 15:11:43,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:43,135 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1555 transitions. [2024-10-12 15:11:43,135 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-12 15:11:43,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1555 transitions. [2024-10-12 15:11:43,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 15:11:43,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:43,138 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-12 15:11:43,155 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-12 15:11:43,338 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-12 15:11:43,338 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:43,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:43,339 INFO L85 PathProgramCache]: Analyzing trace with hash 400855533, now seen corresponding path program 1 times [2024-10-12 15:11:43,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:43,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735529932] [2024-10-12 15:11:43,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:43,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:43,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:43,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 15:11:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:43,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 15:11:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:43,486 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-12 15:11:43,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:43,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735529932] [2024-10-12 15:11:43,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735529932] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:43,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694892085] [2024-10-12 15:11:43,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:43,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:43,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:43,488 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-12 15:11:43,489 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-12 15:11:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:43,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 15:11:43,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:43,584 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-12 15:11:43,585 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:43,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694892085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:43,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:11:43,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-12 15:11:43,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969677332] [2024-10-12 15:11:43,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:43,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:43,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:43,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:43,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:11:43,587 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-12 15:11:43,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:43,662 INFO L93 Difference]: Finished difference Result 2294 states and 3083 transitions. [2024-10-12 15:11:43,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:43,662 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-12 15:11:43,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:43,667 INFO L225 Difference]: With dead ends: 2294 [2024-10-12 15:11:43,669 INFO L226 Difference]: Without dead ends: 1161 [2024-10-12 15:11:43,672 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-12 15:11:43,672 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-12 15:11:43,672 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-12 15:11:43,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2024-10-12 15:11:43,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1157. [2024-10-12 15:11:43,731 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-12 15:11:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1553 transitions. [2024-10-12 15:11:43,735 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1553 transitions. Word has length 59 [2024-10-12 15:11:43,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:43,738 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1553 transitions. [2024-10-12 15:11:43,738 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-12 15:11:43,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1553 transitions. [2024-10-12 15:11:43,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 15:11:43,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:43,741 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-12 15:11:43,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-10-12 15:11:43,941 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-12 15:11:43,942 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:43,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:43,942 INFO L85 PathProgramCache]: Analyzing trace with hash 377707772, now seen corresponding path program 1 times [2024-10-12 15:11:43,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:43,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202940762] [2024-10-12 15:11:43,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:43,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:43,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:44,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 15:11:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:44,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 15:11:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:44,064 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-12 15:11:44,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:44,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202940762] [2024-10-12 15:11:44,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202940762] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:44,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108201823] [2024-10-12 15:11:44,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:44,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:44,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:44,067 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-12 15:11:44,068 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-12 15:11:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:44,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 15:11:44,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:44,202 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-12 15:11:44,203 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:44,313 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-12 15:11:44,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108201823] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:11:44,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:11:44,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 15 [2024-10-12 15:11:44,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690854555] [2024-10-12 15:11:44,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:11:44,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-12 15:11:44,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:44,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-12 15:11:44,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-10-12 15:11:44,316 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-12 15:11:44,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:44,559 INFO L93 Difference]: Finished difference Result 2296 states and 3087 transitions. [2024-10-12 15:11:44,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 15:11:44,560 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-12 15:11:44,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:44,566 INFO L225 Difference]: With dead ends: 2296 [2024-10-12 15:11:44,567 INFO L226 Difference]: Without dead ends: 1161 [2024-10-12 15:11:44,569 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-12 15:11:44,571 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 35 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:44,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1208 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 15:11:44,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2024-10-12 15:11:44,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1150. [2024-10-12 15:11:44,621 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-12 15:11:44,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1544 transitions. [2024-10-12 15:11:44,624 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1544 transitions. Word has length 60 [2024-10-12 15:11:44,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:44,625 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1544 transitions. [2024-10-12 15:11:44,625 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-12 15:11:44,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1544 transitions. [2024-10-12 15:11:44,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 15:11:44,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:44,628 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-12 15:11:44,645 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-12 15:11:44,831 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-12 15:11:44,832 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:44,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:44,832 INFO L85 PathProgramCache]: Analyzing trace with hash -333583012, now seen corresponding path program 1 times [2024-10-12 15:11:44,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:44,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339138364] [2024-10-12 15:11:44,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:44,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 15:11:44,865 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 15:11:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 15:11:44,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 15:11:44,931 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 15:11:44,932 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:11:44,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-12 15:11:44,948 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-12 15:11:45,001 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:11:45,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:11:45 BoogieIcfgContainer [2024-10-12 15:11:45,003 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:11:45,004 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:11:45,004 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:11:45,004 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:11:45,005 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:11:21" (3/4) ... [2024-10-12 15:11:45,006 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 15:11:45,007 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:11:45,008 INFO L158 Benchmark]: Toolchain (without parser) took 24429.28ms. Allocated memory was 159.4MB in the beginning and 373.3MB in the end (delta: 213.9MB). Free memory was 103.4MB in the beginning and 148.1MB in the end (delta: -44.7MB). Peak memory consumption was 170.8MB. Max. memory is 16.1GB. [2024-10-12 15:11:45,008 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 159.4MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:11:45,008 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.74ms. Allocated memory is still 159.4MB. Free memory was 103.4MB in the beginning and 87.7MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 15:11:45,008 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.61ms. Allocated memory is still 159.4MB. Free memory was 87.3MB in the beginning and 85.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 15:11:45,009 INFO L158 Benchmark]: Boogie Preprocessor took 63.41ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 82.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 15:11:45,009 INFO L158 Benchmark]: RCFGBuilder took 695.56ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 82.8MB in the beginning and 181.4MB in the end (delta: -98.6MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2024-10-12 15:11:45,009 INFO L158 Benchmark]: TraceAbstraction took 23205.18ms. Allocated memory was 213.9MB in the beginning and 373.3MB in the end (delta: 159.4MB). Free memory was 180.3MB in the beginning and 149.2MB in the end (delta: 31.2MB). Peak memory consumption was 191.6MB. Max. memory is 16.1GB. [2024-10-12 15:11:45,009 INFO L158 Benchmark]: Witness Printer took 3.69ms. Allocated memory is still 373.3MB. Free memory is still 148.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:11:45,010 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.29ms. Allocated memory is still 159.4MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.74ms. Allocated memory is still 159.4MB. Free memory was 103.4MB in the beginning and 87.7MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.61ms. Allocated memory is still 159.4MB. Free memory was 87.3MB in the beginning and 85.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.41ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 82.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 695.56ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 82.8MB in the beginning and 181.4MB in the end (delta: -98.6MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * TraceAbstraction took 23205.18ms. Allocated memory was 213.9MB in the beginning and 373.3MB in the end (delta: 159.4MB). Free memory was 180.3MB in the beginning and 149.2MB in the end (delta: 31.2MB). Peak memory consumption was 191.6MB. Max. memory is 16.1GB. * Witness Printer took 3.69ms. Allocated memory is still 373.3MB. Free memory is still 148.1MB. 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: 23.1s, OverallIterations: 42, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2531 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2428 mSDsluCounter, 27938 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22331 mSDsCounter, 149 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5287 IncrementalHoareTripleChecker+Invalid, 5436 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 149 mSolverCounterUnsat, 5607 mSDtfsCounter, 5287 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1995 GetRequests, 1644 SyntacticMatches, 4 SemanticMatches, 347 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 3.0s 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.5s AutomataMinimizationTime, 41 MinimizatonAttempts, 2867 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 3049 NumberOfCodeBlocks, 3049 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 3256 ConstructedInterpolants, 0 QuantifiedInterpolants, 6732 SizeOfPredicates, 31 NumberOfNonLiveVariables, 3364 ConjunctsInSsa, 301 ConjunctsInUnsatCore, 70 InterpolantComputations, 35 PerfectInterpolantSequences, 900/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-12 15:11:45,038 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-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:11:47,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:11:47,473 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-12 15:11:47,480 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:11:47,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:11:47,510 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:11:47,511 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:11:47,511 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:11:47,512 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:11:47,512 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:11:47,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:11:47,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:11:47,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:11:47,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:11:47,518 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:11:47,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:11:47,519 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:11:47,519 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:11:47,519 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:11:47,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:11:47,521 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:11:47,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:11:47,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:11:47,522 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 15:11:47,525 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 15:11:47,525 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:11:47,525 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 15:11:47,525 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:11:47,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:11:47,526 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:11:47,526 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:11:47,526 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:11:47,527 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:11:47,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:11:47,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:11:47,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:11:47,528 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:11:47,528 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:11:47,529 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 15:11:47,530 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 15:11:47,530 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:11:47,530 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:11:47,531 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:11:47,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:11:47,531 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 15:11:47,532 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-12 15:11:47,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:11:47,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:11:47,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:11:47,920 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:11:47,920 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:11:47,922 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-12 15:11:49,505 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:11:49,748 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:11:49,751 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2024-10-12 15:11:49,768 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f5cadb26/b80ef3ec37c34eb5b057082dde7a6a2f/FLAG6da5aa13d [2024-10-12 15:11:50,092 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f5cadb26/b80ef3ec37c34eb5b057082dde7a6a2f [2024-10-12 15:11:50,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:11:50,095 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:11:50,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:11:50,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:11:50,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:11:50,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:11:50" (1/1) ... [2024-10-12 15:11:50,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16bd66b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:50, skipping insertion in model container [2024-10-12 15:11:50,105 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:11:50" (1/1) ... [2024-10-12 15:11:50,132 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:11:50,327 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-12 15:11:50,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:11:50,419 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:11:50,431 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-12 15:11:50,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:11:50,497 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:11:50,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:50 WrapperNode [2024-10-12 15:11:50,498 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:11:50,499 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:11:50,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:11:50,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:11:50,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:50" (1/1) ... [2024-10-12 15:11:50,520 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:50" (1/1) ... [2024-10-12 15:11:50,545 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 149 [2024-10-12 15:11:50,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:11:50,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:11:50,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:11:50,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:11:50,558 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:50" (1/1) ... [2024-10-12 15:11:50,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:50" (1/1) ... [2024-10-12 15:11:50,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:50" (1/1) ... [2024-10-12 15:11:50,580 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-12 15:11:50,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:50" (1/1) ... [2024-10-12 15:11:50,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:50" (1/1) ... [2024-10-12 15:11:50,591 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:50" (1/1) ... [2024-10-12 15:11:50,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:50" (1/1) ... [2024-10-12 15:11:50,606 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:50" (1/1) ... [2024-10-12 15:11:50,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:50" (1/1) ... [2024-10-12 15:11:50,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:11:50,610 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:11:50,613 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:11:50,613 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:11:50,614 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:50" (1/1) ... [2024-10-12 15:11:50,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:11:50,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:50,645 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-12 15:11:50,648 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-12 15:11:50,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:11:50,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 15:11:50,689 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-10-12 15:11:50,689 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-10-12 15:11:50,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:11:50,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:11:50,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-12 15:11:50,690 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-12 15:11:50,770 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:11:50,771 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:11:51,111 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-10-12 15:11:51,111 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:11:51,159 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:11:51,160 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 15:11:51,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:11:51 BoogieIcfgContainer [2024-10-12 15:11:51,160 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:11:51,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:11:51,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:11:51,166 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:11:51,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:11:50" (1/3) ... [2024-10-12 15:11:51,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5b6289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:11:51, skipping insertion in model container [2024-10-12 15:11:51,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:50" (2/3) ... [2024-10-12 15:11:51,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5b6289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:11:51, skipping insertion in model container [2024-10-12 15:11:51,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:11:51" (3/3) ... [2024-10-12 15:11:51,170 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2024-10-12 15:11:51,186 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:11:51,187 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:11:51,245 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:11:51,252 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;@1f111683, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:11:51,252 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:11:51,256 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-12 15:11:51,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 15:11:51,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:51,263 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-12 15:11:51,263 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:51,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:51,268 INFO L85 PathProgramCache]: Analyzing trace with hash 132641120, now seen corresponding path program 1 times [2024-10-12 15:11:51,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:51,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651727077] [2024-10-12 15:11:51,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:51,283 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-12 15:11:51,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:51,286 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-12 15:11:51,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-12 15:11:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:51,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 15:11:51,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:51,536 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-12 15:11:51,537 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:51,610 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-12 15:11:51,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:51,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651727077] [2024-10-12 15:11:51,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651727077] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:11:51,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 15:11:51,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-10-12 15:11:51,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149279713] [2024-10-12 15:11:51,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 15:11:51,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 15:11:51,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:51,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 15:11:51,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:11:51,648 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-12 15:11:51,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:51,777 INFO L93 Difference]: Finished difference Result 144 states and 243 transitions. [2024-10-12 15:11:51,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 15:11:51,780 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-12 15:11:51,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:51,788 INFO L225 Difference]: With dead ends: 144 [2024-10-12 15:11:51,788 INFO L226 Difference]: Without dead ends: 77 [2024-10-12 15:11:51,791 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-12 15:11:51,794 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 5 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12 15:11:51,795 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-12 15:11:51,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-12 15:11:51,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2024-10-12 15:11:51,827 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-12 15:11:51,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 116 transitions. [2024-10-12 15:11:51,830 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 116 transitions. Word has length 28 [2024-10-12 15:11:51,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:51,830 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 116 transitions. [2024-10-12 15:11:51,831 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-12 15:11:51,831 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 116 transitions. [2024-10-12 15:11:51,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-12 15:11:51,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:51,833 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-12 15:11:51,837 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-12 15:11:52,034 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-12 15:11:52,035 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:52,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:52,035 INFO L85 PathProgramCache]: Analyzing trace with hash 575955966, now seen corresponding path program 1 times [2024-10-12 15:11:52,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:52,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983984538] [2024-10-12 15:11:52,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:52,037 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-12 15:11:52,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:52,040 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-12 15:11:52,041 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-12 15:11:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:52,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 15:11:52,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:52,170 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-12 15:11:52,170 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:52,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:52,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [983984538] [2024-10-12 15:11:52,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [983984538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:52,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:52,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 15:11:52,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507038762] [2024-10-12 15:11:52,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:52,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 15:11:52,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:52,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 15:11:52,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:11:52,178 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-12 15:11:52,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:52,315 INFO L93 Difference]: Finished difference Result 161 states and 248 transitions. [2024-10-12 15:11:52,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 15:11:52,316 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-12 15:11:52,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:52,318 INFO L225 Difference]: With dead ends: 161 [2024-10-12 15:11:52,319 INFO L226 Difference]: Without dead ends: 120 [2024-10-12 15:11:52,320 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-12 15:11:52,321 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-12 15:11:52,321 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-12 15:11:52,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-12 15:11:52,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2024-10-12 15:11:52,338 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-12 15:11:52,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 180 transitions. [2024-10-12 15:11:52,344 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 180 transitions. Word has length 32 [2024-10-12 15:11:52,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:52,345 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 180 transitions. [2024-10-12 15:11:52,345 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-12 15:11:52,345 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 180 transitions. [2024-10-12 15:11:52,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-12 15:11:52,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:52,346 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-12 15:11:52,351 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-12 15:11:52,547 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-12 15:11:52,547 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:52,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:52,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1256014336, now seen corresponding path program 1 times [2024-10-12 15:11:52,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:52,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [581328297] [2024-10-12 15:11:52,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:52,549 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-12 15:11:52,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:52,551 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-12 15:11:52,552 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-12 15:11:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:52,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 15:11:52,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:52,654 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-12 15:11:52,655 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:52,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:52,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [581328297] [2024-10-12 15:11:52,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [581328297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:52,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:52,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 15:11:52,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468334701] [2024-10-12 15:11:52,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:52,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 15:11:52,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:52,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 15:11:52,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:11:52,658 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-12 15:11:52,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:52,778 INFO L93 Difference]: Finished difference Result 149 states and 225 transitions. [2024-10-12 15:11:52,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 15:11:52,779 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-12 15:11:52,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:52,780 INFO L225 Difference]: With dead ends: 149 [2024-10-12 15:11:52,780 INFO L226 Difference]: Without dead ends: 111 [2024-10-12 15:11:52,781 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-12 15:11:52,782 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-12 15:11:52,782 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-12 15:11:52,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-12 15:11:52,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2024-10-12 15:11:52,792 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-12 15:11:52,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 164 transitions. [2024-10-12 15:11:52,793 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 164 transitions. Word has length 32 [2024-10-12 15:11:52,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:52,794 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 164 transitions. [2024-10-12 15:11:52,794 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-12 15:11:52,794 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 164 transitions. [2024-10-12 15:11:52,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-12 15:11:52,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:52,796 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-12 15:11:52,799 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-12 15:11:52,998 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-12 15:11:52,999 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:53,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:53,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1734345439, now seen corresponding path program 1 times [2024-10-12 15:11:53,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:53,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88509306] [2024-10-12 15:11:53,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:53,001 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-12 15:11:53,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:53,004 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-12 15:11:53,005 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-12 15:11:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:53,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:11:53,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:53,101 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-12 15:11:53,102 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:53,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:53,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88509306] [2024-10-12 15:11:53,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [88509306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:53,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:53,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 15:11:53,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558863425] [2024-10-12 15:11:53,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:53,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:11:53,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:53,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:11:53,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:11:53,109 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-12 15:11:53,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:53,154 INFO L93 Difference]: Finished difference Result 184 states and 276 transitions. [2024-10-12 15:11:53,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:11:53,156 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-12 15:11:53,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:53,157 INFO L225 Difference]: With dead ends: 184 [2024-10-12 15:11:53,157 INFO L226 Difference]: Without dead ends: 142 [2024-10-12 15:11:53,160 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-12 15:11:53,161 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-12 15:11:53,164 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-12 15:11:53,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-12 15:11:53,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-12 15:11:53,185 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-12 15:11:53,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 207 transitions. [2024-10-12 15:11:53,186 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 207 transitions. Word has length 36 [2024-10-12 15:11:53,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:53,187 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 207 transitions. [2024-10-12 15:11:53,188 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-12 15:11:53,188 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 207 transitions. [2024-10-12 15:11:53,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-12 15:11:53,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:53,190 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-12 15:11:53,198 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-12 15:11:53,390 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-12 15:11:53,391 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:53,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:53,391 INFO L85 PathProgramCache]: Analyzing trace with hash -713277085, now seen corresponding path program 1 times [2024-10-12 15:11:53,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:53,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467649346] [2024-10-12 15:11:53,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:53,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-12 15:11:53,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:53,400 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-12 15:11:53,403 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-12 15:11:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:53,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 15:11:53,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:53,539 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-12 15:11:53,539 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:53,584 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-12 15:11:53,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:53,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467649346] [2024-10-12 15:11:53,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467649346] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:11:53,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 15:11:53,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-10-12 15:11:53,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912155741] [2024-10-12 15:11:53,586 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 15:11:53,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 15:11:53,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:53,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 15:11:53,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:11:53,587 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-12 15:11:53,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:53,674 INFO L93 Difference]: Finished difference Result 315 states and 466 transitions. [2024-10-12 15:11:53,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 15:11:53,675 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-12 15:11:53,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:53,677 INFO L225 Difference]: With dead ends: 315 [2024-10-12 15:11:53,677 INFO L226 Difference]: Without dead ends: 242 [2024-10-12 15:11:53,678 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-12 15:11:53,681 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 41 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12 15:11:53,681 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-12 15:11:53,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-10-12 15:11:53,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2024-10-12 15:11:53,709 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-12 15:11:53,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 346 transitions. [2024-10-12 15:11:53,712 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 346 transitions. Word has length 36 [2024-10-12 15:11:53,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:53,712 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 346 transitions. [2024-10-12 15:11:53,712 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-12 15:11:53,713 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 346 transitions. [2024-10-12 15:11:53,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-12 15:11:53,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:53,719 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-12 15:11:53,725 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-12 15:11:53,922 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-12 15:11:53,923 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:53,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:53,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1892344627, now seen corresponding path program 1 times [2024-10-12 15:11:53,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:53,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279092194] [2024-10-12 15:11:53,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:53,924 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-12 15:11:53,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:53,927 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-12 15:11:53,928 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-12 15:11:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:53,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 15:11:53,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:54,062 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-12 15:11:54,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:54,119 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-12 15:11:54,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:54,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279092194] [2024-10-12 15:11:54,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279092194] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:11:54,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 15:11:54,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-10-12 15:11:54,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56633593] [2024-10-12 15:11:54,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 15:11:54,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 15:11:54,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:54,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 15:11:54,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 15:11:54,123 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-12 15:11:54,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:54,280 INFO L93 Difference]: Finished difference Result 275 states and 397 transitions. [2024-10-12 15:11:54,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 15:11:54,280 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-12 15:11:54,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:54,282 INFO L225 Difference]: With dead ends: 275 [2024-10-12 15:11:54,282 INFO L226 Difference]: Without dead ends: 226 [2024-10-12 15:11:54,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-12 15:11:54,284 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-12 15:11:54,284 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-12 15:11:54,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-12 15:11:54,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 222. [2024-10-12 15:11:54,295 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-12 15:11:54,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 316 transitions. [2024-10-12 15:11:54,296 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 316 transitions. Word has length 36 [2024-10-12 15:11:54,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:54,297 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 316 transitions. [2024-10-12 15:11:54,297 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-12 15:11:54,297 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 316 transitions. [2024-10-12 15:11:54,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 15:11:54,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:54,303 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-12 15:11:54,308 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-12 15:11:54,503 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-12 15:11:54,503 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:54,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:54,504 INFO L85 PathProgramCache]: Analyzing trace with hash 189552572, now seen corresponding path program 1 times [2024-10-12 15:11:54,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:54,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526719964] [2024-10-12 15:11:54,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:54,504 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-12 15:11:54,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:54,506 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-12 15:11:54,507 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-12 15:11:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:54,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:11:54,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:54,593 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-12 15:11:54,593 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:54,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:54,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526719964] [2024-10-12 15:11:54,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [526719964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:54,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:54,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 15:11:54,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165266796] [2024-10-12 15:11:54,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:54,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:11:54,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:54,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:11:54,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:11:54,596 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-12 15:11:54,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:54,673 INFO L93 Difference]: Finished difference Result 386 states and 547 transitions. [2024-10-12 15:11:54,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 15:11:54,674 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-12 15:11:54,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:54,675 INFO L225 Difference]: With dead ends: 386 [2024-10-12 15:11:54,676 INFO L226 Difference]: Without dead ends: 166 [2024-10-12 15:11:54,677 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-12 15:11:54,678 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-12 15:11:54,679 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-12 15:11:54,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-12 15:11:54,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 156. [2024-10-12 15:11:54,695 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-12 15:11:54,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 214 transitions. [2024-10-12 15:11:54,696 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 214 transitions. Word has length 38 [2024-10-12 15:11:54,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:54,696 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 214 transitions. [2024-10-12 15:11:54,696 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-12 15:11:54,697 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 214 transitions. [2024-10-12 15:11:54,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-12 15:11:54,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:54,698 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-12 15:11:54,705 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-12 15:11:54,898 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-12 15:11:54,899 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:54,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:54,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1073353582, now seen corresponding path program 1 times [2024-10-12 15:11:54,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:54,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975313098] [2024-10-12 15:11:54,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:54,900 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-12 15:11:54,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:54,903 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-12 15:11:54,905 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-12 15:11:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:54,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 15:11:54,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:55,075 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-12 15:11:55,076 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:55,152 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-12 15:11:55,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:55,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975313098] [2024-10-12 15:11:55,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975313098] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:55,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:11:55,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-12 15:11:55,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68305076] [2024-10-12 15:11:55,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:55,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 15:11:55,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:55,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 15:11:55,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-12 15:11:55,158 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-12 15:11:55,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:55,314 INFO L93 Difference]: Finished difference Result 237 states and 335 transitions. [2024-10-12 15:11:55,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 15:11:55,315 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-12 15:11:55,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:55,317 INFO L225 Difference]: With dead ends: 237 [2024-10-12 15:11:55,318 INFO L226 Difference]: Without dead ends: 201 [2024-10-12 15:11:55,319 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-12 15:11:55,320 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-12 15:11:55,320 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-12 15:11:55,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-12 15:11:55,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 191. [2024-10-12 15:11:55,332 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-12 15:11:55,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 262 transitions. [2024-10-12 15:11:55,334 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 262 transitions. Word has length 39 [2024-10-12 15:11:55,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:55,334 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 262 transitions. [2024-10-12 15:11:55,334 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-12 15:11:55,335 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 262 transitions. [2024-10-12 15:11:55,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-12 15:11:55,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:55,336 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-12 15:11:55,342 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-12 15:11:55,536 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-12 15:11:55,537 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:55,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:55,538 INFO L85 PathProgramCache]: Analyzing trace with hash 701653780, now seen corresponding path program 1 times [2024-10-12 15:11:55,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:55,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615067007] [2024-10-12 15:11:55,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:55,538 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-12 15:11:55,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:55,539 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-12 15:11:55,540 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-12 15:11:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:55,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 15:11:55,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:55,621 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-12 15:11:55,622 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:55,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:55,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615067007] [2024-10-12 15:11:55,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615067007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:55,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:55,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 15:11:55,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143898311] [2024-10-12 15:11:55,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:55,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 15:11:55,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:55,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 15:11:55,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:11:55,624 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-12 15:11:55,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:55,668 INFO L93 Difference]: Finished difference Result 198 states and 268 transitions. [2024-10-12 15:11:55,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 15:11:55,669 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-12 15:11:55,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:55,670 INFO L225 Difference]: With dead ends: 198 [2024-10-12 15:11:55,670 INFO L226 Difference]: Without dead ends: 191 [2024-10-12 15:11:55,670 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-12 15:11:55,671 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-12 15:11:55,673 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-12 15:11:55,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-12 15:11:55,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-10-12 15:11:55,683 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-12 15:11:55,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 259 transitions. [2024-10-12 15:11:55,685 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 259 transitions. Word has length 39 [2024-10-12 15:11:55,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:55,686 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 259 transitions. [2024-10-12 15:11:55,686 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-12 15:11:55,686 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 259 transitions. [2024-10-12 15:11:55,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 15:11:55,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:55,687 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-12 15:11:55,691 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-12 15:11:55,889 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-12 15:11:55,890 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:55,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:55,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1960026152, now seen corresponding path program 1 times [2024-10-12 15:11:55,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:55,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716758171] [2024-10-12 15:11:55,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:55,891 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-12 15:11:55,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:55,892 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-12 15:11:55,893 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-12 15:11:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:55,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:11:55,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:55,962 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-12 15:11:55,964 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:55,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:55,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716758171] [2024-10-12 15:11:55,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716758171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:55,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:55,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 15:11:55,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439374861] [2024-10-12 15:11:55,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:55,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:11:55,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:55,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:11:55,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:11:55,966 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-12 15:11:55,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:55,992 INFO L93 Difference]: Finished difference Result 318 states and 438 transitions. [2024-10-12 15:11:55,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:11:55,993 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-12 15:11:55,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:55,995 INFO L225 Difference]: With dead ends: 318 [2024-10-12 15:11:55,995 INFO L226 Difference]: Without dead ends: 266 [2024-10-12 15:11:55,995 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-12 15:11:55,996 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-12 15:11:55,997 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-12 15:11:55,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-10-12 15:11:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 208. [2024-10-12 15:11:56,008 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-12 15:11:56,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 283 transitions. [2024-10-12 15:11:56,010 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 283 transitions. Word has length 40 [2024-10-12 15:11:56,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:56,011 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 283 transitions. [2024-10-12 15:11:56,011 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-12 15:11:56,011 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 283 transitions. [2024-10-12 15:11:56,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 15:11:56,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:56,012 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-12 15:11:56,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-12 15:11:56,213 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-12 15:11:56,213 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:56,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:56,214 INFO L85 PathProgramCache]: Analyzing trace with hash 645595560, now seen corresponding path program 2 times [2024-10-12 15:11:56,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:56,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126178634] [2024-10-12 15:11:56,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 15:11:56,214 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-12 15:11:56,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:56,215 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-12 15:11:56,216 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-12 15:11:56,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-12 15:11:56,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 15:11:56,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 15:11:56,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:56,394 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-12 15:11:56,394 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:56,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:56,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126178634] [2024-10-12 15:11:56,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1126178634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:56,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:56,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 15:11:56,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288599827] [2024-10-12 15:11:56,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:56,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 15:11:56,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:56,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 15:11:56,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:11:56,396 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-12 15:11:56,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:56,501 INFO L93 Difference]: Finished difference Result 214 states and 288 transitions. [2024-10-12 15:11:56,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 15:11:56,501 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-12 15:11:56,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:56,503 INFO L225 Difference]: With dead ends: 214 [2024-10-12 15:11:56,503 INFO L226 Difference]: Without dead ends: 212 [2024-10-12 15:11:56,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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-12 15:11:56,504 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 3 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12 15:11:56,504 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-12 15:11:56,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-12 15:11:56,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-10-12 15:11:56,513 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-12 15:11:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 286 transitions. [2024-10-12 15:11:56,514 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 286 transitions. Word has length 40 [2024-10-12 15:11:56,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:56,515 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 286 transitions. [2024-10-12 15:11:56,515 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-12 15:11:56,515 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 286 transitions. [2024-10-12 15:11:56,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 15:11:56,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:56,516 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-12 15:11:56,519 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-12 15:11:56,716 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-12 15:11:56,717 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:56,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:56,717 INFO L85 PathProgramCache]: Analyzing trace with hash 702853862, now seen corresponding path program 1 times [2024-10-12 15:11:56,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:56,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207045931] [2024-10-12 15:11:56,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:56,718 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-12 15:11:56,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:56,721 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-12 15:11:56,722 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-12 15:11:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:56,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-12 15:11:56,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:56,969 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-12 15:11:56,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:57,085 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-12 15:11:57,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:57,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207045931] [2024-10-12 15:11:57,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207045931] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:57,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:11:57,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2024-10-12 15:11:57,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062348846] [2024-10-12 15:11:57,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:57,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 15:11:57,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:57,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 15:11:57,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-10-12 15:11:57,087 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-12 15:11:57,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:57,176 INFO L93 Difference]: Finished difference Result 218 states and 291 transitions. [2024-10-12 15:11:57,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 15:11:57,176 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-12 15:11:57,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:57,178 INFO L225 Difference]: With dead ends: 218 [2024-10-12 15:11:57,178 INFO L226 Difference]: Without dead ends: 216 [2024-10-12 15:11:57,178 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-12 15:11:57,179 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 3 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:57,179 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.1s Time] [2024-10-12 15:11:57,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-12 15:11:57,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2024-10-12 15:11:57,188 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-12 15:11:57,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 289 transitions. [2024-10-12 15:11:57,189 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 289 transitions. Word has length 40 [2024-10-12 15:11:57,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:57,189 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 289 transitions. [2024-10-12 15:11:57,190 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-12 15:11:57,190 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 289 transitions. [2024-10-12 15:11:57,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-12 15:11:57,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:57,191 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-12 15:11:57,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-12 15:11:57,393 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-12 15:11:57,393 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:57,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:57,394 INFO L85 PathProgramCache]: Analyzing trace with hash -795813825, now seen corresponding path program 1 times [2024-10-12 15:11:57,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:57,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776052487] [2024-10-12 15:11:57,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:57,394 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-12 15:11:57,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:57,398 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-12 15:11: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 (14)] Waiting until timeout for monitored process [2024-10-12 15:11:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:57,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:11:57,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:57,468 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-12 15:11:57,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:57,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:57,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776052487] [2024-10-12 15:11:57,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1776052487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:57,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:57,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 15:11:57,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368372678] [2024-10-12 15:11:57,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:57,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:11:57,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:57,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:11:57,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:11:57,471 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-12 15:11:57,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:57,496 INFO L93 Difference]: Finished difference Result 231 states and 305 transitions. [2024-10-12 15:11:57,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:11:57,497 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-12 15:11:57,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:57,498 INFO L225 Difference]: With dead ends: 231 [2024-10-12 15:11:57,499 INFO L226 Difference]: Without dead ends: 194 [2024-10-12 15:11:57,500 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-12 15:11:57,500 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-12 15:11:57,502 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-12 15:11:57,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-12 15:11:57,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2024-10-12 15:11:57,513 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-12 15:11:57,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 261 transitions. [2024-10-12 15:11:57,514 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 261 transitions. Word has length 43 [2024-10-12 15:11:57,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:57,515 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 261 transitions. [2024-10-12 15:11:57,515 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-12 15:11:57,515 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 261 transitions. [2024-10-12 15:11:57,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-12 15:11:57,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:57,517 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-12 15:11:57,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-12 15:11:57,720 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-12 15:11:57,720 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:57,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:57,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1053756109, now seen corresponding path program 1 times [2024-10-12 15:11:57,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:57,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138574327] [2024-10-12 15:11:57,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:57,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:11:57,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:57,722 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-12 15:11:57,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-12 15:11:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:57,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 15:11:57,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:57,790 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-12 15:11:57,790 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:57,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:57,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138574327] [2024-10-12 15:11:57,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138574327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:57,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:57,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 15:11:57,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535446890] [2024-10-12 15:11:57,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:57,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 15:11:57,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:57,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 15:11:57,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:11:57,792 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-12 15:11:57,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:57,890 INFO L93 Difference]: Finished difference Result 245 states and 333 transitions. [2024-10-12 15:11:57,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 15:11:57,891 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-12 15:11:57,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:57,892 INFO L225 Difference]: With dead ends: 245 [2024-10-12 15:11:57,893 INFO L226 Difference]: Without dead ends: 205 [2024-10-12 15:11:57,893 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-12 15:11:57,893 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 56 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12 15:11:57,894 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-12 15:11:57,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-12 15:11:57,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 194. [2024-10-12 15:11:57,902 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-12 15:11:57,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 259 transitions. [2024-10-12 15:11:57,903 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 259 transitions. Word has length 44 [2024-10-12 15:11:57,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:57,904 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 259 transitions. [2024-10-12 15:11:57,904 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-12 15:11:57,904 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 259 transitions. [2024-10-12 15:11:57,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-12 15:11:57,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:57,905 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-12 15:11:57,909 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-12 15:11:58,107 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-12 15:11:58,108 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:58,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:58,108 INFO L85 PathProgramCache]: Analyzing trace with hash 660729099, now seen corresponding path program 1 times [2024-10-12 15:11:58,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:58,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825058020] [2024-10-12 15:11:58,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:58,109 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-12 15:11:58,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:58,110 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-12 15:11:58,112 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-12 15:11:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:58,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 15:11:58,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:58,187 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-12 15:11:58,188 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:58,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:58,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [825058020] [2024-10-12 15:11:58,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [825058020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:58,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:58,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 15:11:58,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082587768] [2024-10-12 15:11:58,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:58,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:11:58,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:58,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:11:58,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:11:58,190 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-12 15:11:58,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:58,257 INFO L93 Difference]: Finished difference Result 267 states and 356 transitions. [2024-10-12 15:11:58,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:11:58,258 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-12 15:11:58,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:58,260 INFO L225 Difference]: With dead ends: 267 [2024-10-12 15:11:58,260 INFO L226 Difference]: Without dead ends: 238 [2024-10-12 15:11:58,260 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-12 15:11:58,261 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-12 15:11:58,261 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-12 15:11:58,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-12 15:11:58,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 198. [2024-10-12 15:11:58,274 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-12 15:11:58,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 263 transitions. [2024-10-12 15:11:58,275 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 263 transitions. Word has length 44 [2024-10-12 15:11:58,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:58,276 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 263 transitions. [2024-10-12 15:11:58,276 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-12 15:11:58,276 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 263 transitions. [2024-10-12 15:11:58,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-12 15:11:58,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:58,277 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-12 15:11:58,281 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-12 15:11:58,480 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-12 15:11:58,480 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:58,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:58,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1173785422, now seen corresponding path program 1 times [2024-10-12 15:11:58,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:58,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561867404] [2024-10-12 15:11:58,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:58,481 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-12 15:11:58,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:58,483 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-12 15:11:58,484 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-12 15:11:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:58,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 15:11:58,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:58,583 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-12 15:11:58,584 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:58,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:58,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561867404] [2024-10-12 15:11:58,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561867404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:58,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:58,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 15:11:58,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241877338] [2024-10-12 15:11:58,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:58,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 15:11:58,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:58,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 15:11:58,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:11:58,585 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-12 15:11:58,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:58,749 INFO L93 Difference]: Finished difference Result 271 states and 369 transitions. [2024-10-12 15:11:58,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 15:11:58,750 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-12 15:11:58,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:58,752 INFO L225 Difference]: With dead ends: 271 [2024-10-12 15:11:58,752 INFO L226 Difference]: Without dead ends: 247 [2024-10-12 15:11:58,752 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-12 15:11:58,753 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-12 15:11:58,753 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-12 15:11:58,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-12 15:11:58,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 232. [2024-10-12 15:11:58,763 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-12 15:11:58,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 309 transitions. [2024-10-12 15:11:58,764 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 309 transitions. Word has length 45 [2024-10-12 15:11:58,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:58,764 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 309 transitions. [2024-10-12 15:11:58,764 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-12 15:11:58,764 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 309 transitions. [2024-10-12 15:11:58,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-12 15:11:58,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:58,765 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-12 15:11:58,769 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-12 15:11:58,966 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-12 15:11:58,966 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:58,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:58,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1256313678, now seen corresponding path program 1 times [2024-10-12 15:11:58,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:58,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1599625943] [2024-10-12 15:11:58,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:58,967 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-12 15:11:58,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:58,968 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-12 15:11:58,969 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-12 15:11:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:59,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 15:11:59,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:59,077 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-12 15:11:59,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:59,135 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-12 15:11:59,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:59,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1599625943] [2024-10-12 15:11:59,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1599625943] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:11:59,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 15:11:59,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2024-10-12 15:11:59,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009942950] [2024-10-12 15:11:59,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 15:11:59,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 15:11:59,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:59,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 15:11:59,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:11:59,137 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-12 15:11:59,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:59,225 INFO L93 Difference]: Finished difference Result 255 states and 335 transitions. [2024-10-12 15:11:59,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 15:11:59,226 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-12 15:11:59,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:59,227 INFO L225 Difference]: With dead ends: 255 [2024-10-12 15:11:59,227 INFO L226 Difference]: Without dead ends: 223 [2024-10-12 15:11:59,228 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-12 15:11:59,229 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 20 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12 15:11:59,229 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-12 15:11:59,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-12 15:11:59,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 213. [2024-10-12 15:11:59,239 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-12 15:11:59,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 286 transitions. [2024-10-12 15:11:59,240 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 286 transitions. Word has length 45 [2024-10-12 15:11:59,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:59,240 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 286 transitions. [2024-10-12 15:11:59,241 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-12 15:11:59,241 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 286 transitions. [2024-10-12 15:11:59,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-12 15:11:59,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:59,242 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-12 15:11:59,246 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 (18)] Forceful destruction successful, exit code 0 [2024-10-12 15:11:59,442 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-12 15:11:59,443 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:59,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:59,443 INFO L85 PathProgramCache]: Analyzing trace with hash 833611852, now seen corresponding path program 1 times [2024-10-12 15:11:59,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:59,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1381313641] [2024-10-12 15:11:59,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:59,444 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-12 15:11:59,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:59,447 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-12 15:11:59,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-12 15:11:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:59,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:11:59,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:59,518 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-12 15:11:59,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:59,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:59,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1381313641] [2024-10-12 15:11:59,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1381313641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:59,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:59,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 15:11:59,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479416677] [2024-10-12 15:11:59,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:59,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:11:59,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:59,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:11:59,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:11:59,520 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-12 15:11:59,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:59,550 INFO L93 Difference]: Finished difference Result 247 states and 327 transitions. [2024-10-12 15:11:59,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:11:59,551 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-12 15:11:59,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:59,552 INFO L225 Difference]: With dead ends: 247 [2024-10-12 15:11:59,552 INFO L226 Difference]: Without dead ends: 213 [2024-10-12 15:11:59,554 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-12 15:11:59,555 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-12 15:11:59,555 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-12 15:11:59,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-12 15:11:59,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-10-12 15:11:59,564 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-12 15:11:59,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 274 transitions. [2024-10-12 15:11:59,565 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 274 transitions. Word has length 45 [2024-10-12 15:11:59,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:59,566 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 274 transitions. [2024-10-12 15:11:59,566 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-12 15:11:59,566 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 274 transitions. [2024-10-12 15:11:59,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-12 15:11:59,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:59,567 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-12 15:11:59,570 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-12 15:11:59,767 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-12 15:11:59,768 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:59,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:59,768 INFO L85 PathProgramCache]: Analyzing trace with hash -2070421974, now seen corresponding path program 1 times [2024-10-12 15:11:59,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:59,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1797134172] [2024-10-12 15:11:59,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:59,769 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-12 15:11:59,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:59,770 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-12 15:11:59,771 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-12 15:11:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:59,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:11:59,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:59,830 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-12 15:11:59,830 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:59,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:59,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1797134172] [2024-10-12 15:11:59,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1797134172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:59,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:59,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 15:11:59,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127542315] [2024-10-12 15:11:59,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:59,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:11:59,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:59,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:11:59,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:11:59,833 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-12 15:11:59,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:59,864 INFO L93 Difference]: Finished difference Result 222 states and 282 transitions. [2024-10-12 15:11:59,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:11:59,865 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-12 15:11:59,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:59,866 INFO L225 Difference]: With dead ends: 222 [2024-10-12 15:11:59,866 INFO L226 Difference]: Without dead ends: 183 [2024-10-12 15:11:59,867 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-12 15:11:59,867 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-12 15:11:59,867 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-12 15:11:59,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-12 15:11:59,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 173. [2024-10-12 15:11:59,879 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-12 15:11:59,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 221 transitions. [2024-10-12 15:11:59,880 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 221 transitions. Word has length 47 [2024-10-12 15:11:59,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:59,881 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 221 transitions. [2024-10-12 15:11:59,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-12 15:11:59,881 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 221 transitions. [2024-10-12 15:11:59,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-12 15:11:59,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:59,882 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-12 15:11:59,887 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 (20)] Forceful destruction successful, exit code 0 [2024-10-12 15:12:00,083 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-12 15:12:00,084 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:00,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:00,084 INFO L85 PathProgramCache]: Analyzing trace with hash 322717964, now seen corresponding path program 1 times [2024-10-12 15:12:00,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:12:00,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248519213] [2024-10-12 15:12:00,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:00,085 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-12 15:12:00,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:12:00,102 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-12 15:12:00,103 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-12 15:12:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:00,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 15:12:00,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:12:00,183 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-12 15:12:00,183 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:12:00,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:12:00,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248519213] [2024-10-12 15:12:00,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248519213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:00,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:00,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 15:12:00,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897797846] [2024-10-12 15:12:00,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:00,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 15:12:00,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:12:00,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 15:12:00,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:12:00,185 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-12 15:12:00,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:00,302 INFO L93 Difference]: Finished difference Result 221 states and 286 transitions. [2024-10-12 15:12:00,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 15:12:00,303 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-12 15:12:00,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:00,304 INFO L225 Difference]: With dead ends: 221 [2024-10-12 15:12:00,304 INFO L226 Difference]: Without dead ends: 175 [2024-10-12 15:12:00,304 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-12 15:12:00,305 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-12 15:12:00,305 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-12 15:12:00,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-12 15:12:00,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 150. [2024-10-12 15:12:00,313 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-12 15:12:00,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 195 transitions. [2024-10-12 15:12:00,314 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 195 transitions. Word has length 47 [2024-10-12 15:12:00,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:00,315 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 195 transitions. [2024-10-12 15:12:00,315 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-12 15:12:00,315 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 195 transitions. [2024-10-12 15:12:00,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 15:12:00,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:00,316 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-12 15:12:00,320 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-12 15:12:00,519 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-12 15:12:00,520 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:00,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:00,520 INFO L85 PathProgramCache]: Analyzing trace with hash 914926325, now seen corresponding path program 1 times [2024-10-12 15:12:00,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:12:00,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474614996] [2024-10-12 15:12:00,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:00,520 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-12 15:12:00,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:12:00,524 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-12 15:12:00,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-12 15:12:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:00,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 15:12:00,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:12:00,776 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-12 15:12:00,776 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:12:00,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:12:00,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474614996] [2024-10-12 15:12:00,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474614996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:00,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:00,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 15:12:00,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135244346] [2024-10-12 15:12:00,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:00,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 15:12:00,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:12:00,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 15:12:00,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-12 15:12:00,779 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-12 15:12:00,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:00,946 INFO L93 Difference]: Finished difference Result 165 states and 212 transitions. [2024-10-12 15:12:00,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 15:12:00,947 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-12 15:12:00,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:00,948 INFO L225 Difference]: With dead ends: 165 [2024-10-12 15:12:00,948 INFO L226 Difference]: Without dead ends: 163 [2024-10-12 15:12:00,948 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-12 15:12:00,949 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-12 15:12:00,949 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-12 15:12:00,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-12 15:12:00,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2024-10-12 15:12:00,962 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-12 15:12:00,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 204 transitions. [2024-10-12 15:12:00,963 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 204 transitions. Word has length 50 [2024-10-12 15:12:00,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:00,964 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 204 transitions. [2024-10-12 15:12:00,964 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-12 15:12:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 204 transitions. [2024-10-12 15:12:00,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 15:12:00,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:00,965 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-12 15:12:00,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-10-12 15:12:01,169 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-12 15:12:01,169 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:01,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:01,169 INFO L85 PathProgramCache]: Analyzing trace with hash -2015488813, now seen corresponding path program 1 times [2024-10-12 15:12:01,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:12:01,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917647778] [2024-10-12 15:12:01,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:01,170 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-12 15:12:01,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:12:01,173 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-12 15:12:01,174 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-12 15:12:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:01,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 15:12:01,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:12:13,400 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-12 15:12:13,401 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:12:13,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:12:13,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917647778] [2024-10-12 15:12:13,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917647778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:13,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:13,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 15:12:13,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473910599] [2024-10-12 15:12:13,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:13,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 15:12:13,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:12:13,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 15:12:13,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=36, Unknown=4, NotChecked=0, Total=56 [2024-10-12 15:12:13,403 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-12 15:12:17,441 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-12 15:12:34,522 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-12 15:12:36,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-12 15:12:39,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-12 15:12:39,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:39,773 INFO L93 Difference]: Finished difference Result 169 states and 215 transitions. [2024-10-12 15:12:39,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 15:12:39,774 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-12 15:12:39,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:39,775 INFO L225 Difference]: With dead ends: 169 [2024-10-12 15:12:39,775 INFO L226 Difference]: Without dead ends: 167 [2024-10-12 15:12:39,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=37, Invalid=88, Unknown=7, NotChecked=0, Total=132 [2024-10-12 15:12:39,776 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 10 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:39,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 460 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 2 Unknown, 0 Unchecked, 14.1s Time] [2024-10-12 15:12:39,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-12 15:12:39,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 154. [2024-10-12 15:12:39,795 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-12 15:12:39,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 198 transitions. [2024-10-12 15:12:39,796 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 198 transitions. Word has length 51 [2024-10-12 15:12:39,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:39,796 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 198 transitions. [2024-10-12 15:12:39,796 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-12 15:12:39,796 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 198 transitions. [2024-10-12 15:12:39,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 15:12:39,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:39,797 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-12 15:12:39,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-10-12 15:12:39,998 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-12 15:12:39,998 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:39,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:39,998 INFO L85 PathProgramCache]: Analyzing trace with hash -53360271, now seen corresponding path program 1 times [2024-10-12 15:12:39,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:12:39,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292282037] [2024-10-12 15:12:39,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:39,999 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-12 15:12:39,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:12:40,001 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-12 15:12:40,002 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-12 15:12:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:40,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 15:12:40,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:12:40,625 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-12 15:12:40,626 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:12:40,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:12:40,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292282037] [2024-10-12 15:12:40,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292282037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:40,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:40,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 15:12:40,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993752219] [2024-10-12 15:12:40,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:40,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 15:12:40,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:12:40,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 15:12:40,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-12 15:12:40,627 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-12 15:12:41,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:41,545 INFO L93 Difference]: Finished difference Result 191 states and 244 transitions. [2024-10-12 15:12:41,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 15:12:41,546 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-12 15:12:41,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:41,547 INFO L225 Difference]: With dead ends: 191 [2024-10-12 15:12:41,547 INFO L226 Difference]: Without dead ends: 179 [2024-10-12 15:12:41,548 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-12 15:12:41,548 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 17 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 570 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.9s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:41,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 570 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 15:12:41,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-12 15:12:41,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 154. [2024-10-12 15:12:41,560 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-12 15:12:41,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 196 transitions. [2024-10-12 15:12:41,561 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 196 transitions. Word has length 53 [2024-10-12 15:12:41,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:41,562 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 196 transitions. [2024-10-12 15:12:41,562 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-12 15:12:41,562 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 196 transitions. [2024-10-12 15:12:41,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 15:12:41,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:41,563 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-12 15:12:41,567 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-12 15:12:41,763 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-12 15:12:41,764 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:41,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:41,764 INFO L85 PathProgramCache]: Analyzing trace with hash -955350985, now seen corresponding path program 1 times [2024-10-12 15:12:41,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:12:41,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798120440] [2024-10-12 15:12:41,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:41,765 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-12 15:12:41,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:12:41,766 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-12 15:12:41,767 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-12 15:12:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:41,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 15:12:41,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:12:41,872 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-12 15:12:41,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:12:41,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:12:41,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798120440] [2024-10-12 15:12:41,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1798120440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:41,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:41,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 15:12:41,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662558345] [2024-10-12 15:12:41,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:41,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 15:12:41,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:12:41,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 15:12:41,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:12:41,874 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-12 15:12:42,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:42,026 INFO L93 Difference]: Finished difference Result 173 states and 216 transitions. [2024-10-12 15:12:42,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 15:12:42,026 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-12 15:12:42,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:42,027 INFO L225 Difference]: With dead ends: 173 [2024-10-12 15:12:42,027 INFO L226 Difference]: Without dead ends: 171 [2024-10-12 15:12:42,028 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-12 15:12:42,028 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-12 15:12:42,029 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-12 15:12:42,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-12 15:12:42,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2024-10-12 15:12:42,038 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-12 15:12:42,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 199 transitions. [2024-10-12 15:12:42,039 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 199 transitions. Word has length 55 [2024-10-12 15:12:42,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:42,039 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 199 transitions. [2024-10-12 15:12:42,039 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-12 15:12:42,039 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 199 transitions. [2024-10-12 15:12:42,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 15:12:42,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:42,040 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-12 15:12:42,044 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