./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-3a.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 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 18:32:18,435 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 18:32:18,518 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 18:32:18,523 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 18:32:18,524 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 18:32:18,559 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 18:32:18,560 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 18:32:18,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 18:32:18,561 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 18:32:18,561 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 18:32:18,561 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 18:32:18,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 18:32:18,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 18:32:18,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 18:32:18,563 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 18:32:18,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 18:32:18,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 18:32:18,564 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 18:32:18,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 18:32:18,565 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 18:32:18,565 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 18:32:18,566 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 18:32:18,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 18:32:18,566 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 18:32:18,567 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 18:32:18,567 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 18:32:18,568 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 18:32:18,568 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 18:32:18,568 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 18:32:18,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 18:32:18,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 18:32:18,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 18:32:18,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:32:18,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 18:32:18,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 18:32:18,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 18:32:18,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 18:32:18,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 18:32:18,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 18:32:18,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 18:32:18,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 18:32:18,574 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 18:32:18,574 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 -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2024-11-09 18:32:18,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 18:32:18,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 18:32:18,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 18:32:18,864 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 18:32:18,865 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 18:32:18,867 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2024-11-09 18:32:20,442 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 18:32:20,678 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 18:32:20,679 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2024-11-09 18:32:20,691 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/877df691b/d8cfc5d7f17c414dac479b1e9ce5fd79/FLAGa4cd47c91 [2024-11-09 18:32:20,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/877df691b/d8cfc5d7f17c414dac479b1e9ce5fd79 [2024-11-09 18:32:20,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 18:32:20,713 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 18:32:20,714 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 18:32:20,714 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 18:32:20,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 18:32:20,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:32:20" (1/1) ... [2024-11-09 18:32:20,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3029b2f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:20, skipping insertion in model container [2024-11-09 18:32:20,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:32:20" (1/1) ... [2024-11-09 18:32:20,754 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 18:32:20,949 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c[730,743] [2024-11-09 18:32:21,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:32:21,049 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 18:32:21,061 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c[730,743] [2024-11-09 18:32:21,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:32:21,113 INFO L204 MainTranslator]: Completed translation [2024-11-09 18:32:21,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:21 WrapperNode [2024-11-09 18:32:21,114 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 18:32:21,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 18:32:21,116 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 18:32:21,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 18:32:21,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:21" (1/1) ... [2024-11-09 18:32:21,130 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:21" (1/1) ... [2024-11-09 18:32:21,159 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 189 [2024-11-09 18:32:21,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 18:32:21,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 18:32:21,160 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 18:32:21,160 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 18:32:21,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:21" (1/1) ... [2024-11-09 18:32:21,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:21" (1/1) ... [2024-11-09 18:32:21,174 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:21" (1/1) ... [2024-11-09 18:32:21,189 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 18:32:21,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:21" (1/1) ... [2024-11-09 18:32:21,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:21" (1/1) ... [2024-11-09 18:32:21,196 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:21" (1/1) ... [2024-11-09 18:32:21,197 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:21" (1/1) ... [2024-11-09 18:32:21,199 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:21" (1/1) ... [2024-11-09 18:32:21,200 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:21" (1/1) ... [2024-11-09 18:32:21,203 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 18:32:21,205 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 18:32:21,205 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 18:32:21,205 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 18:32:21,210 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:21" (1/1) ... [2024-11-09 18:32:21,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:32:21,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:21,252 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 18:32:21,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 18:32:21,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 18:32:21,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 18:32:21,312 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-09 18:32:21,313 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-09 18:32:21,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 18:32:21,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 18:32:21,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 18:32:21,315 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 18:32:21,402 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 18:32:21,407 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 18:32:21,921 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-11-09 18:32:21,921 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 18:32:21,956 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 18:32:21,956 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 18:32:21,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:32:21 BoogieIcfgContainer [2024-11-09 18:32:21,957 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 18:32:21,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 18:32:21,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 18:32:21,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 18:32:21,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:32:20" (1/3) ... [2024-11-09 18:32:21,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@242f5b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:32:21, skipping insertion in model container [2024-11-09 18:32:21,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:21" (2/3) ... [2024-11-09 18:32:21,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@242f5b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:32:21, skipping insertion in model container [2024-11-09 18:32:21,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:32:21" (3/3) ... [2024-11-09 18:32:21,969 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2024-11-09 18:32:21,987 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 18:32:21,987 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 18:32:22,047 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 18:32:22,073 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;@c4d8edd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 18:32:22,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 18:32:22,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 93 states have internal predecessors, (138), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 18:32:22,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 18:32:22,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:22,089 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:22,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:22,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:22,094 INFO L85 PathProgramCache]: Analyzing trace with hash 254689237, now seen corresponding path program 1 times [2024-11-09 18:32:22,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:22,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760990826] [2024-11-09 18:32:22,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:22,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:22,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:22,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:22,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:22,803 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:32:22,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:22,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760990826] [2024-11-09 18:32:22,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760990826] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:22,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974003330] [2024-11-09 18:32:22,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:22,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:22,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:22,810 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:32:22,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 18:32:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:22,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 18:32:22,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:23,015 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:32:23,016 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:23,191 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:32:23,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974003330] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:32:23,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:32:23,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2024-11-09 18:32:23,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702215245] [2024-11-09 18:32:23,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:32:23,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 18:32:23,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:23,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 18:32:23,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-09 18:32:23,233 INFO L87 Difference]: Start difference. First operand has 103 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 93 states have internal predecessors, (138), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-09 18:32:23,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:23,689 INFO L93 Difference]: Finished difference Result 285 states and 462 transitions. [2024-11-09 18:32:23,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 18:32:23,692 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) Word has length 37 [2024-11-09 18:32:23,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:23,705 INFO L225 Difference]: With dead ends: 285 [2024-11-09 18:32:23,706 INFO L226 Difference]: Without dead ends: 179 [2024-11-09 18:32:23,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2024-11-09 18:32:23,713 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 127 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:23,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1338 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:32:23,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-09 18:32:23,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 170. [2024-11-09 18:32:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 148 states have (on average 1.4189189189189189) internal successors, (210), 149 states have internal predecessors, (210), 18 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (24), 20 states have call predecessors, (24), 17 states have call successors, (24) [2024-11-09 18:32:23,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 252 transitions. [2024-11-09 18:32:23,780 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 252 transitions. Word has length 37 [2024-11-09 18:32:23,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:23,781 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 252 transitions. [2024-11-09 18:32:23,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-09 18:32:23,782 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 252 transitions. [2024-11-09 18:32:23,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 18:32:23,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:23,788 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:23,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 18:32:23,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-09 18:32:23,989 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:23,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:23,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1203382167, now seen corresponding path program 1 times [2024-11-09 18:32:23,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:23,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422666679] [2024-11-09 18:32:23,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:23,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:24,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:24,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:24,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:24,205 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:32:24,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:24,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422666679] [2024-11-09 18:32:24,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422666679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:24,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:24,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 18:32:24,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063542629] [2024-11-09 18:32:24,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:24,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 18:32:24,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:24,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 18:32:24,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:32:24,209 INFO L87 Difference]: Start difference. First operand 170 states and 252 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:24,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:24,376 INFO L93 Difference]: Finished difference Result 344 states and 512 transitions. [2024-11-09 18:32:24,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 18:32:24,377 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2024-11-09 18:32:24,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:24,379 INFO L225 Difference]: With dead ends: 344 [2024-11-09 18:32:24,379 INFO L226 Difference]: Without dead ends: 236 [2024-11-09 18:32:24,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 18:32:24,381 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 34 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:24,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 720 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:24,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-09 18:32:24,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2024-11-09 18:32:24,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 208 states have (on average 1.3942307692307692) internal successors, (290), 207 states have internal predecessors, (290), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (28), 28 states have call predecessors, (28), 21 states have call successors, (28) [2024-11-09 18:32:24,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 340 transitions. [2024-11-09 18:32:24,400 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 340 transitions. Word has length 41 [2024-11-09 18:32:24,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:24,401 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 340 transitions. [2024-11-09 18:32:24,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:24,401 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 340 transitions. [2024-11-09 18:32:24,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 18:32:24,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:24,404 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:24,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 18:32:24,405 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:24,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:24,405 INFO L85 PathProgramCache]: Analyzing trace with hash 2025119902, now seen corresponding path program 1 times [2024-11-09 18:32:24,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:24,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900336112] [2024-11-09 18:32:24,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:24,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:24,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:24,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:24,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:24,483 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:24,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:24,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900336112] [2024-11-09 18:32:24,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900336112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:24,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:24,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:32:24,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278150010] [2024-11-09 18:32:24,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:24,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:32:24,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:24,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:32:24,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:24,488 INFO L87 Difference]: Start difference. First operand 234 states and 340 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:24,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:24,539 INFO L93 Difference]: Finished difference Result 402 states and 586 transitions. [2024-11-09 18:32:24,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:32:24,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-09 18:32:24,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:24,543 INFO L225 Difference]: With dead ends: 402 [2024-11-09 18:32:24,543 INFO L226 Difference]: Without dead ends: 331 [2024-11-09 18:32:24,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:24,548 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 38 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:24,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 460 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:24,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-09 18:32:24,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2024-11-09 18:32:24,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 299 states have (on average 1.3678929765886287) internal successors, (409), 298 states have internal predecessors, (409), 28 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (34), 34 states have call predecessors, (34), 27 states have call successors, (34) [2024-11-09 18:32:24,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 471 transitions. [2024-11-09 18:32:24,580 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 471 transitions. Word has length 44 [2024-11-09 18:32:24,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:24,581 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 471 transitions. [2024-11-09 18:32:24,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:24,582 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 471 transitions. [2024-11-09 18:32:24,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 18:32:24,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:24,586 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:24,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 18:32:24,587 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:24,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:24,587 INFO L85 PathProgramCache]: Analyzing trace with hash -672813160, now seen corresponding path program 1 times [2024-11-09 18:32:24,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:24,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702539109] [2024-11-09 18:32:24,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:24,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:24,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:24,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 18:32:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:24,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:24,752 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 18:32:24,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:24,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702539109] [2024-11-09 18:32:24,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702539109] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:24,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211590458] [2024-11-09 18:32:24,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:24,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:24,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:24,778 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:32:24,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 18:32:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:24,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 18:32:24,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:24,872 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:24,872 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:24,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211590458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:24,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:32:24,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-09 18:32:24,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673014581] [2024-11-09 18:32:24,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:24,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:32:24,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:24,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:32:24,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:32:24,875 INFO L87 Difference]: Start difference. First operand 331 states and 471 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:24,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:24,925 INFO L93 Difference]: Finished difference Result 430 states and 617 transitions. [2024-11-09 18:32:24,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:32:24,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2024-11-09 18:32:24,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:24,929 INFO L225 Difference]: With dead ends: 430 [2024-11-09 18:32:24,929 INFO L226 Difference]: Without dead ends: 359 [2024-11-09 18:32:24,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:32:24,930 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 40 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 290 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-11-09 18:32:24,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 290 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:24,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-09 18:32:24,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-11-09 18:32:24,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 328 states have (on average 1.3475609756097562) internal successors, (442), 325 states have internal predecessors, (442), 27 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (33), 33 states have call predecessors, (33), 26 states have call successors, (33) [2024-11-09 18:32:24,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 502 transitions. [2024-11-09 18:32:24,961 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 502 transitions. Word has length 45 [2024-11-09 18:32:24,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:24,961 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 502 transitions. [2024-11-09 18:32:24,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:24,962 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 502 transitions. [2024-11-09 18:32:24,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 18:32:24,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:24,964 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:24,982 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-11-09 18:32:25,167 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,SelfDestructingSolverStorable3 [2024-11-09 18:32:25,168 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:25,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:25,169 INFO L85 PathProgramCache]: Analyzing trace with hash -895212698, now seen corresponding path program 1 times [2024-11-09 18:32:25,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:25,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053247492] [2024-11-09 18:32:25,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:25,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:25,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:25,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053247492] [2024-11-09 18:32:25,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053247492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:25,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:25,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:32:25,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287541685] [2024-11-09 18:32:25,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:25,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:32:25,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:25,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:32:25,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:25,242 INFO L87 Difference]: Start difference. First operand 359 states and 502 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:25,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:25,286 INFO L93 Difference]: Finished difference Result 371 states and 515 transitions. [2024-11-09 18:32:25,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:32:25,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-09 18:32:25,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:25,290 INFO L225 Difference]: With dead ends: 371 [2024-11-09 18:32:25,291 INFO L226 Difference]: Without dead ends: 363 [2024-11-09 18:32:25,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:25,292 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:25,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 396 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:25,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-09 18:32:25,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2024-11-09 18:32:25,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 332 states have (on average 1.3433734939759037) internal successors, (446), 329 states have internal predecessors, (446), 27 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (33), 33 states have call predecessors, (33), 26 states have call successors, (33) [2024-11-09 18:32:25,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 506 transitions. [2024-11-09 18:32:25,307 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 506 transitions. Word has length 46 [2024-11-09 18:32:25,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:25,307 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 506 transitions. [2024-11-09 18:32:25,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:25,308 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 506 transitions. [2024-11-09 18:32:25,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 18:32:25,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:25,309 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:25,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 18:32:25,309 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:25,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:25,310 INFO L85 PathProgramCache]: Analyzing trace with hash 847597637, now seen corresponding path program 1 times [2024-11-09 18:32:25,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:25,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212488435] [2024-11-09 18:32:25,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:25,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,369 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:25,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:25,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212488435] [2024-11-09 18:32:25,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212488435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:25,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:25,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 18:32:25,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350113920] [2024-11-09 18:32:25,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:25,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 18:32:25,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:25,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 18:32:25,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:32:25,372 INFO L87 Difference]: Start difference. First operand 363 states and 506 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:25,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:25,427 INFO L93 Difference]: Finished difference Result 371 states and 513 transitions. [2024-11-09 18:32:25,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 18:32:25,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-09 18:32:25,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:25,431 INFO L225 Difference]: With dead ends: 371 [2024-11-09 18:32:25,431 INFO L226 Difference]: Without dead ends: 363 [2024-11-09 18:32:25,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:32:25,436 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 3 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:25,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 526 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:25,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-09 18:32:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 359. [2024-11-09 18:32:25,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 328 states have (on average 1.3384146341463414) internal successors, (439), 325 states have internal predecessors, (439), 27 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (33), 33 states have call predecessors, (33), 26 states have call successors, (33) [2024-11-09 18:32:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 499 transitions. [2024-11-09 18:32:25,454 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 499 transitions. Word has length 46 [2024-11-09 18:32:25,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:25,455 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 499 transitions. [2024-11-09 18:32:25,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:25,456 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 499 transitions. [2024-11-09 18:32:25,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 18:32:25,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:25,457 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:25,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 18:32:25,458 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:25,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:25,459 INFO L85 PathProgramCache]: Analyzing trace with hash 491672897, now seen corresponding path program 1 times [2024-11-09 18:32:25,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:25,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585558348] [2024-11-09 18:32:25,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:25,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,637 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:32:25,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:25,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585558348] [2024-11-09 18:32:25,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585558348] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:25,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072902762] [2024-11-09 18:32:25,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:25,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:25,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:25,640 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:32:25,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 18:32:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 18:32:25,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:25,872 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 18:32:25,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:26,022 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:26,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072902762] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:26,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:32:26,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 11] total 16 [2024-11-09 18:32:26,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416237773] [2024-11-09 18:32:26,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:26,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 18:32:26,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:26,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 18:32:26,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-09 18:32:26,024 INFO L87 Difference]: Start difference. First operand 359 states and 499 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:26,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:26,190 INFO L93 Difference]: Finished difference Result 595 states and 828 transitions. [2024-11-09 18:32:26,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 18:32:26,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-09 18:32:26,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:26,194 INFO L225 Difference]: With dead ends: 595 [2024-11-09 18:32:26,194 INFO L226 Difference]: Without dead ends: 450 [2024-11-09 18:32:26,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-09 18:32:26,195 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 45 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:26,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 552 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:26,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-09 18:32:26,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 371. [2024-11-09 18:32:26,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 340 states have (on average 1.326470588235294) internal successors, (451), 337 states have internal predecessors, (451), 27 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (33), 33 states have call predecessors, (33), 26 states have call successors, (33) [2024-11-09 18:32:26,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 511 transitions. [2024-11-09 18:32:26,219 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 511 transitions. Word has length 46 [2024-11-09 18:32:26,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:26,220 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 511 transitions. [2024-11-09 18:32:26,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:26,220 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 511 transitions. [2024-11-09 18:32:26,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 18:32:26,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:26,222 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:26,241 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-11-09 18:32:26,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:26,426 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:26,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:26,427 INFO L85 PathProgramCache]: Analyzing trace with hash -13885728, now seen corresponding path program 1 times [2024-11-09 18:32:26,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:26,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678807805] [2024-11-09 18:32:26,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:26,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:26,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:26,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:26,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:26,637 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 18:32:26,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:26,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678807805] [2024-11-09 18:32:26,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678807805] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:26,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132744942] [2024-11-09 18:32:26,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:26,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:26,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:26,640 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:32:26,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 18:32:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:26,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 18:32:26,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:26,761 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 18:32:26,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:26,983 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 18:32:26,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132744942] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:32:26,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:32:26,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 19 [2024-11-09 18:32:26,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782296265] [2024-11-09 18:32:26,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:32:26,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 18:32:26,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:26,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 18:32:26,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-11-09 18:32:26,985 INFO L87 Difference]: Start difference. First operand 371 states and 511 transitions. Second operand has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 15 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 18:32:27,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:27,229 INFO L93 Difference]: Finished difference Result 533 states and 743 transitions. [2024-11-09 18:32:27,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 18:32:27,230 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 15 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2024-11-09 18:32:27,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:27,232 INFO L225 Difference]: With dead ends: 533 [2024-11-09 18:32:27,232 INFO L226 Difference]: Without dead ends: 401 [2024-11-09 18:32:27,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-11-09 18:32:27,235 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 17 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:27,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1604 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:32:27,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-09 18:32:27,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 389. [2024-11-09 18:32:27,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 357 states have (on average 1.3137254901960784) internal successors, (469), 353 states have internal predecessors, (469), 27 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (40), 35 states have call predecessors, (40), 26 states have call successors, (40) [2024-11-09 18:32:27,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 536 transitions. [2024-11-09 18:32:27,250 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 536 transitions. Word has length 46 [2024-11-09 18:32:27,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:27,252 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 536 transitions. [2024-11-09 18:32:27,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 15 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 18:32:27,252 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 536 transitions. [2024-11-09 18:32:27,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 18:32:27,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:27,253 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:27,271 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-11-09 18:32:27,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:27,458 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:27,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:27,458 INFO L85 PathProgramCache]: Analyzing trace with hash -880009192, now seen corresponding path program 1 times [2024-11-09 18:32:27,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:27,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739943293] [2024-11-09 18:32:27,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:27,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:27,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:27,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:27,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:27,518 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:27,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:27,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739943293] [2024-11-09 18:32:27,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739943293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:27,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:27,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:32:27,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838482628] [2024-11-09 18:32:27,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:27,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:32:27,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:27,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:32:27,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:27,520 INFO L87 Difference]: Start difference. First operand 389 states and 536 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-11-09 18:32:27,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:27,571 INFO L93 Difference]: Finished difference Result 625 states and 862 transitions. [2024-11-09 18:32:27,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:32:27,572 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 47 [2024-11-09 18:32:27,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:27,575 INFO L225 Difference]: With dead ends: 625 [2024-11-09 18:32:27,576 INFO L226 Difference]: Without dead ends: 582 [2024-11-09 18:32:27,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:27,579 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 52 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:27,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 459 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:27,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-11-09 18:32:27,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 430. [2024-11-09 18:32:27,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 395 states have (on average 1.3189873417721518) internal successors, (521), 391 states have internal predecessors, (521), 30 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (43), 38 states have call predecessors, (43), 29 states have call successors, (43) [2024-11-09 18:32:27,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 594 transitions. [2024-11-09 18:32:27,600 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 594 transitions. Word has length 47 [2024-11-09 18:32:27,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:27,601 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 594 transitions. [2024-11-09 18:32:27,601 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-11-09 18:32:27,601 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 594 transitions. [2024-11-09 18:32:27,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 18:32:27,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:27,604 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] [2024-11-09 18:32:27,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 18:32:27,604 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:27,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:27,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1701928166, now seen corresponding path program 1 times [2024-11-09 18:32:27,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:27,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189092854] [2024-11-09 18:32:27,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:27,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:27,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:27,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 18:32:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:27,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:27,732 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 18:32:27,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:27,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189092854] [2024-11-09 18:32:27,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189092854] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:27,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623021838] [2024-11-09 18:32:27,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:27,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:27,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:27,734 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:32:27,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 18:32:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:27,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 18:32:27,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:27,839 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 18:32:27,840 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:27,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623021838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:27,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:32:27,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-09 18:32:27,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384064355] [2024-11-09 18:32:27,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:27,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:32:27,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:27,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:32:27,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:32:27,842 INFO L87 Difference]: Start difference. First operand 430 states and 594 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:27,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:27,913 INFO L93 Difference]: Finished difference Result 836 states and 1167 transitions. [2024-11-09 18:32:27,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:32:27,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2024-11-09 18:32:27,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:27,916 INFO L225 Difference]: With dead ends: 836 [2024-11-09 18:32:27,916 INFO L226 Difference]: Without dead ends: 448 [2024-11-09 18:32:27,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:32:27,918 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 19 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:27,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 357 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:27,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-09 18:32:27,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 437. [2024-11-09 18:32:27,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 401 states have (on average 1.319201995012469) internal successors, (529), 398 states have internal predecessors, (529), 30 states have call successors, (30), 2 states have call predecessors, (30), 5 states have return successors, (49), 38 states have call predecessors, (49), 29 states have call successors, (49) [2024-11-09 18:32:27,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 608 transitions. [2024-11-09 18:32:27,934 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 608 transitions. Word has length 47 [2024-11-09 18:32:27,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:27,934 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 608 transitions. [2024-11-09 18:32:27,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:27,935 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 608 transitions. [2024-11-09 18:32:27,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 18:32:27,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:27,936 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:27,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 18:32:28,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 18:32:28,141 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:28,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:28,141 INFO L85 PathProgramCache]: Analyzing trace with hash -691897662, now seen corresponding path program 1 times [2024-11-09 18:32:28,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:28,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707916120] [2024-11-09 18:32:28,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:28,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:28,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:28,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:28,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:32:28,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:28,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707916120] [2024-11-09 18:32:28,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707916120] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:28,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311953165] [2024-11-09 18:32:28,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:28,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:28,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:28,403 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:32:28,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 18:32:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:28,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 18:32:28,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:32:28,562 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:28,659 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:28,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311953165] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:28,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:32:28,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 11] total 15 [2024-11-09 18:32:28,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269225916] [2024-11-09 18:32:28,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:28,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 18:32:28,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:28,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 18:32:28,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-09 18:32:28,661 INFO L87 Difference]: Start difference. First operand 437 states and 608 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:28,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:28,836 INFO L93 Difference]: Finished difference Result 636 states and 889 transitions. [2024-11-09 18:32:28,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 18:32:28,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-09 18:32:28,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:28,840 INFO L225 Difference]: With dead ends: 636 [2024-11-09 18:32:28,840 INFO L226 Difference]: Without dead ends: 597 [2024-11-09 18:32:28,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-09 18:32:28,841 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 48 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:28,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 531 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:32:28,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-11-09 18:32:28,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 541. [2024-11-09 18:32:28,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 495 states have (on average 1.3111111111111111) internal successors, (649), 493 states have internal predecessors, (649), 40 states have call successors, (40), 2 states have call predecessors, (40), 5 states have return successors, (59), 48 states have call predecessors, (59), 39 states have call successors, (59) [2024-11-09 18:32:28,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 748 transitions. [2024-11-09 18:32:28,862 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 748 transitions. Word has length 50 [2024-11-09 18:32:28,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:28,862 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 748 transitions. [2024-11-09 18:32:28,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:28,862 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 748 transitions. [2024-11-09 18:32:28,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 18:32:28,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:28,864 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:28,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 18:32:29,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:29,065 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:29,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:29,065 INFO L85 PathProgramCache]: Analyzing trace with hash -562814943, now seen corresponding path program 1 times [2024-11-09 18:32:29,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:29,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519706620] [2024-11-09 18:32:29,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:29,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:29,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:29,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:29,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:29,116 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:29,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:29,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519706620] [2024-11-09 18:32:29,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519706620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:29,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:29,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:32:29,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950792897] [2024-11-09 18:32:29,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:29,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:32:29,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:29,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:32:29,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:29,118 INFO L87 Difference]: Start difference. First operand 541 states and 748 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:29,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:29,155 INFO L93 Difference]: Finished difference Result 557 states and 765 transitions. [2024-11-09 18:32:29,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:32:29,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-09 18:32:29,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:29,159 INFO L225 Difference]: With dead ends: 557 [2024-11-09 18:32:29,159 INFO L226 Difference]: Without dead ends: 498 [2024-11-09 18:32:29,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:29,160 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:29,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 393 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:29,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-11-09 18:32:29,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2024-11-09 18:32:29,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 452 states have (on average 1.3207964601769913) internal successors, (597), 452 states have internal predecessors, (597), 40 states have call successors, (40), 2 states have call predecessors, (40), 5 states have return successors, (57), 46 states have call predecessors, (57), 39 states have call successors, (57) [2024-11-09 18:32:29,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 694 transitions. [2024-11-09 18:32:29,177 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 694 transitions. Word has length 50 [2024-11-09 18:32:29,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:29,178 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 694 transitions. [2024-11-09 18:32:29,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:29,178 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 694 transitions. [2024-11-09 18:32:29,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 18:32:29,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:29,180 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:29,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 18:32:29,180 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:29,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:29,180 INFO L85 PathProgramCache]: Analyzing trace with hash 102044314, now seen corresponding path program 1 times [2024-11-09 18:32:29,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:29,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505039063] [2024-11-09 18:32:29,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:29,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:29,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:29,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:29,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:29,219 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:32:29,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:29,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505039063] [2024-11-09 18:32:29,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505039063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:29,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:29,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:32:29,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776400152] [2024-11-09 18:32:29,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:29,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:32:29,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:29,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:32:29,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:32:29,221 INFO L87 Difference]: Start difference. First operand 498 states and 694 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), 1 states have call successors, (3) [2024-11-09 18:32:29,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:29,279 INFO L93 Difference]: Finished difference Result 991 states and 1386 transitions. [2024-11-09 18:32:29,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:32:29,280 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), 1 states have call successors, (3) Word has length 50 [2024-11-09 18:32:29,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:29,282 INFO L225 Difference]: With dead ends: 991 [2024-11-09 18:32:29,282 INFO L226 Difference]: Without dead ends: 506 [2024-11-09 18:32:29,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:32:29,285 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 12 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:29,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 240 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:29,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-09 18:32:29,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 500. [2024-11-09 18:32:29,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 454 states have (on average 1.3193832599118942) internal successors, (599), 454 states have internal predecessors, (599), 40 states have call successors, (40), 2 states have call predecessors, (40), 5 states have return successors, (57), 46 states have call predecessors, (57), 39 states have call successors, (57) [2024-11-09 18:32:29,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 696 transitions. [2024-11-09 18:32:29,315 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 696 transitions. Word has length 50 [2024-11-09 18:32:29,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:29,315 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 696 transitions. [2024-11-09 18:32:29,315 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), 1 states have call successors, (3) [2024-11-09 18:32:29,316 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 696 transitions. [2024-11-09 18:32:29,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 18:32:29,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:29,317 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:29,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 18:32:29,318 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:29,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:29,318 INFO L85 PathProgramCache]: Analyzing trace with hash 676722845, now seen corresponding path program 1 times [2024-11-09 18:32:29,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:29,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759387728] [2024-11-09 18:32:29,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:29,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:29,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:29,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:29,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:29,363 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:32:29,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:29,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759387728] [2024-11-09 18:32:29,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759387728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:29,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:29,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:32:29,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100571176] [2024-11-09 18:32:29,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:29,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:32:29,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:29,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:32:29,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:32:29,366 INFO L87 Difference]: Start difference. First operand 500 states and 696 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), 1 states have call successors, (3) [2024-11-09 18:32:29,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:29,412 INFO L93 Difference]: Finished difference Result 993 states and 1387 transitions. [2024-11-09 18:32:29,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:32:29,413 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), 1 states have call successors, (3) Word has length 51 [2024-11-09 18:32:29,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:29,415 INFO L225 Difference]: With dead ends: 993 [2024-11-09 18:32:29,415 INFO L226 Difference]: Without dead ends: 506 [2024-11-09 18:32:29,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:32:29,417 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 6 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:29,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 247 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:29,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-09 18:32:29,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 502. [2024-11-09 18:32:29,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 456 states have (on average 1.3179824561403508) internal successors, (601), 456 states have internal predecessors, (601), 40 states have call successors, (40), 2 states have call predecessors, (40), 5 states have return successors, (57), 46 states have call predecessors, (57), 39 states have call successors, (57) [2024-11-09 18:32:29,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 698 transitions. [2024-11-09 18:32:29,434 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 698 transitions. Word has length 51 [2024-11-09 18:32:29,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:29,434 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 698 transitions. [2024-11-09 18:32:29,434 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), 1 states have call successors, (3) [2024-11-09 18:32:29,434 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 698 transitions. [2024-11-09 18:32:29,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 18:32:29,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:29,435 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] [2024-11-09 18:32:29,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 18:32:29,436 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:29,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:29,436 INFO L85 PathProgramCache]: Analyzing trace with hash -660427242, now seen corresponding path program 1 times [2024-11-09 18:32:29,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:29,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19484558] [2024-11-09 18:32:29,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:29,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:29,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:29,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:29,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:29,546 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 18:32:29,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:29,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19484558] [2024-11-09 18:32:29,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19484558] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:29,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004022509] [2024-11-09 18:32:29,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:29,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:29,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:29,548 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:32:29,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 18:32:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:29,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 18:32:29,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:29,680 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 18:32:29,680 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:29,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004022509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:29,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:32:29,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 10 [2024-11-09 18:32:29,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707394608] [2024-11-09 18:32:29,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:29,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 18:32:29,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:29,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 18:32:29,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-09 18:32:29,682 INFO L87 Difference]: Start difference. First operand 502 states and 698 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:29,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:29,963 INFO L93 Difference]: Finished difference Result 1178 states and 1661 transitions. [2024-11-09 18:32:29,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 18:32:29,964 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 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 51 [2024-11-09 18:32:29,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:29,968 INFO L225 Difference]: With dead ends: 1178 [2024-11-09 18:32:29,968 INFO L226 Difference]: Without dead ends: 951 [2024-11-09 18:32:29,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-09 18:32:29,971 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 173 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:29,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1219 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:32:29,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2024-11-09 18:32:29,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 672. [2024-11-09 18:32:29,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 611 states have (on average 1.3355155482815058) internal successors, (816), 606 states have internal predecessors, (816), 55 states have call successors, (55), 2 states have call predecessors, (55), 5 states have return successors, (78), 66 states have call predecessors, (78), 54 states have call successors, (78) [2024-11-09 18:32:29,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 949 transitions. [2024-11-09 18:32:29,999 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 949 transitions. Word has length 51 [2024-11-09 18:32:30,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:30,000 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 949 transitions. [2024-11-09 18:32:30,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:30,000 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 949 transitions. [2024-11-09 18:32:30,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 18:32:30,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:30,003 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] [2024-11-09 18:32:30,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 18:32:30,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:30,204 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:30,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:30,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2013736939, now seen corresponding path program 1 times [2024-11-09 18:32:30,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:30,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138071299] [2024-11-09 18:32:30,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:30,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:30,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:30,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:30,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:30,352 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 18:32:30,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:30,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138071299] [2024-11-09 18:32:30,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138071299] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:30,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604545977] [2024-11-09 18:32:30,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:30,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:30,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:30,355 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:32:30,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 18:32:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:30,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 18:32:30,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:30,493 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 18:32:30,493 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:30,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604545977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:30,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:32:30,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 10 [2024-11-09 18:32:30,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181495002] [2024-11-09 18:32:30,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:30,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 18:32:30,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:30,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 18:32:30,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-09 18:32:30,496 INFO L87 Difference]: Start difference. First operand 672 states and 949 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:30,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:30,780 INFO L93 Difference]: Finished difference Result 937 states and 1319 transitions. [2024-11-09 18:32:30,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 18:32:30,781 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 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 51 [2024-11-09 18:32:30,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:30,784 INFO L225 Difference]: With dead ends: 937 [2024-11-09 18:32:30,784 INFO L226 Difference]: Without dead ends: 819 [2024-11-09 18:32:30,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-09 18:32:30,785 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 129 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:30,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1328 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:32:30,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2024-11-09 18:32:30,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 680. [2024-11-09 18:32:30,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 619 states have (on average 1.3279483037156705) internal successors, (822), 614 states have internal predecessors, (822), 55 states have call successors, (55), 2 states have call predecessors, (55), 5 states have return successors, (78), 66 states have call predecessors, (78), 54 states have call successors, (78) [2024-11-09 18:32:30,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 955 transitions. [2024-11-09 18:32:30,810 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 955 transitions. Word has length 51 [2024-11-09 18:32:30,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:30,811 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 955 transitions. [2024-11-09 18:32:30,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:30,811 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 955 transitions. [2024-11-09 18:32:30,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 18:32:30,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:30,812 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] [2024-11-09 18:32:30,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 18:32:31,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 18:32:31,017 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:31,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:31,017 INFO L85 PathProgramCache]: Analyzing trace with hash 484278998, now seen corresponding path program 1 times [2024-11-09 18:32:31,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:31,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051855272] [2024-11-09 18:32:31,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:31,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:31,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:31,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:31,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:31,189 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 18:32:31,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:31,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051855272] [2024-11-09 18:32:31,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051855272] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:31,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904910221] [2024-11-09 18:32:31,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:31,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:31,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:31,202 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:32:31,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 18:32:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:31,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 18:32:31,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 18:32:31,470 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:31,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904910221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:31,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:32:31,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 15 [2024-11-09 18:32:31,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932407883] [2024-11-09 18:32:31,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:31,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 18:32:31,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:31,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 18:32:31,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-09 18:32:31,472 INFO L87 Difference]: Start difference. First operand 680 states and 955 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:31,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:31,924 INFO L93 Difference]: Finished difference Result 826 states and 1150 transitions. [2024-11-09 18:32:31,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 18:32:31,924 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 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 51 [2024-11-09 18:32:31,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:31,928 INFO L225 Difference]: With dead ends: 826 [2024-11-09 18:32:31,928 INFO L226 Difference]: Without dead ends: 823 [2024-11-09 18:32:31,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 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-11-09 18:32:31,930 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 172 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 2052 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:31,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 2052 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:32:31,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2024-11-09 18:32:31,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 702. [2024-11-09 18:32:31,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 638 states have (on average 1.3244514106583072) internal successors, (845), 635 states have internal predecessors, (845), 57 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (80), 66 states have call predecessors, (80), 56 states have call successors, (80) [2024-11-09 18:32:31,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 982 transitions. [2024-11-09 18:32:31,954 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 982 transitions. Word has length 51 [2024-11-09 18:32:31,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:31,955 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 982 transitions. [2024-11-09 18:32:31,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:31,955 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 982 transitions. [2024-11-09 18:32:31,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 18:32:31,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:31,957 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-09 18:32:31,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 18:32:32,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 18:32:32,162 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:32,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:32,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1085244285, now seen corresponding path program 1 times [2024-11-09 18:32:32,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:32,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355080783] [2024-11-09 18:32:32,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:32,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:32,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:32,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 18:32:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:32,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 18:32:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:32,262 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 18:32:32,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:32,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355080783] [2024-11-09 18:32:32,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355080783] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:32,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240854356] [2024-11-09 18:32:32,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:32,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:32,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:32,264 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:32:32,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 18:32:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:32,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 18:32:32,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:32,365 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 18:32:32,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:32,453 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 18:32:32,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240854356] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:32:32,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:32:32,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-09 18:32:32,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659458636] [2024-11-09 18:32:32,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:32:32,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 18:32:32,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:32,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 18:32:32,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-09 18:32:32,456 INFO L87 Difference]: Start difference. First operand 702 states and 982 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 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-11-09 18:32:32,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:32,700 INFO L93 Difference]: Finished difference Result 1263 states and 1768 transitions. [2024-11-09 18:32:32,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 18:32:32,701 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 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 51 [2024-11-09 18:32:32,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:32,703 INFO L225 Difference]: With dead ends: 1263 [2024-11-09 18:32:32,703 INFO L226 Difference]: Without dead ends: 564 [2024-11-09 18:32:32,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2024-11-09 18:32:32,706 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 282 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:32,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 375 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:32,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2024-11-09 18:32:32,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 508. [2024-11-09 18:32:32,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 460 states have (on average 1.3304347826086957) internal successors, (612), 460 states have internal predecessors, (612), 41 states have call successors, (41), 3 states have call predecessors, (41), 6 states have return successors, (50), 46 states have call predecessors, (50), 40 states have call successors, (50) [2024-11-09 18:32:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 703 transitions. [2024-11-09 18:32:32,728 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 703 transitions. Word has length 51 [2024-11-09 18:32:32,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:32,729 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 703 transitions. [2024-11-09 18:32:32,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 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-11-09 18:32:32,729 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 703 transitions. [2024-11-09 18:32:32,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 18:32:32,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:32,730 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:32,747 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-11-09 18:32:32,933 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,SelfDestructingSolverStorable17 [2024-11-09 18:32:32,934 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:32,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:32,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1501941594, now seen corresponding path program 1 times [2024-11-09 18:32:32,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:32,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509791677] [2024-11-09 18:32:32,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:32,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:32,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:32,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:32,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:33,008 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:32:33,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:33,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509791677] [2024-11-09 18:32:33,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509791677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:33,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:33,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:32:33,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589039496] [2024-11-09 18:32:33,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:33,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:32:33,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:33,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:32:33,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:33,011 INFO L87 Difference]: Start difference. First operand 508 states and 703 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:33,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:33,077 INFO L93 Difference]: Finished difference Result 958 states and 1327 transitions. [2024-11-09 18:32:33,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 18:32:33,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-11-09 18:32:33,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:33,079 INFO L225 Difference]: With dead ends: 958 [2024-11-09 18:32:33,079 INFO L226 Difference]: Without dead ends: 515 [2024-11-09 18:32:33,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:32:33,081 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 10 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:33,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 368 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:33,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-11-09 18:32:33,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 506. [2024-11-09 18:32:33,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 458 states have (on average 1.3296943231441047) internal successors, (609), 458 states have internal predecessors, (609), 41 states have call successors, (41), 3 states have call predecessors, (41), 6 states have return successors, (50), 46 states have call predecessors, (50), 40 states have call successors, (50) [2024-11-09 18:32:33,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 700 transitions. [2024-11-09 18:32:33,099 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 700 transitions. Word has length 52 [2024-11-09 18:32:33,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:33,099 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 700 transitions. [2024-11-09 18:32:33,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:33,099 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 700 transitions. [2024-11-09 18:32:33,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 18:32:33,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:33,100 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:33,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 18:32:33,100 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:33,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:33,100 INFO L85 PathProgramCache]: Analyzing trace with hash 925416508, now seen corresponding path program 1 times [2024-11-09 18:32:33,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:33,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556261759] [2024-11-09 18:32:33,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:33,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:33,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:33,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:33,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:33,240 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:32:33,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:33,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556261759] [2024-11-09 18:32:33,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556261759] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:33,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991655241] [2024-11-09 18:32:33,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:33,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:33,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:33,243 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:32:33,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 18:32:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:33,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 18:32:33,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:33,886 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 18:32:33,886 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 18:32:34,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991655241] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:32:34,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:32:34,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 26 [2024-11-09 18:32:34,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323279935] [2024-11-09 18:32:34,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:32:34,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 18:32:34,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:34,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 18:32:34,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2024-11-09 18:32:34,285 INFO L87 Difference]: Start difference. First operand 506 states and 700 transitions. Second operand has 26 states, 25 states have (on average 2.92) internal successors, (73), 22 states have internal predecessors, (73), 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-11-09 18:32:34,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:34,912 INFO L93 Difference]: Finished difference Result 553 states and 753 transitions. [2024-11-09 18:32:34,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 18:32:34,913 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.92) internal successors, (73), 22 states have internal predecessors, (73), 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 52 [2024-11-09 18:32:34,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:34,915 INFO L225 Difference]: With dead ends: 553 [2024-11-09 18:32:34,915 INFO L226 Difference]: Without dead ends: 504 [2024-11-09 18:32:34,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=955, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 18:32:34,917 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 57 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1705 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:34,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1705 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:32:34,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-11-09 18:32:34,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 476. [2024-11-09 18:32:34,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 431 states have (on average 1.3271461716937354) internal successors, (572), 431 states have internal predecessors, (572), 38 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (47), 43 states have call predecessors, (47), 37 states have call successors, (47) [2024-11-09 18:32:34,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 657 transitions. [2024-11-09 18:32:34,936 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 657 transitions. Word has length 52 [2024-11-09 18:32:34,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:34,936 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 657 transitions. [2024-11-09 18:32:34,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.92) internal successors, (73), 22 states have internal predecessors, (73), 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-11-09 18:32:34,936 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 657 transitions. [2024-11-09 18:32:34,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 18:32:34,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:34,937 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:34,954 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-11-09 18:32:35,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:35,138 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:35,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:35,139 INFO L85 PathProgramCache]: Analyzing trace with hash -868817867, now seen corresponding path program 1 times [2024-11-09 18:32:35,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:35,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093025795] [2024-11-09 18:32:35,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:35,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:35,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:35,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:35,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:35,309 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:35,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:35,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093025795] [2024-11-09 18:32:35,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093025795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:35,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:35,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 18:32:35,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198587802] [2024-11-09 18:32:35,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:35,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 18:32:35,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:35,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 18:32:35,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 18:32:35,311 INFO L87 Difference]: Start difference. First operand 476 states and 657 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:35,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:35,599 INFO L93 Difference]: Finished difference Result 693 states and 972 transitions. [2024-11-09 18:32:35,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 18:32:35,600 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (4), 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 53 [2024-11-09 18:32:35,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:35,603 INFO L225 Difference]: With dead ends: 693 [2024-11-09 18:32:35,603 INFO L226 Difference]: Without dead ends: 668 [2024-11-09 18:32:35,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 18:32:35,604 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 74 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:35,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 847 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:32:35,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2024-11-09 18:32:35,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 534. [2024-11-09 18:32:35,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 483 states have (on average 1.3312629399585922) internal successors, (643), 484 states have internal predecessors, (643), 44 states have call successors, (44), 3 states have call predecessors, (44), 6 states have return successors, (53), 49 states have call predecessors, (53), 43 states have call successors, (53) [2024-11-09 18:32:35,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 740 transitions. [2024-11-09 18:32:35,623 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 740 transitions. Word has length 53 [2024-11-09 18:32:35,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:35,623 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 740 transitions. [2024-11-09 18:32:35,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:35,624 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 740 transitions. [2024-11-09 18:32:35,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 18:32:35,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:35,625 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:35,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 18:32:35,625 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:35,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:35,626 INFO L85 PathProgramCache]: Analyzing trace with hash -952794091, now seen corresponding path program 1 times [2024-11-09 18:32:35,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:35,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527154533] [2024-11-09 18:32:35,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:35,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:35,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:35,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:35,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:35,689 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:35,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:35,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527154533] [2024-11-09 18:32:35,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527154533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:35,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:35,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 18:32:35,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515718203] [2024-11-09 18:32:35,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:35,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 18:32:35,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:35,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 18:32:35,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:32:35,692 INFO L87 Difference]: Start difference. First operand 534 states and 740 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:35,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:35,833 INFO L93 Difference]: Finished difference Result 571 states and 785 transitions. [2024-11-09 18:32:35,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 18:32:35,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 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 53 [2024-11-09 18:32:35,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:35,836 INFO L225 Difference]: With dead ends: 571 [2024-11-09 18:32:35,836 INFO L226 Difference]: Without dead ends: 545 [2024-11-09 18:32:35,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:32:35,839 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 46 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:35,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 568 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:35,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-11-09 18:32:35,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 541. [2024-11-09 18:32:35,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 488 states have (on average 1.3360655737704918) internal successors, (652), 489 states have internal predecessors, (652), 46 states have call successors, (46), 3 states have call predecessors, (46), 6 states have return successors, (55), 51 states have call predecessors, (55), 45 states have call successors, (55) [2024-11-09 18:32:35,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 753 transitions. [2024-11-09 18:32:35,863 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 753 transitions. Word has length 53 [2024-11-09 18:32:35,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:35,866 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 753 transitions. [2024-11-09 18:32:35,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:35,866 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 753 transitions. [2024-11-09 18:32:35,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 18:32:35,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:35,868 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:35,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 18:32:35,868 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:35,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:35,868 INFO L85 PathProgramCache]: Analyzing trace with hash -885787338, now seen corresponding path program 1 times [2024-11-09 18:32:35,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:35,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604192646] [2024-11-09 18:32:35,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:35,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:35,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:35,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:35,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:35,911 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:35,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:35,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604192646] [2024-11-09 18:32:35,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604192646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:35,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:35,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:32:35,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026606732] [2024-11-09 18:32:35,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:35,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:32:35,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:35,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:32:35,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:35,914 INFO L87 Difference]: Start difference. First operand 541 states and 753 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:35,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:35,956 INFO L93 Difference]: Finished difference Result 586 states and 807 transitions. [2024-11-09 18:32:35,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:32:35,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 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 53 [2024-11-09 18:32:35,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:35,959 INFO L225 Difference]: With dead ends: 586 [2024-11-09 18:32:35,959 INFO L226 Difference]: Without dead ends: 541 [2024-11-09 18:32:35,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:35,960 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 49 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:35,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 378 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:35,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-11-09 18:32:35,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2024-11-09 18:32:35,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 488 states have (on average 1.3032786885245902) internal successors, (636), 489 states have internal predecessors, (636), 46 states have call successors, (46), 3 states have call predecessors, (46), 6 states have return successors, (55), 51 states have call predecessors, (55), 45 states have call successors, (55) [2024-11-09 18:32:35,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 737 transitions. [2024-11-09 18:32:35,978 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 737 transitions. Word has length 53 [2024-11-09 18:32:35,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:35,978 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 737 transitions. [2024-11-09 18:32:35,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:35,979 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 737 transitions. [2024-11-09 18:32:35,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 18:32:35,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:35,980 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:35,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 18:32:35,980 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:35,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:35,981 INFO L85 PathProgramCache]: Analyzing trace with hash -142435144, now seen corresponding path program 1 times [2024-11-09 18:32:35,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:35,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136052131] [2024-11-09 18:32:35,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:35,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:36,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:36,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:36,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:36,213 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 18:32:36,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:36,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136052131] [2024-11-09 18:32:36,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136052131] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:36,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721792784] [2024-11-09 18:32:36,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:36,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:36,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:36,216 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:32:36,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 18:32:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:36,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 18:32:36,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:36,429 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:32:36,429 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:36,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721792784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:36,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:32:36,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 20 [2024-11-09 18:32:36,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614021578] [2024-11-09 18:32:36,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:36,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 18:32:36,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:36,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 18:32:36,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2024-11-09 18:32:36,431 INFO L87 Difference]: Start difference. First operand 541 states and 737 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:36,755 INFO L93 Difference]: Finished difference Result 856 states and 1163 transitions. [2024-11-09 18:32:36,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 18:32:36,756 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 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 55 [2024-11-09 18:32:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:36,759 INFO L225 Difference]: With dead ends: 856 [2024-11-09 18:32:36,759 INFO L226 Difference]: Without dead ends: 778 [2024-11-09 18:32:36,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2024-11-09 18:32:36,761 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 111 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1381 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:36,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1381 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:32:36,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2024-11-09 18:32:36,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 690. [2024-11-09 18:32:36,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 622 states have (on average 1.2958199356913183) internal successors, (806), 627 states have internal predecessors, (806), 61 states have call successors, (61), 3 states have call predecessors, (61), 6 states have return successors, (69), 65 states have call predecessors, (69), 59 states have call successors, (69) [2024-11-09 18:32:36,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 936 transitions. [2024-11-09 18:32:36,785 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 936 transitions. Word has length 55 [2024-11-09 18:32:36,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:36,786 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 936 transitions. [2024-11-09 18:32:36,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:36,787 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 936 transitions. [2024-11-09 18:32:36,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 18:32:36,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:36,788 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:36,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-09 18:32:36,993 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,SelfDestructingSolverStorable23 [2024-11-09 18:32:36,994 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:36,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:36,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1600375191, now seen corresponding path program 1 times [2024-11-09 18:32:36,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:36,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134664338] [2024-11-09 18:32:36,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:36,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,035 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:37,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:37,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134664338] [2024-11-09 18:32:37,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134664338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:37,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:37,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:32:37,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417257174] [2024-11-09 18:32:37,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:37,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:32:37,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:37,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:32:37,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:37,037 INFO L87 Difference]: Start difference. First operand 690 states and 936 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:37,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:37,069 INFO L93 Difference]: Finished difference Result 700 states and 945 transitions. [2024-11-09 18:32:37,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:32:37,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2024-11-09 18:32:37,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:37,073 INFO L225 Difference]: With dead ends: 700 [2024-11-09 18:32:37,073 INFO L226 Difference]: Without dead ends: 667 [2024-11-09 18:32:37,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:37,074 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:37,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 381 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:37,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2024-11-09 18:32:37,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 645. [2024-11-09 18:32:37,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 581 states have (on average 1.3029259896729777) internal successors, (757), 586 states have internal predecessors, (757), 57 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (64), 60 states have call predecessors, (64), 55 states have call successors, (64) [2024-11-09 18:32:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 878 transitions. [2024-11-09 18:32:37,121 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 878 transitions. Word has length 55 [2024-11-09 18:32:37,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:37,121 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 878 transitions. [2024-11-09 18:32:37,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:37,122 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 878 transitions. [2024-11-09 18:32:37,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 18:32:37,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:37,123 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:37,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 18:32:37,123 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:37,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:37,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1289569539, now seen corresponding path program 1 times [2024-11-09 18:32:37,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:37,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584744253] [2024-11-09 18:32:37,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:37,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,348 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:37,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:37,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584744253] [2024-11-09 18:32:37,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584744253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:37,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:37,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 18:32:37,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390366888] [2024-11-09 18:32:37,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:37,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 18:32:37,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:37,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 18:32:37,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:32:37,351 INFO L87 Difference]: Start difference. First operand 645 states and 878 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:37,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:37,581 INFO L93 Difference]: Finished difference Result 870 states and 1189 transitions. [2024-11-09 18:32:37,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 18:32:37,581 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2024-11-09 18:32:37,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:37,585 INFO L225 Difference]: With dead ends: 870 [2024-11-09 18:32:37,585 INFO L226 Difference]: Without dead ends: 821 [2024-11-09 18:32:37,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 18:32:37,586 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 58 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:37,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 645 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:32:37,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2024-11-09 18:32:37,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 668. [2024-11-09 18:32:37,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 600 states have (on average 1.3116666666666668) internal successors, (787), 605 states have internal predecessors, (787), 61 states have call successors, (61), 3 states have call predecessors, (61), 6 states have return successors, (64), 63 states have call predecessors, (64), 59 states have call successors, (64) [2024-11-09 18:32:37,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 912 transitions. [2024-11-09 18:32:37,614 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 912 transitions. Word has length 55 [2024-11-09 18:32:37,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:37,614 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 912 transitions. [2024-11-09 18:32:37,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:37,615 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 912 transitions. [2024-11-09 18:32:37,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 18:32:37,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:37,616 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:37,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 18:32:37,616 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:37,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:37,617 INFO L85 PathProgramCache]: Analyzing trace with hash 29831996, now seen corresponding path program 1 times [2024-11-09 18:32:37,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:37,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101936950] [2024-11-09 18:32:37,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:37,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 18:32:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,790 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 18:32:37,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:37,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101936950] [2024-11-09 18:32:37,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101936950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:37,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528588315] [2024-11-09 18:32:37,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:37,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:37,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:37,793 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:32:37,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 18:32:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 18:32:37,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:38,075 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 18:32:38,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:38,826 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 18:32:38,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528588315] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:32:38,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:32:38,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 14] total 29 [2024-11-09 18:32:38,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893763155] [2024-11-09 18:32:38,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:32:38,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 18:32:38,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:38,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 18:32:38,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2024-11-09 18:32:38,828 INFO L87 Difference]: Start difference. First operand 668 states and 912 transitions. Second operand has 29 states, 27 states have (on average 3.037037037037037) internal successors, (82), 24 states have internal predecessors, (82), 7 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-09 18:32:40,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:40,139 INFO L93 Difference]: Finished difference Result 949 states and 1287 transitions. [2024-11-09 18:32:40,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-09 18:32:40,139 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 3.037037037037037) internal successors, (82), 24 states have internal predecessors, (82), 7 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) Word has length 57 [2024-11-09 18:32:40,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:40,142 INFO L225 Difference]: With dead ends: 949 [2024-11-09 18:32:40,142 INFO L226 Difference]: Without dead ends: 708 [2024-11-09 18:32:40,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=198, Invalid=1694, Unknown=0, NotChecked=0, Total=1892 [2024-11-09 18:32:40,144 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 264 mSDsluCounter, 2314 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 2424 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:40,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 2424 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 18:32:40,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2024-11-09 18:32:40,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 630. [2024-11-09 18:32:40,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 565 states have (on average 1.2938053097345132) internal successors, (731), 570 states have internal predecessors, (731), 57 states have call successors, (57), 4 states have call predecessors, (57), 7 states have return successors, (60), 59 states have call predecessors, (60), 55 states have call successors, (60) [2024-11-09 18:32:40,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 848 transitions. [2024-11-09 18:32:40,171 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 848 transitions. Word has length 57 [2024-11-09 18:32:40,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:40,172 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 848 transitions. [2024-11-09 18:32:40,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 3.037037037037037) internal successors, (82), 24 states have internal predecessors, (82), 7 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-09 18:32:40,172 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 848 transitions. [2024-11-09 18:32:40,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 18:32:40,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:40,175 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:40,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-09 18:32:40,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-09 18:32:40,376 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:40,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:40,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1502701326, now seen corresponding path program 1 times [2024-11-09 18:32:40,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:40,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586258995] [2024-11-09 18:32:40,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:40,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:40,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:40,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:40,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 18:32:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:40,557 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 18:32:40,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:40,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586258995] [2024-11-09 18:32:40,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586258995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:40,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:40,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 18:32:40,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687857996] [2024-11-09 18:32:40,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:40,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 18:32:40,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:40,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 18:32:40,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 18:32:40,559 INFO L87 Difference]: Start difference. First operand 630 states and 848 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:40,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:40,775 INFO L93 Difference]: Finished difference Result 763 states and 1025 transitions. [2024-11-09 18:32:40,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 18:32:40,775 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 57 [2024-11-09 18:32:40,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:40,778 INFO L225 Difference]: With dead ends: 763 [2024-11-09 18:32:40,778 INFO L226 Difference]: Without dead ends: 662 [2024-11-09 18:32:40,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-09 18:32:40,779 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 111 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:40,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1161 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:32:40,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-11-09 18:32:40,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 630. [2024-11-09 18:32:40,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 565 states have (on average 1.2902654867256638) internal successors, (729), 570 states have internal predecessors, (729), 57 states have call successors, (57), 4 states have call predecessors, (57), 7 states have return successors, (60), 59 states have call predecessors, (60), 55 states have call successors, (60) [2024-11-09 18:32:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 846 transitions. [2024-11-09 18:32:40,808 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 846 transitions. Word has length 57 [2024-11-09 18:32:40,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:40,808 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 846 transitions. [2024-11-09 18:32:40,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:40,809 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 846 transitions. [2024-11-09 18:32:40,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 18:32:40,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:40,810 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:40,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 18:32:40,810 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:40,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:40,810 INFO L85 PathProgramCache]: Analyzing trace with hash -357995086, now seen corresponding path program 1 times [2024-11-09 18:32:40,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:40,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676310972] [2024-11-09 18:32:40,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:40,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:41,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:41,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:41,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 18:32:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:41,202 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 18:32:41,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:41,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676310972] [2024-11-09 18:32:41,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676310972] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:41,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437135433] [2024-11-09 18:32:41,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:41,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:41,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:41,205 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-11-09 18:32:41,207 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-11-09 18:32:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:41,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 18:32:41,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 18:32:41,920 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 18:32:42,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437135433] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:32:42,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:32:42,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 32 [2024-11-09 18:32:42,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40194099] [2024-11-09 18:32:42,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:32:42,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-09 18:32:42,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:42,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 18:32:42,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=906, Unknown=0, NotChecked=0, Total=992 [2024-11-09 18:32:42,329 INFO L87 Difference]: Start difference. First operand 630 states and 846 transitions. Second operand has 32 states, 29 states have (on average 3.0344827586206895) internal successors, (88), 26 states have internal predecessors, (88), 6 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-09 18:32:43,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:43,893 INFO L93 Difference]: Finished difference Result 1504 states and 2047 transitions. [2024-11-09 18:32:43,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 18:32:43,894 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 3.0344827586206895) internal successors, (88), 26 states have internal predecessors, (88), 6 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 57 [2024-11-09 18:32:43,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:43,899 INFO L225 Difference]: With dead ends: 1504 [2024-11-09 18:32:43,899 INFO L226 Difference]: Without dead ends: 1414 [2024-11-09 18:32:43,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=219, Invalid=2037, Unknown=0, NotChecked=0, Total=2256 [2024-11-09 18:32:43,902 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 493 mSDsluCounter, 4540 mSDsCounter, 0 mSdLazyCounter, 1507 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 4741 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:43,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 4741 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1507 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 18:32:43,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2024-11-09 18:32:43,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 645. [2024-11-09 18:32:43,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 578 states have (on average 1.2854671280276817) internal successors, (743), 583 states have internal predecessors, (743), 58 states have call successors, (58), 4 states have call predecessors, (58), 8 states have return successors, (67), 61 states have call predecessors, (67), 56 states have call successors, (67) [2024-11-09 18:32:43,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 868 transitions. [2024-11-09 18:32:43,947 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 868 transitions. Word has length 57 [2024-11-09 18:32:43,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:43,948 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 868 transitions. [2024-11-09 18:32:43,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 3.0344827586206895) internal successors, (88), 26 states have internal predecessors, (88), 6 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-09 18:32:43,948 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 868 transitions. [2024-11-09 18:32:43,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 18:32:43,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:43,949 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:43,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-09 18:32:44,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:44,150 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:44,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:44,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1942756187, now seen corresponding path program 1 times [2024-11-09 18:32:44,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:44,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668595421] [2024-11-09 18:32:44,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:44,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:44,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:44,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:44,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:44,318 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 18:32:44,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:44,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668595421] [2024-11-09 18:32:44,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668595421] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:44,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408033502] [2024-11-09 18:32:44,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:44,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:44,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:44,321 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-11-09 18:32:44,323 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-11-09 18:32:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:44,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 18:32:44,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:44,477 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 18:32:44,478 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:44,597 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 18:32:44,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408033502] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:44,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:32:44,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 10] total 19 [2024-11-09 18:32:44,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181083709] [2024-11-09 18:32:44,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:44,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 18:32:44,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:44,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 18:32:44,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-09 18:32:44,599 INFO L87 Difference]: Start difference. First operand 645 states and 868 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:44,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:44,777 INFO L93 Difference]: Finished difference Result 734 states and 976 transitions. [2024-11-09 18:32:44,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 18:32:44,778 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), 2 states have call successors, (4), 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 58 [2024-11-09 18:32:44,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:44,781 INFO L225 Difference]: With dead ends: 734 [2024-11-09 18:32:44,781 INFO L226 Difference]: Without dead ends: 675 [2024-11-09 18:32:44,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-09 18:32:44,782 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 51 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:44,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 511 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:44,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2024-11-09 18:32:44,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 641. [2024-11-09 18:32:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 575 states have (on average 1.257391304347826) internal successors, (723), 580 states have internal predecessors, (723), 57 states have call successors, (57), 4 states have call predecessors, (57), 8 states have return successors, (66), 60 states have call predecessors, (66), 55 states have call successors, (66) [2024-11-09 18:32:44,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 846 transitions. [2024-11-09 18:32:44,824 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 846 transitions. Word has length 58 [2024-11-09 18:32:44,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:44,825 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 846 transitions. [2024-11-09 18:32:44,825 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:44,825 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 846 transitions. [2024-11-09 18:32:44,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 18:32:44,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:44,827 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:44,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-09 18:32:45,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:45,031 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:45,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:45,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1484706336, now seen corresponding path program 1 times [2024-11-09 18:32:45,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:45,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206917024] [2024-11-09 18:32:45,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:45,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:45,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:45,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:45,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 18:32:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:45,189 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 18:32:45,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:45,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206917024] [2024-11-09 18:32:45,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206917024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:45,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:45,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 18:32:45,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951219127] [2024-11-09 18:32:45,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:45,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 18:32:45,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:45,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 18:32:45,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 18:32:45,191 INFO L87 Difference]: Start difference. First operand 641 states and 846 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:45,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:45,358 INFO L93 Difference]: Finished difference Result 776 states and 1017 transitions. [2024-11-09 18:32:45,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 18:32:45,359 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 58 [2024-11-09 18:32:45,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:45,361 INFO L225 Difference]: With dead ends: 776 [2024-11-09 18:32:45,361 INFO L226 Difference]: Without dead ends: 657 [2024-11-09 18:32:45,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 18:32:45,363 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 76 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:45,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 866 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:45,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-11-09 18:32:45,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 641. [2024-11-09 18:32:45,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 575 states have (on average 1.2539130434782608) internal successors, (721), 580 states have internal predecessors, (721), 57 states have call successors, (57), 4 states have call predecessors, (57), 8 states have return successors, (66), 60 states have call predecessors, (66), 55 states have call successors, (66) [2024-11-09 18:32:45,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 844 transitions. [2024-11-09 18:32:45,406 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 844 transitions. Word has length 58 [2024-11-09 18:32:45,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:45,406 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 844 transitions. [2024-11-09 18:32:45,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:45,407 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 844 transitions. [2024-11-09 18:32:45,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 18:32:45,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:45,408 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:45,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 18:32:45,408 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:45,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:45,409 INFO L85 PathProgramCache]: Analyzing trace with hash 401349905, now seen corresponding path program 1 times [2024-11-09 18:32:45,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:45,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469433954] [2024-11-09 18:32:45,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:45,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:45,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:45,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:45,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 18:32:45,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:45,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469433954] [2024-11-09 18:32:45,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469433954] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:45,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971712878] [2024-11-09 18:32:45,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:45,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:45,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:45,568 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-11-09 18:32:45,569 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-11-09 18:32:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:45,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 18:32:45,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:45,676 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 18:32:45,676 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:45,843 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 18:32:45,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971712878] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:32:45,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:32:45,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 19 [2024-11-09 18:32:45,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715046728] [2024-11-09 18:32:45,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:32:45,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 18:32:45,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:45,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 18:32:45,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-11-09 18:32:45,845 INFO L87 Difference]: Start difference. First operand 641 states and 844 transitions. Second operand has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 15 states have internal predecessors, (57), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 18:32:46,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:46,129 INFO L93 Difference]: Finished difference Result 654 states and 856 transitions. [2024-11-09 18:32:46,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 18:32:46,130 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 15 states have internal predecessors, (57), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 59 [2024-11-09 18:32:46,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:46,132 INFO L225 Difference]: With dead ends: 654 [2024-11-09 18:32:46,133 INFO L226 Difference]: Without dead ends: 604 [2024-11-09 18:32:46,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2024-11-09 18:32:46,133 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 22 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:46,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1448 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:32:46,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-11-09 18:32:46,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-11-09 18:32:46,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 541 states have (on average 1.255083179297597) internal successors, (679), 546 states have internal predecessors, (679), 54 states have call successors, (54), 4 states have call predecessors, (54), 8 states have return successors, (63), 57 states have call predecessors, (63), 52 states have call successors, (63) [2024-11-09 18:32:46,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 796 transitions. [2024-11-09 18:32:46,191 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 796 transitions. Word has length 59 [2024-11-09 18:32:46,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:46,191 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 796 transitions. [2024-11-09 18:32:46,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 15 states have internal predecessors, (57), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 18:32:46,191 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 796 transitions. [2024-11-09 18:32:46,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 18:32:46,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:46,193 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:46,213 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-11-09 18:32:46,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:46,393 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:46,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:46,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1756355953, now seen corresponding path program 1 times [2024-11-09 18:32:46,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:46,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479716329] [2024-11-09 18:32:46,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:46,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:46,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:46,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:46,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:46,576 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 18:32:46,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:46,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479716329] [2024-11-09 18:32:46,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479716329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:46,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:46,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 18:32:46,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76242642] [2024-11-09 18:32:46,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:46,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 18:32:46,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:46,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 18:32:46,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:32:46,578 INFO L87 Difference]: Start difference. First operand 604 states and 796 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:46,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:46,686 INFO L93 Difference]: Finished difference Result 611 states and 802 transitions. [2024-11-09 18:32:46,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 18:32:46,686 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 59 [2024-11-09 18:32:46,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:46,689 INFO L225 Difference]: With dead ends: 611 [2024-11-09 18:32:46,689 INFO L226 Difference]: Without dead ends: 608 [2024-11-09 18:32:46,690 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-11-09 18:32:46,690 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 12 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:46,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 693 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:46,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-11-09 18:32:46,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2024-11-09 18:32:46,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 544 states have (on average 1.2536764705882353) internal successors, (682), 549 states have internal predecessors, (682), 54 states have call successors, (54), 5 states have call predecessors, (54), 9 states have return successors, (63), 57 states have call predecessors, (63), 52 states have call successors, (63) [2024-11-09 18:32:46,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 799 transitions. [2024-11-09 18:32:46,727 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 799 transitions. Word has length 59 [2024-11-09 18:32:46,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:46,727 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 799 transitions. [2024-11-09 18:32:46,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:46,727 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 799 transitions. [2024-11-09 18:32:46,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 18:32:46,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:46,728 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:46,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-09 18:32:46,729 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:46,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:46,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1154814947, now seen corresponding path program 1 times [2024-11-09 18:32:46,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:46,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641930197] [2024-11-09 18:32:46,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:46,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:46,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:46,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:46,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:46,805 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 18:32:46,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:46,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641930197] [2024-11-09 18:32:46,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641930197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:46,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:46,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 18:32:46,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483686146] [2024-11-09 18:32:46,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:46,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 18:32:46,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:46,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 18:32:46,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:32:46,807 INFO L87 Difference]: Start difference. First operand 608 states and 799 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:46,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:46,885 INFO L93 Difference]: Finished difference Result 621 states and 812 transitions. [2024-11-09 18:32:46,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 18:32:46,885 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2024-11-09 18:32:46,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:46,888 INFO L225 Difference]: With dead ends: 621 [2024-11-09 18:32:46,888 INFO L226 Difference]: Without dead ends: 618 [2024-11-09 18:32:46,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:32:46,889 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 8 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:46,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 625 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:46,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-09 18:32:46,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 614. [2024-11-09 18:32:46,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 548 states have (on average 1.2518248175182483) internal successors, (686), 554 states have internal predecessors, (686), 55 states have call successors, (55), 6 states have call predecessors, (55), 10 states have return successors, (64), 57 states have call predecessors, (64), 53 states have call successors, (64) [2024-11-09 18:32:46,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 805 transitions. [2024-11-09 18:32:46,924 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 805 transitions. Word has length 60 [2024-11-09 18:32:46,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:46,924 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 805 transitions. [2024-11-09 18:32:46,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:46,924 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 805 transitions. [2024-11-09 18:32:46,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 18:32:46,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:46,925 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:46,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-09 18:32:46,926 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:46,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:46,926 INFO L85 PathProgramCache]: Analyzing trace with hash 683440387, now seen corresponding path program 1 times [2024-11-09 18:32:46,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:46,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020152737] [2024-11-09 18:32:46,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:46,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:46,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:46,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:47,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 18:32:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:47,004 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 18:32:47,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:47,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020152737] [2024-11-09 18:32:47,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020152737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:47,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:47,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 18:32:47,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287487940] [2024-11-09 18:32:47,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:47,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 18:32:47,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:47,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 18:32:47,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:32:47,006 INFO L87 Difference]: Start difference. First operand 614 states and 805 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:47,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:47,087 INFO L93 Difference]: Finished difference Result 649 states and 840 transitions. [2024-11-09 18:32:47,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 18:32:47,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2024-11-09 18:32:47,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:47,091 INFO L225 Difference]: With dead ends: 649 [2024-11-09 18:32:47,091 INFO L226 Difference]: Without dead ends: 646 [2024-11-09 18:32:47,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:32:47,092 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 20 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:47,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 716 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-11-09 18:32:47,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 618. [2024-11-09 18:32:47,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 551 states have (on average 1.250453720508167) internal successors, (689), 557 states have internal predecessors, (689), 55 states have call successors, (55), 7 states have call predecessors, (55), 11 states have return successors, (64), 57 states have call predecessors, (64), 53 states have call successors, (64) [2024-11-09 18:32:47,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 808 transitions. [2024-11-09 18:32:47,127 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 808 transitions. Word has length 60 [2024-11-09 18:32:47,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:47,128 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 808 transitions. [2024-11-09 18:32:47,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:47,128 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 808 transitions. [2024-11-09 18:32:47,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 18:32:47,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:47,130 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:47,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-09 18:32:47,130 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:47,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:47,131 INFO L85 PathProgramCache]: Analyzing trace with hash -808761636, now seen corresponding path program 1 times [2024-11-09 18:32:47,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:47,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026416452] [2024-11-09 18:32:47,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:47,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:47,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:47,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:47,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:47,340 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:47,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:47,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026416452] [2024-11-09 18:32:47,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026416452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:47,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:47,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 18:32:47,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788144563] [2024-11-09 18:32:47,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:47,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 18:32:47,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:47,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 18:32:47,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 18:32:47,342 INFO L87 Difference]: Start difference. First operand 618 states and 808 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:47,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:47,627 INFO L93 Difference]: Finished difference Result 773 states and 1000 transitions. [2024-11-09 18:32:47,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 18:32:47,628 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (4), 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 61 [2024-11-09 18:32:47,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:47,631 INFO L225 Difference]: With dead ends: 773 [2024-11-09 18:32:47,631 INFO L226 Difference]: Without dead ends: 719 [2024-11-09 18:32:47,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 18:32:47,633 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 126 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:47,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 696 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:32:47,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-11-09 18:32:47,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 603. [2024-11-09 18:32:47,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 539 states have (on average 1.2448979591836735) internal successors, (671), 544 states have internal predecessors, (671), 52 states have call successors, (52), 7 states have call predecessors, (52), 11 states have return successors, (61), 54 states have call predecessors, (61), 50 states have call successors, (61) [2024-11-09 18:32:47,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 784 transitions. [2024-11-09 18:32:47,681 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 784 transitions. Word has length 61 [2024-11-09 18:32:47,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:47,681 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 784 transitions. [2024-11-09 18:32:47,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:47,681 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 784 transitions. [2024-11-09 18:32:47,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 18:32:47,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:47,684 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:47,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-09 18:32:47,684 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:47,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:47,685 INFO L85 PathProgramCache]: Analyzing trace with hash 436002845, now seen corresponding path program 1 times [2024-11-09 18:32:47,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:47,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894959570] [2024-11-09 18:32:47,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:47,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:48,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:48,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:48,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:48,161 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 18:32:48,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:48,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894959570] [2024-11-09 18:32:48,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894959570] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:48,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586991930] [2024-11-09 18:32:48,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:48,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:48,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:48,164 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-11-09 18:32:48,165 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-11-09 18:32:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:48,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 18:32:48,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:49,093 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 18:32:49,094 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:49,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586991930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:49,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:32:49,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [16] total 32 [2024-11-09 18:32:49,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312689052] [2024-11-09 18:32:49,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:49,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 18:32:49,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:49,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 18:32:49,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=912, Unknown=0, NotChecked=0, Total=992 [2024-11-09 18:32:49,096 INFO L87 Difference]: Start difference. First operand 603 states and 784 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:50,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:50,098 INFO L93 Difference]: Finished difference Result 1036 states and 1356 transitions. [2024-11-09 18:32:50,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 18:32:50,099 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 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 61 [2024-11-09 18:32:50,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:50,102 INFO L225 Difference]: With dead ends: 1036 [2024-11-09 18:32:50,102 INFO L226 Difference]: Without dead ends: 1005 [2024-11-09 18:32:50,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=169, Invalid=1637, Unknown=0, NotChecked=0, Total=1806 [2024-11-09 18:32:50,104 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 305 mSDsluCounter, 2388 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 2599 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:50,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 2599 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 18:32:50,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2024-11-09 18:32:50,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 621. [2024-11-09 18:32:50,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 556 states have (on average 1.2446043165467626) internal successors, (692), 561 states have internal predecessors, (692), 52 states have call successors, (52), 7 states have call predecessors, (52), 12 states have return successors, (65), 55 states have call predecessors, (65), 50 states have call successors, (65) [2024-11-09 18:32:50,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 809 transitions. [2024-11-09 18:32:50,162 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 809 transitions. Word has length 61 [2024-11-09 18:32:50,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:50,163 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 809 transitions. [2024-11-09 18:32:50,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:50,163 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 809 transitions. [2024-11-09 18:32:50,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 18:32:50,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:50,165 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:50,182 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-11-09 18:32:50,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-09 18:32:50,369 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:50,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:50,369 INFO L85 PathProgramCache]: Analyzing trace with hash -156160358, now seen corresponding path program 1 times [2024-11-09 18:32:50,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:50,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685248462] [2024-11-09 18:32:50,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:50,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:50,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:50,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:50,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:50,892 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 18:32:50,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:50,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685248462] [2024-11-09 18:32:50,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685248462] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:50,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741363330] [2024-11-09 18:32:50,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:50,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:50,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:50,894 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-11-09 18:32:50,897 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-11-09 18:32:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:50,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 18:32:50,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:51,275 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:51,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:51,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741363330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:51,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:32:51,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18] total 27 [2024-11-09 18:32:51,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902450603] [2024-11-09 18:32:51,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:51,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 18:32:51,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:51,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 18:32:51,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2024-11-09 18:32:51,278 INFO L87 Difference]: Start difference. First operand 621 states and 809 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:51,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:51,619 INFO L93 Difference]: Finished difference Result 789 states and 1028 transitions. [2024-11-09 18:32:51,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 18:32:51,619 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 62 [2024-11-09 18:32:51,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:51,622 INFO L225 Difference]: With dead ends: 789 [2024-11-09 18:32:51,622 INFO L226 Difference]: Without dead ends: 688 [2024-11-09 18:32:51,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2024-11-09 18:32:51,624 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 95 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:51,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1171 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:32:51,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2024-11-09 18:32:51,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 568. [2024-11-09 18:32:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 508 states have (on average 1.2460629921259843) internal successors, (633), 513 states have internal predecessors, (633), 49 states have call successors, (49), 7 states have call predecessors, (49), 10 states have return successors, (55), 50 states have call predecessors, (55), 47 states have call successors, (55) [2024-11-09 18:32:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 737 transitions. [2024-11-09 18:32:51,670 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 737 transitions. Word has length 62 [2024-11-09 18:32:51,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:51,670 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 737 transitions. [2024-11-09 18:32:51,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:51,671 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 737 transitions. [2024-11-09 18:32:51,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 18:32:51,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:51,672 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:51,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-09 18:32:51,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-09 18:32:51,877 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:51,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:51,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1605112425, now seen corresponding path program 1 times [2024-11-09 18:32:51,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:51,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495586897] [2024-11-09 18:32:51,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:51,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 18:32:51,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 18:32:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 18:32:51,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 18:32:51,966 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 18:32:51,968 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 18:32:51,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-09 18:32:51,973 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] [2024-11-09 18:32:52,010 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 18:32:52,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:32:52 BoogieIcfgContainer [2024-11-09 18:32:52,012 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 18:32:52,013 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 18:32:52,013 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 18:32:52,013 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 18:32:52,013 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:32:21" (3/4) ... [2024-11-09 18:32:52,016 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-09 18:32:52,018 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 18:32:52,018 INFO L158 Benchmark]: Toolchain (without parser) took 31305.73ms. Allocated memory was 151.0MB in the beginning and 337.6MB in the end (delta: 186.6MB). Free memory was 95.1MB in the beginning and 170.0MB in the end (delta: -74.9MB). Peak memory consumption was 112.3MB. Max. memory is 16.1GB. [2024-11-09 18:32:52,018 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 151.0MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:32:52,019 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.89ms. Allocated memory is still 151.0MB. Free memory was 94.6MB in the beginning and 78.9MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 18:32:52,019 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.83ms. Allocated memory is still 151.0MB. Free memory was 78.9MB in the beginning and 76.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 18:32:52,019 INFO L158 Benchmark]: Boogie Preprocessor took 44.03ms. Allocated memory is still 151.0MB. Free memory was 76.8MB in the beginning and 74.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 18:32:52,019 INFO L158 Benchmark]: IcfgBuilder took 752.01ms. Allocated memory is still 151.0MB. Free memory was 74.7MB in the beginning and 49.0MB in the end (delta: 25.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-09 18:32:52,020 INFO L158 Benchmark]: TraceAbstraction took 30051.72ms. Allocated memory was 151.0MB in the beginning and 337.6MB in the end (delta: 186.6MB). Free memory was 48.5MB in the beginning and 171.0MB in the end (delta: -122.6MB). Peak memory consumption was 66.2MB. Max. memory is 16.1GB. [2024-11-09 18:32:52,020 INFO L158 Benchmark]: Witness Printer took 5.21ms. Allocated memory is still 337.6MB. Free memory was 171.0MB in the beginning and 170.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:32:52,021 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.35ms. Allocated memory is still 151.0MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.89ms. Allocated memory is still 151.0MB. Free memory was 94.6MB in the beginning and 78.9MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.83ms. Allocated memory is still 151.0MB. Free memory was 78.9MB in the beginning and 76.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.03ms. Allocated memory is still 151.0MB. Free memory was 76.8MB in the beginning and 74.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 752.01ms. Allocated memory is still 151.0MB. Free memory was 74.7MB in the beginning and 49.0MB in the end (delta: 25.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 30051.72ms. Allocated memory was 151.0MB in the beginning and 337.6MB in the end (delta: 186.6MB). Free memory was 48.5MB in the beginning and 171.0MB in the end (delta: -122.6MB). Peak memory consumption was 66.2MB. Max. memory is 16.1GB. * Witness Printer took 5.21ms. Allocated memory is still 337.6MB. Free memory was 171.0MB in the beginning and 170.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 17]: 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 110, overapproximation of bitwiseAnd at line 76. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; VAL [ea=127, eb=-127] [L251] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L251] RET, EXPR base2flt(0, 0) VAL [ea=127, eb=-127] [L251] zero = base2flt(0, 0) [L252] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=33554432] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, m=33554432] [L80] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, m=33554432] [L252] RET, EXPR base2flt(ma, ea) VAL [ea=127, eb=-127, ma=33554432, zero=0] [L252] a = base2flt(ma, ea) [L253] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=-127, \old(m)=33554431] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-127, \old(m)=33554431, e=-127, m=33554431] [L29] COND FALSE !(! m) VAL [\old(e)=-127, \old(m)=33554431, e=-127, m=33554431] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-127, \old(m)=33554431, e=-127, m=33554431] [L57] COND TRUE 1 VAL [\old(e)=-127, \old(m)=33554431, e=-127, m=33554431] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-127, \old(m)=33554431, e=-127, m=33554431] [L76] EXPR m & ~ (1U << 24U) VAL [\old(e)=-127, \old(m)=33554431, e=-127] [L76] m = m & ~ (1U << 24U) [L77] EXPR m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-127, \old(m)=33554431] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-127, \old(m)=33554431, __retres4=16777216] [L80] return (__retres4); VAL [\old(e)=-127, \old(m)=33554431, \result=16777216] [L253] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, ea=127, eb=-127, ma=33554432, mb=33554431, zero=0] [L253] b = base2flt(mb, eb) [L255] COND FALSE !(a < zero) VAL [a=4294967295, b=16777216, ea=127, eb=-127, ma=33554432, mb=33554431, zero=0] [L258] COND TRUE a > zero [L259] tmp = 1 VAL [a=4294967295, b=16777216, ea=127, eb=-127, ma=33554432, mb=33554431, tmp=1, zero=0] [L263] sa = tmp VAL [a=4294967295, b=16777216, ea=127, eb=-127, ma=33554432, mb=33554431, sa=1, zero=0] [L265] COND FALSE !(b < zero) VAL [a=4294967295, b=16777216, ea=127, eb=-127, ma=33554432, mb=33554431, sa=1, zero=0] [L268] COND TRUE b > zero [L269] tmp___0 = 1 VAL [a=4294967295, b=16777216, ea=127, eb=-127, ma=33554432, mb=33554431, sa=1, tmp___0=1] [L273] sb = tmp___0 VAL [a=4294967295, b=16777216, ea=127, eb=-127, ma=33554432, mb=33554431, sa=1, sb=1] [L276] CALL addflt(a, b) [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [a=4294967295, b=16777216] [L94] COND FALSE !(a < b) VAL [a=4294967295, b=16777216] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 VAL [a=4294967295, b=16777216, ea=127, ma=16777215] [L110] EXPR ma | (1U << 24U) VAL [a=4294967295, b=16777216, ea=127] [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 VAL [a=4294967295, ea=127, eb=-127, ma=-4261412865, mb=0] [L113] EXPR mb | (1U << 24U) VAL [a=4294967295, ea=127, eb=-127, ma=-4261412865] [L113] mb = mb | (1U << 24U) [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L114] RET __VERIFIER_assert(ea >= eb) VAL [a=4294967295, ea=127, eb=-127, ma=-4261412865, mb=16777216] [L115] delta = ea - eb VAL [a=4294967295, delta=254, ea=127, ma=-4261412865, mb=16777216] [L116] CALL __VERIFIER_assert(delta < sizeof(mb) * 8) VAL [\old(cond)=0] [L16] COND TRUE !(cond) VAL [\old(cond)=0] [L17] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.9s, OverallIterations: 39, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3335 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3185 mSDsluCounter, 37011 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31416 mSDsCounter, 237 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10264 IncrementalHoareTripleChecker+Invalid, 10501 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 237 mSolverCounterUnsat, 5595 mSDtfsCounter, 10264 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2058 GetRequests, 1604 SyntacticMatches, 2 SemanticMatches, 452 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1574 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=702occurred in iteration=17, InterpolantAutomatonStates: 339, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 38 MinimizatonAttempts, 2949 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 2988 NumberOfCodeBlocks, 2988 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 3370 ConstructedInterpolants, 0 QuantifiedInterpolants, 10161 SizeOfPredicates, 32 NumberOfNonLiveVariables, 2716 ConjunctsInSsa, 370 ConjunctsInUnsatCore, 66 InterpolantComputations, 31 PerfectInterpolantSequences, 946/1146 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 18:32:52,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-3a.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 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 18:32:54,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 18:32:54,308 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 18:32:54,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 18:32:54,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 18:32:54,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 18:32:54,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 18:32:54,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 18:32:54,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 18:32:54,349 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 18:32:54,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 18:32:54,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 18:32:54,351 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 18:32:54,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 18:32:54,353 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 18:32:54,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 18:32:54,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 18:32:54,354 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 18:32:54,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 18:32:54,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 18:32:54,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 18:32:54,361 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 18:32:54,362 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 18:32:54,362 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 18:32:54,362 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 18:32:54,362 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 18:32:54,363 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 18:32:54,363 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 18:32:54,363 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 18:32:54,363 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 18:32:54,364 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 18:32:54,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 18:32:54,364 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 18:32:54,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 18:32:54,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:32:54,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 18:32:54,368 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 18:32:54,368 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 18:32:54,368 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 18:32:54,368 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 18:32:54,368 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 18:32:54,369 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 18:32:54,369 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 18:32:54,369 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 18:32:54,369 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 -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2024-11-09 18:32:54,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 18:32:54,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 18:32:54,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 18:32:54,685 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 18:32:54,685 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 18:32:54,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2024-11-09 18:32:56,305 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 18:32:56,534 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 18:32:56,534 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2024-11-09 18:32:56,545 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e42cae0cc/dfa381236479402f906bef73a62ad4a6/FLAGdae9178a1 [2024-11-09 18:32:56,564 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e42cae0cc/dfa381236479402f906bef73a62ad4a6 [2024-11-09 18:32:56,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 18:32:56,569 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 18:32:56,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 18:32:56,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 18:32:56,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 18:32:56,578 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:32:56" (1/1) ... [2024-11-09 18:32:56,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60083f7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:56, skipping insertion in model container [2024-11-09 18:32:56,580 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:32:56" (1/1) ... [2024-11-09 18:32:56,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 18:32:56,800 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c[730,743] [2024-11-09 18:32:56,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:32:56,896 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 18:32:56,910 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c[730,743] [2024-11-09 18:32:56,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:32:56,972 INFO L204 MainTranslator]: Completed translation [2024-11-09 18:32:56,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:56 WrapperNode [2024-11-09 18:32:56,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 18:32:56,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 18:32:56,973 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 18:32:56,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 18:32:56,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:56" (1/1) ... [2024-11-09 18:32:56,992 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:56" (1/1) ... [2024-11-09 18:32:57,018 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 148 [2024-11-09 18:32:57,021 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 18:32:57,022 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 18:32:57,022 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 18:32:57,022 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 18:32:57,032 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:56" (1/1) ... [2024-11-09 18:32:57,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:56" (1/1) ... [2024-11-09 18:32:57,035 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:56" (1/1) ... [2024-11-09 18:32:57,049 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 18:32:57,050 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:56" (1/1) ... [2024-11-09 18:32:57,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:56" (1/1) ... [2024-11-09 18:32:57,062 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:56" (1/1) ... [2024-11-09 18:32:57,063 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:56" (1/1) ... [2024-11-09 18:32:57,067 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:56" (1/1) ... [2024-11-09 18:32:57,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:56" (1/1) ... [2024-11-09 18:32:57,073 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 18:32:57,074 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 18:32:57,074 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 18:32:57,074 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 18:32:57,076 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:56" (1/1) ... [2024-11-09 18:32:57,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:32:57,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:57,110 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 18:32:57,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 18:32:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 18:32:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 18:32:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-09 18:32:57,156 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-09 18:32:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 18:32:57,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 18:32:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 18:32:57,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 18:32:57,249 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 18:32:57,251 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 18:32:57,634 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-09 18:32:57,634 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 18:32:57,654 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 18:32:57,656 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 18:32:57,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:32:57 BoogieIcfgContainer [2024-11-09 18:32:57,657 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 18:32:57,659 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 18:32:57,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 18:32:57,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 18:32:57,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:32:56" (1/3) ... [2024-11-09 18:32:57,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb1b15b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:32:57, skipping insertion in model container [2024-11-09 18:32:57,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:56" (2/3) ... [2024-11-09 18:32:57,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb1b15b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:32:57, skipping insertion in model container [2024-11-09 18:32:57,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:32:57" (3/3) ... [2024-11-09 18:32:57,667 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2024-11-09 18:32:57,684 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 18:32:57,685 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 18:32:57,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 18:32:57,752 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;@272846a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 18:32:57,753 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 18:32:57,758 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 66 states have (on average 1.5303030303030303) internal successors, (101), 69 states have internal predecessors, (101), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 18:32:57,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 18:32:57,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:57,769 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:57,770 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:57,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:57,777 INFO L85 PathProgramCache]: Analyzing trace with hash 275495802, now seen corresponding path program 1 times [2024-11-09 18:32:57,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:57,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712269467] [2024-11-09 18:32:57,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:57,790 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:32:57,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:57,793 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:32:57,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 18:32:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:57,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 18:32:57,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:58,032 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:32:58,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:58,101 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:32:58,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:58,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712269467] [2024-11-09 18:32:58,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712269467] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:32:58,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:32:58,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-09 18:32:58,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578939429] [2024-11-09 18:32:58,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:32:58,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 18:32:58,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:58,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 18:32:58,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:32:58,144 INFO L87 Difference]: Start difference. First operand has 79 states, 66 states have (on average 1.5303030303030303) internal successors, (101), 69 states have internal predecessors, (101), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:58,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:58,297 INFO L93 Difference]: Finished difference Result 167 states and 267 transitions. [2024-11-09 18:32:58,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 18:32:58,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-11-09 18:32:58,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:58,312 INFO L225 Difference]: With dead ends: 167 [2024-11-09 18:32:58,312 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 18:32:58,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:32:58,321 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 5 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:58,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 563 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:58,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 18:32:58,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-11-09 18:32:58,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 71 states have (on average 1.4225352112676057) internal successors, (101), 73 states have internal predecessors, (101), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2024-11-09 18:32:58,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 127 transitions. [2024-11-09 18:32:58,381 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 127 transitions. Word has length 33 [2024-11-09 18:32:58,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:58,382 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 127 transitions. [2024-11-09 18:32:58,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:58,383 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 127 transitions. [2024-11-09 18:32:58,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 18:32:58,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:58,386 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:58,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 18:32:58,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:32:58,587 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:58,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:58,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1385204730, now seen corresponding path program 1 times [2024-11-09 18:32:58,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:58,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [481711486] [2024-11-09 18:32:58,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:58,589 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:32:58,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:58,590 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:32:58,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 18:32:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:58,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 18:32:58,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:58,705 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:32:58,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:58,744 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:32:58,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:58,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [481711486] [2024-11-09 18:32:58,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [481711486] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:32:58,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:32:58,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-09 18:32:58,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007368581] [2024-11-09 18:32:58,745 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:32:58,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 18:32:58,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:58,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 18:32:58,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:32:58,748 INFO L87 Difference]: Start difference. First operand 86 states and 127 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:58,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:58,857 INFO L93 Difference]: Finished difference Result 180 states and 273 transitions. [2024-11-09 18:32:58,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 18:32:58,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-11-09 18:32:58,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:58,860 INFO L225 Difference]: With dead ends: 180 [2024-11-09 18:32:58,860 INFO L226 Difference]: Without dead ends: 131 [2024-11-09 18:32:58,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:32:58,863 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 42 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:58,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 470 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:58,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-09 18:32:58,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-09 18:32:58,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 109 states have internal predecessors, (152), 18 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (24), 20 states have call predecessors, (24), 17 states have call successors, (24) [2024-11-09 18:32:58,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 194 transitions. [2024-11-09 18:32:58,893 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 194 transitions. Word has length 37 [2024-11-09 18:32:58,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:58,894 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 194 transitions. [2024-11-09 18:32:58,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:58,894 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 194 transitions. [2024-11-09 18:32:58,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 18:32:58,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:58,898 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:58,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 18:32:59,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:32:59,099 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:59,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:59,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1091801723, now seen corresponding path program 1 times [2024-11-09 18:32:59,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:59,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076481347] [2024-11-09 18:32:59,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:59,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:32:59,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:59,103 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:32:59,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 18:32:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:59,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 18:32:59,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:59,191 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:32:59,192 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:59,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:59,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2076481347] [2024-11-09 18:32:59,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2076481347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:59,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:59,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 18:32:59,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335736741] [2024-11-09 18:32:59,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:59,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 18:32:59,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:59,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 18:32:59,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:32:59,194 INFO L87 Difference]: Start difference. First operand 130 states and 194 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:59,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:59,284 INFO L93 Difference]: Finished difference Result 289 states and 437 transitions. [2024-11-09 18:32:59,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 18:32:59,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-11-09 18:32:59,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:59,287 INFO L225 Difference]: With dead ends: 289 [2024-11-09 18:32:59,287 INFO L226 Difference]: Without dead ends: 216 [2024-11-09 18:32:59,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:32:59,289 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 46 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:59,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 470 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:59,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-09 18:32:59,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2024-11-09 18:32:59,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 182 states have (on average 1.4065934065934067) internal successors, (256), 181 states have internal predecessors, (256), 28 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (34), 34 states have call predecessors, (34), 27 states have call successors, (34) [2024-11-09 18:32:59,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 318 transitions. [2024-11-09 18:32:59,328 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 318 transitions. Word has length 37 [2024-11-09 18:32:59,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:59,328 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 318 transitions. [2024-11-09 18:32:59,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:59,332 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 318 transitions. [2024-11-09 18:32:59,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 18:32:59,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:59,336 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:59,342 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 (4)] Forceful destruction successful, exit code 0 [2024-11-09 18:32:59,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:32:59,537 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:59,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:59,538 INFO L85 PathProgramCache]: Analyzing trace with hash 895288218, now seen corresponding path program 1 times [2024-11-09 18:32:59,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:59,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501439529] [2024-11-09 18:32:59,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:59,539 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:32:59,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:59,543 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:32:59,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 18:32:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:59,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 18:32:59,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:59,672 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:32:59,675 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:59,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:59,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501439529] [2024-11-09 18:32:59,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501439529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:59,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:59,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 18:32:59,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465888482] [2024-11-09 18:32:59,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:59,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 18:32:59,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:59,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 18:32:59,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:32:59,678 INFO L87 Difference]: Start difference. First operand 214 states and 318 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:59,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:59,801 INFO L93 Difference]: Finished difference Result 265 states and 391 transitions. [2024-11-09 18:32:59,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 18:32:59,801 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-11-09 18:32:59,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:59,803 INFO L225 Difference]: With dead ends: 265 [2024-11-09 18:32:59,803 INFO L226 Difference]: Without dead ends: 198 [2024-11-09 18:32:59,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 18:32:59,805 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 34 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:59,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 553 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:59,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-09 18:32:59,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2024-11-09 18:32:59,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 170 states have (on average 1.3764705882352941) internal successors, (234), 169 states have internal predecessors, (234), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (28), 28 states have call predecessors, (28), 21 states have call successors, (28) [2024-11-09 18:32:59,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 284 transitions. [2024-11-09 18:32:59,818 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 284 transitions. Word has length 37 [2024-11-09 18:32:59,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:59,818 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 284 transitions. [2024-11-09 18:32:59,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:59,818 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 284 transitions. [2024-11-09 18:32:59,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 18:32:59,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:59,820 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:59,826 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 (5)] Forceful destruction successful, exit code 0 [2024-11-09 18:33:00,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:00,023 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:00,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:00,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1957048048, now seen corresponding path program 1 times [2024-11-09 18:33:00,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:00,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [479411450] [2024-11-09 18:33:00,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:00,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:00,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:00,028 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:33:00,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 18:33:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:00,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 18:33:00,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:00,153 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:33:00,153 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:33:00,202 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:33:00,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:00,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [479411450] [2024-11-09 18:33:00,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [479411450] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:33:00,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:33:00,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-09 18:33:00,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157486543] [2024-11-09 18:33:00,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:33:00,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 18:33:00,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:00,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 18:33:00,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 18:33:00,205 INFO L87 Difference]: Start difference. First operand 196 states and 284 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:33:00,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:00,357 INFO L93 Difference]: Finished difference Result 230 states and 333 transitions. [2024-11-09 18:33:00,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 18:33:00,357 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2024-11-09 18:33:00,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:00,359 INFO L225 Difference]: With dead ends: 230 [2024-11-09 18:33:00,359 INFO L226 Difference]: Without dead ends: 190 [2024-11-09 18:33:00,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 76 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-11-09 18:33:00,361 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 29 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:00,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 639 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:33:00,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-09 18:33:00,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2024-11-09 18:33:00,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 164 states have (on average 1.3658536585365855) internal successors, (224), 163 states have internal predecessors, (224), 19 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (25), 25 states have call predecessors, (25), 18 states have call successors, (25) [2024-11-09 18:33:00,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 268 transitions. [2024-11-09 18:33:00,393 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 268 transitions. Word has length 42 [2024-11-09 18:33:00,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:00,394 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 268 transitions. [2024-11-09 18:33:00,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:33:00,394 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 268 transitions. [2024-11-09 18:33:00,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 18:33:00,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:00,395 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:00,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 18:33:00,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:00,596 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:00,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:00,597 INFO L85 PathProgramCache]: Analyzing trace with hash -143989652, now seen corresponding path program 1 times [2024-11-09 18:33:00,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:00,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143761556] [2024-11-09 18:33:00,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:00,597 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:00,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:00,599 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:33:00,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 18:33:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:00,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 18:33:00,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:00,675 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:33:00,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:33:00,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:00,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143761556] [2024-11-09 18:33:00,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143761556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:00,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:00,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:33:00,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359543918] [2024-11-09 18:33:00,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:00,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:33:00,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:00,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:33:00,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:33:00,681 INFO L87 Difference]: Start difference. First operand 187 states and 268 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:33:00,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:00,710 INFO L93 Difference]: Finished difference Result 313 states and 453 transitions. [2024-11-09 18:33:00,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:33:00,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-09 18:33:00,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:00,712 INFO L225 Difference]: With dead ends: 313 [2024-11-09 18:33:00,712 INFO L226 Difference]: Without dead ends: 242 [2024-11-09 18:33:00,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:33:00,714 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 14 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:00,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 369 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:00,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-09 18:33:00,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2024-11-09 18:33:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 216 states have (on average 1.3333333333333333) internal successors, (288), 215 states have internal predecessors, (288), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (28), 28 states have call predecessors, (28), 21 states have call successors, (28) [2024-11-09 18:33:00,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 338 transitions. [2024-11-09 18:33:00,729 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 338 transitions. Word has length 44 [2024-11-09 18:33:00,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:00,730 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 338 transitions. [2024-11-09 18:33:00,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:33:00,730 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 338 transitions. [2024-11-09 18:33:00,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 18:33:00,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:00,731 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:00,738 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-11-09 18:33:00,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:00,932 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:00,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:00,933 INFO L85 PathProgramCache]: Analyzing trace with hash -392561989, now seen corresponding path program 1 times [2024-11-09 18:33:00,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:00,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469396266] [2024-11-09 18:33:00,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:00,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:00,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:00,935 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:33:00,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 18:33:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:00,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 18:33:00,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:01,003 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 18:33:01,003 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:33:01,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:01,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469396266] [2024-11-09 18:33:01,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1469396266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:01,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:01,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:33:01,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390283235] [2024-11-09 18:33:01,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:01,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:33:01,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:01,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:33:01,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:33:01,005 INFO L87 Difference]: Start difference. First operand 242 states and 338 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:33:01,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:01,064 INFO L93 Difference]: Finished difference Result 429 states and 594 transitions. [2024-11-09 18:33:01,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 18:33:01,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2024-11-09 18:33:01,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:01,066 INFO L225 Difference]: With dead ends: 429 [2024-11-09 18:33:01,067 INFO L226 Difference]: Without dead ends: 190 [2024-11-09 18:33:01,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:33:01,068 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 34 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:01,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 275 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:01,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-09 18:33:01,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 175. [2024-11-09 18:33:01,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 155 states have (on average 1.2903225806451613) internal successors, (200), 157 states have internal predecessors, (200), 15 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (20), 17 states have call predecessors, (20), 14 states have call successors, (20) [2024-11-09 18:33:01,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 235 transitions. [2024-11-09 18:33:01,084 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 235 transitions. Word has length 45 [2024-11-09 18:33:01,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:01,085 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 235 transitions. [2024-11-09 18:33:01,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:33:01,085 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 235 transitions. [2024-11-09 18:33:01,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 18:33:01,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:01,086 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:01,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 18:33:01,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:01,287 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:01,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:01,288 INFO L85 PathProgramCache]: Analyzing trace with hash 279957076, now seen corresponding path program 1 times [2024-11-09 18:33:01,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:01,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [855039962] [2024-11-09 18:33:01,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:01,288 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:01,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:01,292 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:33:01,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 18:33:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:01,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 18:33:01,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:01,526 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:33:01,527 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:33:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:33:01,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:01,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [855039962] [2024-11-09 18:33:01,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [855039962] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 18:33:01,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:33:01,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2024-11-09 18:33:01,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017888073] [2024-11-09 18:33:01,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:01,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 18:33:01,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:01,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 18:33:01,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-09 18:33:01,634 INFO L87 Difference]: Start difference. First operand 175 states and 235 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:33:01,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:01,810 INFO L93 Difference]: Finished difference Result 266 states and 368 transitions. [2024-11-09 18:33:01,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 18:33:01,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-09 18:33:01,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:01,813 INFO L225 Difference]: With dead ends: 266 [2024-11-09 18:33:01,814 INFO L226 Difference]: Without dead ends: 227 [2024-11-09 18:33:01,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-09 18:33:01,815 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 24 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:01,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 428 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:33:01,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-09 18:33:01,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 215. [2024-11-09 18:33:01,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 189 states have (on average 1.2857142857142858) internal successors, (243), 192 states have internal predecessors, (243), 21 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2024-11-09 18:33:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 290 transitions. [2024-11-09 18:33:01,830 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 290 transitions. Word has length 46 [2024-11-09 18:33:01,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:01,832 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 290 transitions. [2024-11-09 18:33:01,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:33:01,832 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 290 transitions. [2024-11-09 18:33:01,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 18:33:01,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:01,836 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:01,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 18:33:02,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:02,037 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:02,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:02,038 INFO L85 PathProgramCache]: Analyzing trace with hash 2022767411, now seen corresponding path program 1 times [2024-11-09 18:33:02,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:02,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415683947] [2024-11-09 18:33:02,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:02,038 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:02,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:02,041 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:33:02,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 18:33:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:02,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 18:33:02,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:02,120 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:33:02,120 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:33:02,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:02,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415683947] [2024-11-09 18:33:02,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415683947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:02,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:02,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 18:33:02,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337542982] [2024-11-09 18:33:02,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:02,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 18:33:02,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:02,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 18:33:02,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:33:02,123 INFO L87 Difference]: Start difference. First operand 215 states and 290 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:33:02,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:02,154 INFO L93 Difference]: Finished difference Result 223 states and 297 transitions. [2024-11-09 18:33:02,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 18:33:02,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-09 18:33:02,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:02,157 INFO L225 Difference]: With dead ends: 223 [2024-11-09 18:33:02,157 INFO L226 Difference]: Without dead ends: 215 [2024-11-09 18:33:02,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:33:02,158 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 3 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:02,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 406 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:02,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-09 18:33:02,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2024-11-09 18:33:02,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 189 states have (on average 1.2698412698412698) internal successors, (240), 192 states have internal predecessors, (240), 21 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2024-11-09 18:33:02,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 287 transitions. [2024-11-09 18:33:02,167 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 287 transitions. Word has length 46 [2024-11-09 18:33:02,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:02,168 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 287 transitions. [2024-11-09 18:33:02,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:33:02,168 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 287 transitions. [2024-11-09 18:33:02,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 18:33:02,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:02,169 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:02,173 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 (10)] Forceful destruction successful, exit code 0 [2024-11-09 18:33:02,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:02,370 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:02,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:02,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1219866753, now seen corresponding path program 1 times [2024-11-09 18:33:02,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:02,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1685616268] [2024-11-09 18:33:02,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:02,371 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:02,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:02,372 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:33:02,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 18:33:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:02,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 18:33:02,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:02,456 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:33:02,456 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:33:02,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:02,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1685616268] [2024-11-09 18:33:02,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1685616268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:02,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:02,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:33:02,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330937046] [2024-11-09 18:33:02,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:02,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:33:02,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:02,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:33:02,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:33:02,457 INFO L87 Difference]: Start difference. First operand 215 states and 287 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-11-09 18:33:02,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:02,490 INFO L93 Difference]: Finished difference Result 357 states and 485 transitions. [2024-11-09 18:33:02,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:33:02,491 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 47 [2024-11-09 18:33:02,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:02,493 INFO L225 Difference]: With dead ends: 357 [2024-11-09 18:33:02,493 INFO L226 Difference]: Without dead ends: 301 [2024-11-09 18:33:02,493 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-11-09 18:33:02,494 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 28 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:02,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 335 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:02,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-09 18:33:02,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 234. [2024-11-09 18:33:02,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 205 states have (on average 1.278048780487805) internal successors, (262), 207 states have internal predecessors, (262), 24 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (29), 26 states have call predecessors, (29), 23 states have call successors, (29) [2024-11-09 18:33:02,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 315 transitions. [2024-11-09 18:33:02,519 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 315 transitions. Word has length 47 [2024-11-09 18:33:02,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:02,519 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 315 transitions. [2024-11-09 18:33:02,519 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-11-09 18:33:02,519 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 315 transitions. [2024-11-09 18:33:02,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 18:33:02,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:02,521 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] [2024-11-09 18:33:02,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-09 18:33:02,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:02,722 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:02,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:02,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1586137534, now seen corresponding path program 1 times [2024-11-09 18:33:02,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:02,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883244228] [2024-11-09 18:33:02,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:02,723 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:02,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:02,726 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:33:02,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 18:33:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:02,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 18:33:02,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:02,915 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 18:33:02,915 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:33:02,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:02,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883244228] [2024-11-09 18:33:02,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883244228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:02,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:02,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 18:33:02,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44365968] [2024-11-09 18:33:02,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:02,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 18:33:02,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:02,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 18:33:02,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 18:33:02,921 INFO L87 Difference]: Start difference. First operand 234 states and 315 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:33:03,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:03,190 INFO L93 Difference]: Finished difference Result 565 states and 802 transitions. [2024-11-09 18:33:03,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 18:33:03,191 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 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 47 [2024-11-09 18:33:03,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:03,193 INFO L225 Difference]: With dead ends: 565 [2024-11-09 18:33:03,193 INFO L226 Difference]: Without dead ends: 471 [2024-11-09 18:33:03,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-09 18:33:03,195 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 87 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:03,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 827 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:33:03,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-11-09 18:33:03,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 327. [2024-11-09 18:33:03,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 283 states have (on average 1.3003533568904593) internal successors, (368), 284 states have internal predecessors, (368), 38 states have call successors, (38), 2 states have call predecessors, (38), 5 states have return successors, (49), 42 states have call predecessors, (49), 37 states have call successors, (49) [2024-11-09 18:33:03,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 455 transitions. [2024-11-09 18:33:03,214 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 455 transitions. Word has length 47 [2024-11-09 18:33:03,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:03,214 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 455 transitions. [2024-11-09 18:33:03,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:33:03,214 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 455 transitions. [2024-11-09 18:33:03,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 18:33:03,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:03,215 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] [2024-11-09 18:33:03,219 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 (12)] Forceful destruction successful, exit code 0 [2024-11-09 18:33:03,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:03,416 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:03,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:03,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1821326081, now seen corresponding path program 1 times [2024-11-09 18:33:03,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:03,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877623634] [2024-11-09 18:33:03,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:03,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:03,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:03,418 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:33:03,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 18:33:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:03,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 18:33:03,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:03,670 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 18:33:03,670 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:33:03,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:03,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877623634] [2024-11-09 18:33:03,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877623634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:03,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:03,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 18:33:03,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025558886] [2024-11-09 18:33:03,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:03,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 18:33:03,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:03,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 18:33:03,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-09 18:33:03,673 INFO L87 Difference]: Start difference. First operand 327 states and 455 transitions. Second operand has 12 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:33:04,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:04,054 INFO L93 Difference]: Finished difference Result 422 states and 579 transitions. [2024-11-09 18:33:04,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 18:33:04,055 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 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 47 [2024-11-09 18:33:04,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:04,057 INFO L225 Difference]: With dead ends: 422 [2024-11-09 18:33:04,060 INFO L226 Difference]: Without dead ends: 419 [2024-11-09 18:33:04,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-09 18:33:04,061 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 89 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:04,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1209 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:33:04,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-11-09 18:33:04,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 333. [2024-11-09 18:33:04,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 286 states have (on average 1.2972027972027973) internal successors, (371), 289 states have internal predecessors, (371), 40 states have call successors, (40), 3 states have call predecessors, (40), 6 states have return successors, (51), 42 states have call predecessors, (51), 39 states have call successors, (51) [2024-11-09 18:33:04,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 462 transitions. [2024-11-09 18:33:04,085 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 462 transitions. Word has length 47 [2024-11-09 18:33:04,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:04,086 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 462 transitions. [2024-11-09 18:33:04,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:33:04,087 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 462 transitions. [2024-11-09 18:33:04,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 18:33:04,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:04,088 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:04,093 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-11-09 18:33:04,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:04,289 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:04,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:04,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1342995285, now seen corresponding path program 1 times [2024-11-09 18:33:04,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:04,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512220696] [2024-11-09 18:33:04,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:04,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:04,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:04,293 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:33:04,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 18:33:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:04,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 18:33:04,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 18:33:04,417 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:33:04,514 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 18:33:04,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:04,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512220696] [2024-11-09 18:33:04,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512220696] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 18:33:04,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:33:04,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-09 18:33:04,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299838344] [2024-11-09 18:33:04,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:04,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 18:33:04,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:04,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 18:33:04,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 18:33:04,517 INFO L87 Difference]: Start difference. First operand 333 states and 462 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:33:04,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:04,590 INFO L93 Difference]: Finished difference Result 340 states and 468 transitions. [2024-11-09 18:33:04,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 18:33:04,590 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-09 18:33:04,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:04,592 INFO L225 Difference]: With dead ends: 340 [2024-11-09 18:33:04,592 INFO L226 Difference]: Without dead ends: 337 [2024-11-09 18:33:04,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 18:33:04,593 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 3 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:04,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 484 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:04,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-09 18:33:04,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2024-11-09 18:33:04,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 289 states have (on average 1.2941176470588236) internal successors, (374), 292 states have internal predecessors, (374), 40 states have call successors, (40), 4 states have call predecessors, (40), 7 states have return successors, (51), 42 states have call predecessors, (51), 39 states have call successors, (51) [2024-11-09 18:33:04,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 465 transitions. [2024-11-09 18:33:04,618 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 465 transitions. Word has length 48 [2024-11-09 18:33:04,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:04,619 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 465 transitions. [2024-11-09 18:33:04,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:33:04,619 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 465 transitions. [2024-11-09 18:33:04,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 18:33:04,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:04,620 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:04,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-09 18:33:04,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:04,821 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:04,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:04,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1258995377, now seen corresponding path program 1 times [2024-11-09 18:33:04,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:04,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2084577173] [2024-11-09 18:33:04,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:04,822 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:04,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:04,824 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:33:04,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 18:33:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:04,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 18:33:04,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:04,880 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:33:04,880 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:33:04,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:04,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2084577173] [2024-11-09 18:33:04,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2084577173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:04,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:04,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:33:04,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320890326] [2024-11-09 18:33:04,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:04,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:33:04,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:04,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:33:04,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:33:04,882 INFO L87 Difference]: Start difference. First operand 337 states and 465 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:33:04,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:04,902 INFO L93 Difference]: Finished difference Result 353 states and 482 transitions. [2024-11-09 18:33:04,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:33:04,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-09 18:33:04,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:04,904 INFO L225 Difference]: With dead ends: 353 [2024-11-09 18:33:04,904 INFO L226 Difference]: Without dead ends: 311 [2024-11-09 18:33:04,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:33:04,905 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:04,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 303 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:04,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-09 18:33:04,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2024-11-09 18:33:04,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 263 states have (on average 1.3079847908745248) internal successors, (344), 267 states have internal predecessors, (344), 40 states have call successors, (40), 4 states have call predecessors, (40), 7 states have return successors, (49), 41 states have call predecessors, (49), 39 states have call successors, (49) [2024-11-09 18:33:04,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 433 transitions. [2024-11-09 18:33:04,921 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 433 transitions. Word has length 50 [2024-11-09 18:33:04,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:04,921 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 433 transitions. [2024-11-09 18:33:04,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:33:04,921 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 433 transitions. [2024-11-09 18:33:04,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 18:33:04,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:04,922 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:04,926 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 (15)] Forceful destruction successful, exit code 0 [2024-11-09 18:33:05,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:05,123 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:05,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:05,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1668392233, now seen corresponding path program 1 times [2024-11-09 18:33:05,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:05,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601054706] [2024-11-09 18:33:05,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:05,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:05,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:05,125 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:33:05,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-09 18:33:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:05,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 18:33:05,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:05,353 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 18:33:05,353 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:33:05,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:05,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601054706] [2024-11-09 18:33:05,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601054706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:05,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:05,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 18:33:05,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575421631] [2024-11-09 18:33:05,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:05,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 18:33:05,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:05,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 18:33:05,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-09 18:33:05,355 INFO L87 Difference]: Start difference. First operand 311 states and 433 transitions. Second operand has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 18:33:05,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:05,757 INFO L93 Difference]: Finished difference Result 401 states and 547 transitions. [2024-11-09 18:33:05,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 18:33:05,758 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 53 [2024-11-09 18:33:05,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:05,761 INFO L225 Difference]: With dead ends: 401 [2024-11-09 18:33:05,761 INFO L226 Difference]: Without dead ends: 398 [2024-11-09 18:33:05,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-09 18:33:05,762 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 77 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:05,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1325 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:33:05,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-09 18:33:05,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 319. [2024-11-09 18:33:05,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 268 states have (on average 1.3022388059701493) internal successors, (349), 272 states have internal predecessors, (349), 42 states have call successors, (42), 5 states have call predecessors, (42), 8 states have return successors, (51), 43 states have call predecessors, (51), 41 states have call successors, (51) [2024-11-09 18:33:05,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 442 transitions. [2024-11-09 18:33:05,782 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 442 transitions. Word has length 53 [2024-11-09 18:33:05,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:05,783 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 442 transitions. [2024-11-09 18:33:05,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 18:33:05,784 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 442 transitions. [2024-11-09 18:33:05,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 18:33:05,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:05,785 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:05,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-09 18:33:05,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:05,986 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:05,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:05,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1352165272, now seen corresponding path program 1 times [2024-11-09 18:33:05,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:05,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1929167664] [2024-11-09 18:33:05,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:05,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:05,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:05,990 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:33:05,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-09 18:33:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:06,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 18:33:06,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:06,206 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:33:06,207 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:33:06,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:06,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1929167664] [2024-11-09 18:33:06,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1929167664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:06,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:06,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 18:33:06,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703950125] [2024-11-09 18:33:06,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:06,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 18:33:06,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:06,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 18:33:06,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-09 18:33:06,208 INFO L87 Difference]: Start difference. First operand 319 states and 442 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:33:06,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:06,502 INFO L93 Difference]: Finished difference Result 577 states and 806 transitions. [2024-11-09 18:33:06,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 18:33:06,502 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2024-11-09 18:33:06,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:06,505 INFO L225 Difference]: With dead ends: 577 [2024-11-09 18:33:06,505 INFO L226 Difference]: Without dead ends: 513 [2024-11-09 18:33:06,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-09 18:33:06,506 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 64 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:06,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 692 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:33:06,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-11-09 18:33:06,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 486. [2024-11-09 18:33:06,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 411 states have (on average 1.289537712895377) internal successors, (530), 415 states have internal predecessors, (530), 66 states have call successors, (66), 5 states have call predecessors, (66), 8 states have return successors, (74), 70 states have call predecessors, (74), 64 states have call successors, (74) [2024-11-09 18:33:06,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 670 transitions. [2024-11-09 18:33:06,533 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 670 transitions. Word has length 53 [2024-11-09 18:33:06,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:06,533 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 670 transitions. [2024-11-09 18:33:06,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:33:06,534 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 670 transitions. [2024-11-09 18:33:06,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 18:33:06,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:06,536 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:06,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-09 18:33:06,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:06,736 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:06,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:06,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1917479741, now seen corresponding path program 1 times [2024-11-09 18:33:06,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:06,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [923923461] [2024-11-09 18:33:06,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:06,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:06,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:06,739 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:33:06,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-09 18:33:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:06,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 18:33:06,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:06,808 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:33:06,808 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:33:06,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:06,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [923923461] [2024-11-09 18:33:06,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [923923461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:06,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:06,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:33:06,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4546217] [2024-11-09 18:33:06,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:06,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:33:06,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:06,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:33:06,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:33:06,811 INFO L87 Difference]: Start difference. First operand 486 states and 670 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:33:06,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:06,853 INFO L93 Difference]: Finished difference Result 536 states and 730 transitions. [2024-11-09 18:33:06,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:33:06,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 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 53 [2024-11-09 18:33:06,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:06,856 INFO L225 Difference]: With dead ends: 536 [2024-11-09 18:33:06,856 INFO L226 Difference]: Without dead ends: 486 [2024-11-09 18:33:06,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:33:06,857 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 25 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:06,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 318 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:06,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2024-11-09 18:33:06,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2024-11-09 18:33:06,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 411 states have (on average 1.2481751824817517) internal successors, (513), 415 states have internal predecessors, (513), 66 states have call successors, (66), 5 states have call predecessors, (66), 8 states have return successors, (74), 70 states have call predecessors, (74), 64 states have call successors, (74) [2024-11-09 18:33:06,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 653 transitions. [2024-11-09 18:33:06,885 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 653 transitions. Word has length 53 [2024-11-09 18:33:06,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:06,885 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 653 transitions. [2024-11-09 18:33:06,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:33:06,886 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 653 transitions. [2024-11-09 18:33:06,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 18:33:06,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:06,888 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:06,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-09 18:33:07,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:07,089 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:07,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:07,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1850472988, now seen corresponding path program 1 times [2024-11-09 18:33:07,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:07,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532355136] [2024-11-09 18:33:07,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:07,090 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:07,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:07,091 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:33:07,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-09 18:33:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:07,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 18:33:07,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:07,238 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 18:33:07,239 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:33:07,382 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 18:33:07,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:07,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532355136] [2024-11-09 18:33:07,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532355136] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:33:07,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:33:07,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2024-11-09 18:33:07,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680903899] [2024-11-09 18:33:07,382 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:33:07,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 18:33:07,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:07,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 18:33:07,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-09 18:33:07,383 INFO L87 Difference]: Start difference. First operand 486 states and 653 transitions. Second operand has 16 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 12 states have internal predecessors, (52), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 18:33:07,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:07,569 INFO L93 Difference]: Finished difference Result 543 states and 710 transitions. [2024-11-09 18:33:07,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 18:33:07,570 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 12 states have internal predecessors, (52), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 53 [2024-11-09 18:33:07,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:07,572 INFO L225 Difference]: With dead ends: 543 [2024-11-09 18:33:07,573 INFO L226 Difference]: Without dead ends: 456 [2024-11-09 18:33:07,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-11-09 18:33:07,574 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 16 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:07,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1162 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:33:07,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-09 18:33:07,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 453. [2024-11-09 18:33:07,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 384 states have (on average 1.2395833333333333) internal successors, (476), 387 states have internal predecessors, (476), 60 states have call successors, (60), 5 states have call predecessors, (60), 8 states have return successors, (68), 65 states have call predecessors, (68), 58 states have call successors, (68) [2024-11-09 18:33:07,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 604 transitions. [2024-11-09 18:33:07,606 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 604 transitions. Word has length 53 [2024-11-09 18:33:07,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:07,606 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 604 transitions. [2024-11-09 18:33:07,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 12 states have internal predecessors, (52), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 18:33:07,607 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 604 transitions. [2024-11-09 18:33:07,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 18:33:07,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:07,608 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:07,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-09 18:33:07,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:07,809 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:07,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:07,810 INFO L85 PathProgramCache]: Analyzing trace with hash 641749013, now seen corresponding path program 1 times [2024-11-09 18:33:07,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:07,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957381045] [2024-11-09 18:33:07,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:07,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:07,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:07,813 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:33:07,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-09 18:33:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:07,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 18:33:07,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:07,918 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 18:33:07,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:33:08,028 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 18:33:08,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:08,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957381045] [2024-11-09 18:33:08,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957381045] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:33:08,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:33:08,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-09 18:33:08,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170513186] [2024-11-09 18:33:08,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:33:08,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 18:33:08,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:08,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 18:33:08,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 18:33:08,030 INFO L87 Difference]: Start difference. First operand 453 states and 604 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 12 states have internal predecessors, (52), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 18:33:08,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:08,286 INFO L93 Difference]: Finished difference Result 659 states and 861 transitions. [2024-11-09 18:33:08,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 18:33:08,286 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 12 states have internal predecessors, (52), 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 53 [2024-11-09 18:33:08,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:08,289 INFO L225 Difference]: With dead ends: 659 [2024-11-09 18:33:08,289 INFO L226 Difference]: Without dead ends: 549 [2024-11-09 18:33:08,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-11-09 18:33:08,290 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 141 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:08,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1068 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:33:08,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-11-09 18:33:08,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 453. [2024-11-09 18:33:08,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 384 states have (on average 1.2239583333333333) internal successors, (470), 387 states have internal predecessors, (470), 60 states have call successors, (60), 5 states have call predecessors, (60), 8 states have return successors, (68), 65 states have call predecessors, (68), 58 states have call successors, (68) [2024-11-09 18:33:08,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 598 transitions. [2024-11-09 18:33:08,315 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 598 transitions. Word has length 53 [2024-11-09 18:33:08,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:08,315 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 598 transitions. [2024-11-09 18:33:08,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 12 states have internal predecessors, (52), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 18:33:08,315 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 598 transitions. [2024-11-09 18:33:08,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 18:33:08,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:08,316 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:08,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-09 18:33:08,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:08,520 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:08,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:08,520 INFO L85 PathProgramCache]: Analyzing trace with hash 770831732, now seen corresponding path program 1 times [2024-11-09 18:33:08,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:08,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815729958] [2024-11-09 18:33:08,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:08,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:08,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:08,524 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:33:08,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 (21)] Waiting until timeout for monitored process [2024-11-09 18:33:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:08,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 18:33:08,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:08,582 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 18:33:08,582 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:33:08,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:08,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815729958] [2024-11-09 18:33:08,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815729958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:08,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:08,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:33:08,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710943905] [2024-11-09 18:33:08,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:08,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:33:08,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:08,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:33:08,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:33:08,584 INFO L87 Difference]: Start difference. First operand 453 states and 598 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:33:08,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:08,654 INFO L93 Difference]: Finished difference Result 588 states and 767 transitions. [2024-11-09 18:33:08,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:33:08,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 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 53 [2024-11-09 18:33:08,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:08,657 INFO L225 Difference]: With dead ends: 588 [2024-11-09 18:33:08,658 INFO L226 Difference]: Without dead ends: 555 [2024-11-09 18:33:08,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:33:08,659 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 41 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:08,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 299 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:08,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-09 18:33:08,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 457. [2024-11-09 18:33:08,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 388 states have (on average 1.2190721649484537) internal successors, (473), 391 states have internal predecessors, (473), 60 states have call successors, (60), 5 states have call predecessors, (60), 8 states have return successors, (68), 65 states have call predecessors, (68), 58 states have call successors, (68) [2024-11-09 18:33:08,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 601 transitions. [2024-11-09 18:33:08,684 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 601 transitions. Word has length 53 [2024-11-09 18:33:08,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:08,685 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 601 transitions. [2024-11-09 18:33:08,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:33:08,685 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 601 transitions. [2024-11-09 18:33:08,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 18:33:08,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:08,686 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:08,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-09 18:33:08,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:08,887 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:08,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:08,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1696301266, now seen corresponding path program 1 times [2024-11-09 18:33:08,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:08,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16138670] [2024-11-09 18:33:08,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:08,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:08,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:08,891 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:33:08,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-09 18:33:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 18:33:08,951 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 18:33:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 18:33:09,014 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 18:33:09,014 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 18:33:09,015 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 18:33:09,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-09 18:33:09,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:09,220 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] [2024-11-09 18:33:09,259 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 18:33:09,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:33:09 BoogieIcfgContainer [2024-11-09 18:33:09,261 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 18:33:09,262 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 18:33:09,262 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 18:33:09,262 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 18:33:09,263 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:32:57" (3/4) ... [2024-11-09 18:33:09,263 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 18:33:09,316 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 18:33:09,316 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 18:33:09,319 INFO L158 Benchmark]: Toolchain (without parser) took 12750.07ms. Allocated memory was 60.8MB in the beginning and 134.2MB in the end (delta: 73.4MB). Free memory was 38.0MB in the beginning and 97.9MB in the end (delta: -59.9MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2024-11-09 18:33:09,319 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 48.2MB. Free memory was 32.8MB in the beginning and 32.7MB in the end (delta: 49.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:33:09,319 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.80ms. Allocated memory is still 60.8MB. Free memory was 37.7MB in the beginning and 35.4MB in the end (delta: 2.3MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-11-09 18:33:09,320 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.10ms. Allocated memory is still 60.8MB. Free memory was 35.4MB in the beginning and 33.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 18:33:09,320 INFO L158 Benchmark]: Boogie Preprocessor took 51.62ms. Allocated memory is still 60.8MB. Free memory was 33.5MB in the beginning and 31.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 18:33:09,320 INFO L158 Benchmark]: IcfgBuilder took 582.63ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 31.2MB in the beginning and 41.2MB in the end (delta: -9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 18:33:09,320 INFO L158 Benchmark]: TraceAbstraction took 11602.05ms. Allocated memory was 75.5MB in the beginning and 134.2MB in the end (delta: 58.7MB). Free memory was 40.5MB in the beginning and 102.1MB in the end (delta: -61.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:33:09,320 INFO L158 Benchmark]: Witness Printer took 56.56ms. Allocated memory is still 134.2MB. Free memory was 102.1MB in the beginning and 97.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 18:33:09,323 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 48.2MB. Free memory was 32.8MB in the beginning and 32.7MB in the end (delta: 49.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.80ms. Allocated memory is still 60.8MB. Free memory was 37.7MB in the beginning and 35.4MB in the end (delta: 2.3MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.10ms. Allocated memory is still 60.8MB. Free memory was 35.4MB in the beginning and 33.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.62ms. Allocated memory is still 60.8MB. Free memory was 33.5MB in the beginning and 31.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 582.63ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 31.2MB in the beginning and 41.2MB in the end (delta: -9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11602.05ms. Allocated memory was 75.5MB in the beginning and 134.2MB in the end (delta: 58.7MB). Free memory was 40.5MB in the beginning and 102.1MB in the end (delta: -61.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 56.56ms. Allocated memory is still 134.2MB. Free memory was 102.1MB in the beginning and 97.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; [L251] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L251] RET, EXPR base2flt(0, 0) [L251] zero = base2flt(0, 0) [L252] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=-2147483648] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=-2147483648, e=127, m=-2147483648] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=-2147483648, e=127, m=-2147483648] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=-2147483648, e=127, m=-2147483648] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m)=-2147483648, e=127, m=-2147483648] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=-2147483648, e=127, m=-2147483648] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=-2147483648, __retres4=-1, m=-2147483648] [L80] return (__retres4); VAL [\old(e)=127, \old(m)=-2147483648, \result=-1, m=-2147483648] [L252] RET, EXPR base2flt(ma, ea) VAL [ea=127, ma=-2147483648, zero=0] [L252] a = base2flt(ma, ea) [L253] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=16777216, __retres4=-2147483648] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=16777216, \result=-2147483648] [L253] RET, EXPR base2flt(mb, eb) VAL [a=-1, ea=127, eb=0, ma=-2147483648, mb=16777216, zero=0] [L253] b = base2flt(mb, eb) [L255] COND FALSE !(a < zero) VAL [a=-1, b=-2147483648, ea=127, eb=0, ma=-2147483648, mb=16777216, zero=0] [L258] COND TRUE a > zero [L259] tmp = 1 VAL [a=-1, b=-2147483648, ea=127, eb=0, ma=-2147483648, mb=16777216, tmp=1, zero=0] [L263] sa = tmp VAL [a=-1, b=-2147483648, ea=127, eb=0, ma=-2147483648, mb=16777216, sa=1, zero=0] [L265] COND FALSE !(b < zero) VAL [a=-1, b=-2147483648, ea=127, eb=0, ma=-2147483648, mb=16777216, sa=1, zero=0] [L268] COND TRUE b > zero [L269] tmp___0 = 1 VAL [a=-1, b=-2147483648, ea=127, eb=0, ma=-2147483648, mb=16777216, sa=1, tmp___0=1] [L273] sb = tmp___0 VAL [a=-1, b=-2147483648, ea=127, eb=0, ma=-2147483648, mb=16777216, sa=1, sb=1] [L276] CALL addflt(a, b) [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [a=-1, b=-2147483648] [L94] COND FALSE !(a < b) VAL [a=-1, b=-2147483648] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 [L113] mb = mb | (1U << 24U) VAL [a=-1, ea=127, eb=0, ma=33554431, mb=16777216] [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L114] RET __VERIFIER_assert(ea >= eb) VAL [a=-1, ea=127, eb=0, ma=33554431, mb=16777216] [L115] delta = ea - eb VAL [a=-1, delta=127, ea=127, ma=33554431, mb=16777216] [L116] CALL __VERIFIER_assert(delta < sizeof(mb) * 8) VAL [\old(cond)=0] [L16] COND TRUE !(cond) VAL [\old(cond)=0] [L17] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 886 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 802 mSDsluCounter, 12195 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10018 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2441 IncrementalHoareTripleChecker+Invalid, 2516 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 2177 mSDtfsCounter, 2441 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1232 GetRequests, 1086 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=486occurred in iteration=16, InterpolantAutomatonStates: 146, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 636 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 978 NumberOfCodeBlocks, 978 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1209 ConstructedInterpolants, 0 QuantifiedInterpolants, 2441 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1684 ConjunctsInSsa, 156 ConjunctsInUnsatCore, 27 InterpolantComputations, 15 PerfectInterpolantSequences, 388/442 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 proved your program to be incorrect! [2024-11-09 18:33:09,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE