./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-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 c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:11:30,959 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:11:31,036 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:11:31,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:11:31,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:11:31,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:11:31,078 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:11:31,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:11:31,079 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:11:31,080 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:11:31,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:11:31,081 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:11:31,081 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:11:31,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:11:31,084 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:11:31,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:11:31,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:11:31,085 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:11:31,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:11:31,086 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:11:31,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:11:31,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:11:31,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:11:31,087 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:11:31,087 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:11:31,088 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:11:31,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:11:31,092 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:11:31,093 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:11:31,093 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:11:31,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:11:31,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:11:31,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:11:31,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:11:31,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:11:31,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:11:31,094 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:11:31,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:11:31,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:11:31,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:11:31,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:11:31,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:11:31,096 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 -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2024-10-12 15:11:31,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:11:31,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:11:31,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:11:31,389 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:11:31,390 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:11:31,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-10-12 15:11:32,857 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:11:33,023 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:11:33,023 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-10-12 15:11:33,033 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18c643b79/2a9f932b7a3c4296b7efd5dfcc5db787/FLAG9e481bf3f [2024-10-12 15:11:33,045 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18c643b79/2a9f932b7a3c4296b7efd5dfcc5db787 [2024-10-12 15:11:33,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:11:33,049 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:11:33,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:11:33,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:11:33,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:11:33,056 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:11:33" (1/1) ... [2024-10-12 15:11:33,057 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a55df51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:33, skipping insertion in model container [2024-10-12 15:11:33,057 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:11:33" (1/1) ... [2024-10-12 15:11:33,094 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:11:33,268 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2024-10-12 15:11:33,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:11:33,347 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:11:33,359 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2024-10-12 15:11:33,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:11:33,407 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:11:33,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:33 WrapperNode [2024-10-12 15:11:33,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:11:33,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:11:33,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:11:33,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:11:33,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:33" (1/1) ... [2024-10-12 15:11:33,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:33" (1/1) ... [2024-10-12 15:11:33,444 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-10-12 15:11:33,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:11:33,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:11:33,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:11:33,446 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:11:33,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:33" (1/1) ... [2024-10-12 15:11:33,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:33" (1/1) ... [2024-10-12 15:11:33,457 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:33" (1/1) ... [2024-10-12 15:11:33,469 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 15:11:33,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:33" (1/1) ... [2024-10-12 15:11:33,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:33" (1/1) ... [2024-10-12 15:11:33,475 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:33" (1/1) ... [2024-10-12 15:11:33,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:33" (1/1) ... [2024-10-12 15:11:33,482 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:33" (1/1) ... [2024-10-12 15:11:33,483 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:33" (1/1) ... [2024-10-12 15:11:33,485 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:11:33,486 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:11:33,486 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:11:33,486 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:11:33,487 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:33" (1/1) ... [2024-10-12 15:11:33,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:11:33,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:33,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 15:11:33,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 15:11:33,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:11:33,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:11:33,563 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-10-12 15:11:33,563 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-10-12 15:11:33,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:11:33,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:11:33,564 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-10-12 15:11:33,566 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-10-12 15:11:33,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-12 15:11:33,566 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-12 15:11:33,629 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:11:33,630 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:11:34,062 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-10-12 15:11:34,063 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:11:34,128 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:11:34,132 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 15:11:34,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:11:34 BoogieIcfgContainer [2024-10-12 15:11:34,134 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:11:34,136 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:11:34,136 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:11:34,140 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:11:34,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:11:33" (1/3) ... [2024-10-12 15:11:34,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee9aa2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:11:34, skipping insertion in model container [2024-10-12 15:11:34,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:33" (2/3) ... [2024-10-12 15:11:34,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee9aa2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:11:34, skipping insertion in model container [2024-10-12 15:11:34,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:11:34" (3/3) ... [2024-10-12 15:11:34,144 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2024-10-12 15:11:34,156 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:11:34,156 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:11:34,214 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:11:34,222 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;@78f7e8b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:11:34,223 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:11:34,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 59 states have (on average 1.5423728813559323) internal successors, (91), 60 states have internal predecessors, (91), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-12 15:11:34,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-12 15:11:34,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:34,238 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:34,239 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:34,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:34,244 INFO L85 PathProgramCache]: Analyzing trace with hash -668292288, now seen corresponding path program 1 times [2024-10-12 15:11:34,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:34,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105429716] [2024-10-12 15:11:34,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:34,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:34,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:34,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:34,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:34,833 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 15:11:34,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:34,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105429716] [2024-10-12 15:11:34,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105429716] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:34,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916600453] [2024-10-12 15:11:34,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:34,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:34,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:34,839 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:11:34,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 15:11:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:34,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 15:11:34,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:34,974 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 15:11:34,975 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:35,165 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 15:11:35,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916600453] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:11:35,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:11:35,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-10-12 15:11:35,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603108290] [2024-10-12 15:11:35,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:11:35,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 15:11:35,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:35,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 15:11:35,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-10-12 15:11:35,196 INFO L87 Difference]: Start difference. First operand has 73 states, 59 states have (on average 1.5423728813559323) internal successors, (91), 60 states have internal predecessors, (91), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 16 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 15:11:35,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:35,424 INFO L93 Difference]: Finished difference Result 164 states and 259 transitions. [2024-10-12 15:11:35,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 15:11:35,427 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 31 [2024-10-12 15:11:35,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:35,448 INFO L225 Difference]: With dead ends: 164 [2024-10-12 15:11:35,448 INFO L226 Difference]: Without dead ends: 90 [2024-10-12 15:11:35,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-10-12 15:11:35,455 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 28 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:35,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 998 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:35,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-12 15:11:35,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2024-10-12 15:11:35,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 65 states have (on average 1.4) internal successors, (91), 67 states have internal predecessors, (91), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2024-10-12 15:11:35,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 116 transitions. [2024-10-12 15:11:35,495 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 116 transitions. Word has length 31 [2024-10-12 15:11:35,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:35,496 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 116 transitions. [2024-10-12 15:11:35,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 15:11:35,497 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 116 transitions. [2024-10-12 15:11:35,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 15:11:35,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:35,500 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:35,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 15:11:35,700 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-10-12 15:11:35,701 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:35,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:35,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1170817681, now seen corresponding path program 1 times [2024-10-12 15:11:35,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:35,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387049173] [2024-10-12 15:11:35,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:35,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:35,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:35,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:35,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 15:11:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:35,968 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 15:11:35,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:35,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387049173] [2024-10-12 15:11:35,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387049173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:35,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:35,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 15:11:35,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259114642] [2024-10-12 15:11:35,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:35,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 15:11:35,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:35,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 15:11:35,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 15:11:35,974 INFO L87 Difference]: Start difference. First operand 82 states and 116 transitions. Second operand has 8 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 15:11:36,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:36,061 INFO L93 Difference]: Finished difference Result 150 states and 207 transitions. [2024-10-12 15:11:36,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 15:11:36,062 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-10-12 15:11:36,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:36,063 INFO L225 Difference]: With dead ends: 150 [2024-10-12 15:11:36,063 INFO L226 Difference]: Without dead ends: 103 [2024-10-12 15:11:36,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-12 15:11:36,066 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 12 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:36,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 637 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:36,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-12 15:11:36,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2024-10-12 15:11:36,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 72 states have internal predecessors, (96), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2024-10-12 15:11:36,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2024-10-12 15:11:36,091 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 35 [2024-10-12 15:11:36,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:36,091 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2024-10-12 15:11:36,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 15:11:36,092 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2024-10-12 15:11:36,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 15:11:36,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:36,097 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:36,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:11:36,097 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:36,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:36,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1441771179, now seen corresponding path program 1 times [2024-10-12 15:11:36,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:36,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706461822] [2024-10-12 15:11:36,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:36,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:36,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:36,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:36,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:36,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 15:11:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:36,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 15:11:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:36,389 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 15:11:36,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:36,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706461822] [2024-10-12 15:11:36,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706461822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:36,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:36,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 15:11:36,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460940585] [2024-10-12 15:11:36,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:36,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 15:11:36,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:36,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 15:11:36,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 15:11:36,396 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. Second operand has 10 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 15:11:36,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:36,522 INFO L93 Difference]: Finished difference Result 148 states and 207 transitions. [2024-10-12 15:11:36,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 15:11:36,523 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2024-10-12 15:11:36,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:36,525 INFO L225 Difference]: With dead ends: 148 [2024-10-12 15:11:36,525 INFO L226 Difference]: Without dead ends: 137 [2024-10-12 15:11:36,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 15:11:36,527 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 60 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:36,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 814 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:36,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-12 15:11:36,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 122. [2024-10-12 15:11:36,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 97 states have (on average 1.3814432989690721) internal successors, (134), 100 states have internal predecessors, (134), 17 states have call successors, (17), 5 states have call predecessors, (17), 7 states have return successors, (22), 16 states have call predecessors, (22), 16 states have call successors, (22) [2024-10-12 15:11:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 173 transitions. [2024-10-12 15:11:36,546 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 173 transitions. Word has length 38 [2024-10-12 15:11:36,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:36,547 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 173 transitions. [2024-10-12 15:11:36,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 15:11:36,548 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 173 transitions. [2024-10-12 15:11:36,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 15:11:36,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:36,550 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] [2024-10-12 15:11:36,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:11:36,551 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:36,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:36,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1077529527, now seen corresponding path program 1 times [2024-10-12 15:11:36,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:36,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737515728] [2024-10-12 15:11:36,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:36,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:36,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:36,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:36,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:36,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 15:11:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:36,730 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 15:11:36,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:36,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737515728] [2024-10-12 15:11:36,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737515728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:36,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:36,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 15:11:36,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307736104] [2024-10-12 15:11:36,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:36,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 15:11:36,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:36,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 15:11:36,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 15:11:36,732 INFO L87 Difference]: Start difference. First operand 122 states and 173 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 15:11:36,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:36,861 INFO L93 Difference]: Finished difference Result 204 states and 288 transitions. [2024-10-12 15:11:36,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 15:11:36,862 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2024-10-12 15:11:36,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:36,865 INFO L225 Difference]: With dead ends: 204 [2024-10-12 15:11:36,865 INFO L226 Difference]: Without dead ends: 165 [2024-10-12 15:11:36,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-12 15:11:36,868 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 81 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:36,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 725 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:36,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-12 15:11:36,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 129. [2024-10-12 15:11:36,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 105 states have internal predecessors, (140), 18 states have call successors, (18), 6 states have call predecessors, (18), 8 states have return successors, (22), 17 states have call predecessors, (22), 17 states have call successors, (22) [2024-10-12 15:11:36,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 180 transitions. [2024-10-12 15:11:36,895 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 180 transitions. Word has length 38 [2024-10-12 15:11:36,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:36,895 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 180 transitions. [2024-10-12 15:11:36,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 15:11:36,896 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 180 transitions. [2024-10-12 15:11:36,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 15:11:36,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:36,898 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] [2024-10-12 15:11:36,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:11:36,899 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:36,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:36,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1048744169, now seen corresponding path program 1 times [2024-10-12 15:11:36,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:36,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474563149] [2024-10-12 15:11:36,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:36,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:37,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:37,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:37,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:37,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 15:11:37,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:37,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 15:11:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:37,225 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:11:37,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:37,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474563149] [2024-10-12 15:11:37,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474563149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:37,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:37,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-12 15:11:37,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33797794] [2024-10-12 15:11:37,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:37,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-12 15:11:37,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:37,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-12 15:11:37,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-10-12 15:11:37,230 INFO L87 Difference]: Start difference. First operand 129 states and 180 transitions. Second operand has 15 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-12 15:11:37,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:37,502 INFO L93 Difference]: Finished difference Result 188 states and 264 transitions. [2024-10-12 15:11:37,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 15:11:37,503 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 38 [2024-10-12 15:11:37,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:37,506 INFO L225 Difference]: With dead ends: 188 [2024-10-12 15:11:37,506 INFO L226 Difference]: Without dead ends: 180 [2024-10-12 15:11:37,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-10-12 15:11:37,508 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 56 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:37,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1150 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 15:11:37,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-12 15:11:37,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 136. [2024-10-12 15:11:37,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 108 states have (on average 1.3611111111111112) internal successors, (147), 110 states have internal predecessors, (147), 18 states have call successors, (18), 6 states have call predecessors, (18), 9 states have return successors, (24), 19 states have call predecessors, (24), 17 states have call successors, (24) [2024-10-12 15:11:37,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2024-10-12 15:11:37,522 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 38 [2024-10-12 15:11:37,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:37,522 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2024-10-12 15:11:37,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-12 15:11:37,522 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2024-10-12 15:11:37,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 15:11:37,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:37,524 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-10-12 15:11:37,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:11:37,524 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:37,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:37,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1470556537, now seen corresponding path program 1 times [2024-10-12 15:11:37,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:37,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214321605] [2024-10-12 15:11:37,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:37,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:37,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:37,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:37,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:37,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 15:11:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:37,697 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 15:11:37,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:37,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214321605] [2024-10-12 15:11:37,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214321605] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:37,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120413400] [2024-10-12 15:11:37,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:37,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:37,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:37,700 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:11:37,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 15:11:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:37,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-12 15:11:37,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:37,790 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 15:11:37,791 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:37,934 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 15:11:37,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120413400] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:11:37,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:11:37,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-10-12 15:11:37,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700424911] [2024-10-12 15:11:37,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:11:37,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 15:11:37,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:37,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 15:11:37,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-12 15:11:37,936 INFO L87 Difference]: Start difference. First operand 136 states and 189 transitions. Second operand has 14 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 15:11:38,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:38,033 INFO L93 Difference]: Finished difference Result 229 states and 313 transitions. [2024-10-12 15:11:38,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 15:11:38,033 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 38 [2024-10-12 15:11:38,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:38,035 INFO L225 Difference]: With dead ends: 229 [2024-10-12 15:11:38,035 INFO L226 Difference]: Without dead ends: 151 [2024-10-12 15:11:38,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-10-12 15:11:38,037 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 16 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:38,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 928 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:38,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-12 15:11:38,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 142. [2024-10-12 15:11:38,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 113 states have (on average 1.336283185840708) internal successors, (151), 114 states have internal predecessors, (151), 19 states have call successors, (19), 8 states have call predecessors, (19), 9 states have return successors, (22), 19 states have call predecessors, (22), 18 states have call successors, (22) [2024-10-12 15:11:38,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 192 transitions. [2024-10-12 15:11:38,055 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 192 transitions. Word has length 38 [2024-10-12 15:11:38,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:38,055 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 192 transitions. [2024-10-12 15:11:38,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 15:11:38,055 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 192 transitions. [2024-10-12 15:11:38,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 15:11:38,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:38,060 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] [2024-10-12 15:11:38,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 15:11:38,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-12 15:11:38,261 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:38,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:38,262 INFO L85 PathProgramCache]: Analyzing trace with hash 923501869, now seen corresponding path program 1 times [2024-10-12 15:11:38,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:38,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623314956] [2024-10-12 15:11:38,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:38,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:38,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:38,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:38,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:38,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 15:11:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:38,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 15:11:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:38,345 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-12 15:11:38,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:38,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623314956] [2024-10-12 15:11:38,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623314956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:38,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:38,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 15:11:38,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634269111] [2024-10-12 15:11:38,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:38,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 15:11:38,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:38,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 15:11:38,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:11:38,351 INFO L87 Difference]: Start difference. First operand 142 states and 192 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-12 15:11:38,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:38,387 INFO L93 Difference]: Finished difference Result 150 states and 199 transitions. [2024-10-12 15:11:38,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 15:11:38,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 40 [2024-10-12 15:11:38,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:38,389 INFO L225 Difference]: With dead ends: 150 [2024-10-12 15:11:38,389 INFO L226 Difference]: Without dead ends: 130 [2024-10-12 15:11:38,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:11:38,390 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 3 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 463 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-10-12 15:11:38,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 463 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:11:38,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-12 15:11:38,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-12 15:11:38,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 104 states have (on average 1.3557692307692308) internal successors, (141), 106 states have internal predecessors, (141), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) [2024-10-12 15:11:38,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 177 transitions. [2024-10-12 15:11:38,398 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 177 transitions. Word has length 40 [2024-10-12 15:11:38,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:38,398 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 177 transitions. [2024-10-12 15:11:38,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-12 15:11:38,398 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 177 transitions. [2024-10-12 15:11:38,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-12 15:11:38,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:38,399 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:38,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 15:11:38,400 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:38,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:38,400 INFO L85 PathProgramCache]: Analyzing trace with hash -218290978, now seen corresponding path program 2 times [2024-10-12 15:11:38,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:38,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970811664] [2024-10-12 15:11:38,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:38,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:38,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:38,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:38,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 15:11:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:38,536 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 15:11:38,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:38,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970811664] [2024-10-12 15:11:38,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970811664] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:38,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46116848] [2024-10-12 15:11:38,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 15:11:38,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:38,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:38,538 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:11:38,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 15:11:38,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-12 15:11:38,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 15:11:38,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 15:11:38,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:38,755 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 15:11:38,755 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:38,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46116848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:38,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:11:38,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 13 [2024-10-12 15:11:38,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850381418] [2024-10-12 15:11:38,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:38,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 15:11:38,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:38,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 15:11:38,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-10-12 15:11:38,758 INFO L87 Difference]: Start difference. First operand 130 states and 177 transitions. Second operand has 10 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 15:11:39,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:39,044 INFO L93 Difference]: Finished difference Result 264 states and 363 transitions. [2024-10-12 15:11:39,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 15:11:39,045 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-10-12 15:11:39,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:39,047 INFO L225 Difference]: With dead ends: 264 [2024-10-12 15:11:39,047 INFO L226 Difference]: Without dead ends: 210 [2024-10-12 15:11:39,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-10-12 15:11:39,048 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 92 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:39,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1304 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 15:11:39,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-12 15:11:39,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 174. [2024-10-12 15:11:39,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 140 states have (on average 1.35) internal successors, (189), 143 states have internal predecessors, (189), 22 states have call successors, (22), 9 states have call predecessors, (22), 11 states have return successors, (28), 21 states have call predecessors, (28), 21 states have call successors, (28) [2024-10-12 15:11:39,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 239 transitions. [2024-10-12 15:11:39,062 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 239 transitions. Word has length 39 [2024-10-12 15:11:39,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:39,062 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 239 transitions. [2024-10-12 15:11:39,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 15:11:39,063 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 239 transitions. [2024-10-12 15:11:39,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-12 15:11:39,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:39,064 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:39,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 15:11:39,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:39,268 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:39,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:39,269 INFO L85 PathProgramCache]: Analyzing trace with hash -611317988, now seen corresponding path program 1 times [2024-10-12 15:11:39,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:39,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966703478] [2024-10-12 15:11:39,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:39,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:39,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:39,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:39,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 15:11:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:39,429 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 15:11:39,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:39,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966703478] [2024-10-12 15:11:39,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966703478] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:39,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362513369] [2024-10-12 15:11:39,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:39,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:39,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:39,432 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:11:39,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 15:11:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:39,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-12 15:11:39,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:39,666 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 15:11:39,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:39,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362513369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:39,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:11:39,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [9] total 17 [2024-10-12 15:11:39,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092761097] [2024-10-12 15:11:39,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:39,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 15:11:39,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:39,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 15:11:39,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2024-10-12 15:11:39,669 INFO L87 Difference]: Start difference. First operand 174 states and 239 transitions. Second operand has 14 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 15:11:39,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:39,911 INFO L93 Difference]: Finished difference Result 337 states and 469 transitions. [2024-10-12 15:11:39,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 15:11:39,911 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2024-10-12 15:11:39,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:39,913 INFO L225 Difference]: With dead ends: 337 [2024-10-12 15:11:39,913 INFO L226 Difference]: Without dead ends: 264 [2024-10-12 15:11:39,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-10-12 15:11:39,914 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 64 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:39,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1622 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 15:11:39,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-12 15:11:39,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 246. [2024-10-12 15:11:39,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 200 states have (on average 1.345) internal successors, (269), 203 states have internal predecessors, (269), 31 states have call successors, (31), 12 states have call predecessors, (31), 14 states have return successors, (39), 30 states have call predecessors, (39), 30 states have call successors, (39) [2024-10-12 15:11:39,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 339 transitions. [2024-10-12 15:11:39,928 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 339 transitions. Word has length 39 [2024-10-12 15:11:39,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:39,928 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 339 transitions. [2024-10-12 15:11:39,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 15:11:39,928 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 339 transitions. [2024-10-12 15:11:39,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-12 15:11:39,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:39,929 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:11:39,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 15:11:40,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:40,131 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:40,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:40,131 INFO L85 PathProgramCache]: Analyzing trace with hash 395961112, now seen corresponding path program 1 times [2024-10-12 15:11:40,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:40,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92975151] [2024-10-12 15:11:40,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:40,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:40,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:40,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:40,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:40,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 15:11:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:40,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 15:11:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:11:40,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:40,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92975151] [2024-10-12 15:11:40,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92975151] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:40,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650665069] [2024-10-12 15:11:40,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:40,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:40,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:40,334 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:11:40,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 15:11:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:40,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-12 15:11:40,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 15:11:40,566 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:11:40,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650665069] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:11:40,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:11:40,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 32 [2024-10-12 15:11:40,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699414559] [2024-10-12 15:11:40,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:11:40,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-12 15:11:40,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:40,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-12 15:11:40,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2024-10-12 15:11:40,957 INFO L87 Difference]: Start difference. First operand 246 states and 339 transitions. Second operand has 32 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 25 states have internal predecessors, (43), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-12 15:11:42,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:42,497 INFO L93 Difference]: Finished difference Result 455 states and 656 transitions. [2024-10-12 15:11:42,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-12 15:11:42,498 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 25 states have internal predecessors, (43), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) Word has length 42 [2024-10-12 15:11:42,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:42,501 INFO L225 Difference]: With dead ends: 455 [2024-10-12 15:11:42,501 INFO L226 Difference]: Without dead ends: 431 [2024-10-12 15:11:42,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=327, Invalid=3579, Unknown=0, NotChecked=0, Total=3906 [2024-10-12 15:11:42,504 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 269 mSDsluCounter, 4073 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 4269 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:42,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 4269 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1302 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:11:42,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-10-12 15:11:42,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 291. [2024-10-12 15:11:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 233 states have (on average 1.3304721030042919) internal successors, (310), 241 states have internal predecessors, (310), 38 states have call successors, (38), 11 states have call predecessors, (38), 19 states have return successors, (58), 38 states have call predecessors, (58), 37 states have call successors, (58) [2024-10-12 15:11:42,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 406 transitions. [2024-10-12 15:11:42,528 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 406 transitions. Word has length 42 [2024-10-12 15:11:42,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:42,529 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 406 transitions. [2024-10-12 15:11:42,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 25 states have internal predecessors, (43), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-12 15:11:42,529 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 406 transitions. [2024-10-12 15:11:42,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-12 15:11:42,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:42,531 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:11:42,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 15:11:42,735 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-10-12 15:11:42,736 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:42,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:42,736 INFO L85 PathProgramCache]: Analyzing trace with hash 904042908, now seen corresponding path program 2 times [2024-10-12 15:11:42,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:42,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311329487] [2024-10-12 15:11:42,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:42,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:42,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:42,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:42,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 15:11:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:42,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 15:11:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:42,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 15:11:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:11:42,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:42,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311329487] [2024-10-12 15:11:42,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311329487] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:42,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982714359] [2024-10-12 15:11:42,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 15:11:42,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:42,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:42,925 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:11:42,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 15:11:42,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 15:11:42,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 15:11:42,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-12 15:11:42,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:43,128 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 15:11:43,129 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:43,495 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:11:43,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982714359] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:11:43,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:11:43,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 32 [2024-10-12 15:11:43,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184783907] [2024-10-12 15:11:43,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:11:43,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-12 15:11:43,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:43,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-12 15:11:43,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2024-10-12 15:11:43,498 INFO L87 Difference]: Start difference. First operand 291 states and 406 transitions. Second operand has 32 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 25 states have internal predecessors, (44), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-12 15:11:44,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:44,637 INFO L93 Difference]: Finished difference Result 497 states and 736 transitions. [2024-10-12 15:11:44,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-12 15:11:44,638 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 25 states have internal predecessors, (44), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) Word has length 42 [2024-10-12 15:11:44,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:44,641 INFO L225 Difference]: With dead ends: 497 [2024-10-12 15:11:44,641 INFO L226 Difference]: Without dead ends: 484 [2024-10-12 15:11:44,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=295, Invalid=3245, Unknown=0, NotChecked=0, Total=3540 [2024-10-12 15:11:44,645 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 382 mSDsluCounter, 2722 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 2884 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:44,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 2884 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:11:44,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-10-12 15:11:44,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 305. [2024-10-12 15:11:44,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 241 states have (on average 1.3195020746887967) internal successors, (318), 250 states have internal predecessors, (318), 42 states have call successors, (42), 12 states have call predecessors, (42), 21 states have return successors, (74), 42 states have call predecessors, (74), 41 states have call successors, (74) [2024-10-12 15:11:44,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 434 transitions. [2024-10-12 15:11:44,680 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 434 transitions. Word has length 42 [2024-10-12 15:11:44,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:44,680 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 434 transitions. [2024-10-12 15:11:44,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 25 states have internal predecessors, (44), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-12 15:11:44,681 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 434 transitions. [2024-10-12 15:11:44,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-12 15:11:44,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:44,682 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:44,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-12 15:11:44,882 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-10-12 15:11:44,883 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:44,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:44,883 INFO L85 PathProgramCache]: Analyzing trace with hash -2008284808, now seen corresponding path program 1 times [2024-10-12 15:11:44,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:44,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024704111] [2024-10-12 15:11:44,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:44,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:44,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:44,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:44,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 15:11:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:45,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 15:11:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:45,022 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 15:11:45,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:45,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024704111] [2024-10-12 15:11:45,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024704111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:45,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:45,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 15:11:45,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184528091] [2024-10-12 15:11:45,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:45,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 15:11:45,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:45,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 15:11:45,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 15:11:45,024 INFO L87 Difference]: Start difference. First operand 305 states and 434 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 15:11:45,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:45,105 INFO L93 Difference]: Finished difference Result 325 states and 455 transitions. [2024-10-12 15:11:45,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 15:11:45,105 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2024-10-12 15:11:45,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:45,107 INFO L225 Difference]: With dead ends: 325 [2024-10-12 15:11:45,107 INFO L226 Difference]: Without dead ends: 282 [2024-10-12 15:11:45,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-12 15:11:45,108 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 10 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:45,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 732 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:45,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-12 15:11:45,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 277. [2024-10-12 15:11:45,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 217 states have (on average 1.304147465437788) internal successors, (283), 225 states have internal predecessors, (283), 39 states have call successors, (39), 12 states have call predecessors, (39), 20 states have return successors, (69), 39 states have call predecessors, (69), 38 states have call successors, (69) [2024-10-12 15:11:45,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 391 transitions. [2024-10-12 15:11:45,130 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 391 transitions. Word has length 42 [2024-10-12 15:11:45,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:45,131 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 391 transitions. [2024-10-12 15:11:45,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 15:11:45,132 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 391 transitions. [2024-10-12 15:11:45,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-12 15:11:45,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:45,133 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:45,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 15:11:45,133 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:45,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:45,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1929671845, now seen corresponding path program 1 times [2024-10-12 15:11:45,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:45,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659695937] [2024-10-12 15:11:45,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:45,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:45,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:45,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:45,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 15:11:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:45,167 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 15:11:45,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:45,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659695937] [2024-10-12 15:11:45,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659695937] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:45,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405649739] [2024-10-12 15:11:45,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:45,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:45,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:45,170 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:11:45,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-12 15:11:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:45,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:11:45,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:45,242 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 15:11:45,243 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:45,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405649739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:45,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:11:45,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-10-12 15:11:45,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930459632] [2024-10-12 15:11:45,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:45,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:45,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:45,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:45,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:11:45,244 INFO L87 Difference]: Start difference. First operand 277 states and 391 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 15:11:45,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:45,292 INFO L93 Difference]: Finished difference Result 557 states and 790 transitions. [2024-10-12 15:11:45,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:45,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2024-10-12 15:11:45,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:45,294 INFO L225 Difference]: With dead ends: 557 [2024-10-12 15:11:45,294 INFO L226 Difference]: Without dead ends: 282 [2024-10-12 15:11:45,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:11:45,298 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:45,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 169 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:11:45,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-12 15:11:45,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2024-10-12 15:11:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 220 states have (on average 1.3045454545454545) internal successors, (287), 228 states have internal predecessors, (287), 39 states have call successors, (39), 12 states have call predecessors, (39), 20 states have return successors, (69), 39 states have call predecessors, (69), 38 states have call successors, (69) [2024-10-12 15:11:45,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 395 transitions. [2024-10-12 15:11:45,317 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 395 transitions. Word has length 42 [2024-10-12 15:11:45,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:45,318 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 395 transitions. [2024-10-12 15:11:45,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 15:11:45,318 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 395 transitions. [2024-10-12 15:11:45,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-12 15:11:45,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:45,319 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:45,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-12 15:11:45,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:45,520 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:45,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:45,521 INFO L85 PathProgramCache]: Analyzing trace with hash -286745755, now seen corresponding path program 1 times [2024-10-12 15:11:45,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:45,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604750800] [2024-10-12 15:11:45,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:45,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:45,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:45,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:45,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 15:11:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 15:11:45,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:45,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604750800] [2024-10-12 15:11:45,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604750800] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:45,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050382162] [2024-10-12 15:11:45,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:45,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:45,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:45,569 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:11:45,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-12 15:11:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:45,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:11:45,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:45,632 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 15:11:45,632 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:45,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050382162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:45,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:11:45,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-10-12 15:11:45,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584558348] [2024-10-12 15:11:45,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:45,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:45,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:45,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:45,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:45,634 INFO L87 Difference]: Start difference. First operand 280 states and 395 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 15:11:45,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:45,679 INFO L93 Difference]: Finished difference Result 563 states and 799 transitions. [2024-10-12 15:11:45,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:45,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2024-10-12 15:11:45,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:45,681 INFO L225 Difference]: With dead ends: 563 [2024-10-12 15:11:45,681 INFO L226 Difference]: Without dead ends: 285 [2024-10-12 15:11:45,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:45,682 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 4 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:45,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 170 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:11:45,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-10-12 15:11:45,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2024-10-12 15:11:45,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 222 states have (on average 1.3018018018018018) internal successors, (289), 230 states have internal predecessors, (289), 39 states have call successors, (39), 12 states have call predecessors, (39), 20 states have return successors, (69), 39 states have call predecessors, (69), 38 states have call successors, (69) [2024-10-12 15:11:45,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 397 transitions. [2024-10-12 15:11:45,700 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 397 transitions. Word has length 43 [2024-10-12 15:11:45,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:45,700 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 397 transitions. [2024-10-12 15:11:45,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 15:11:45,700 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 397 transitions. [2024-10-12 15:11:45,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-12 15:11:45,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:45,701 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:45,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-12 15:11:45,901 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,SelfDestructingSolverStorable13 [2024-10-12 15:11:45,902 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:45,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:45,903 INFO L85 PathProgramCache]: Analyzing trace with hash -494549344, now seen corresponding path program 1 times [2024-10-12 15:11:45,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:45,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828134100] [2024-10-12 15:11:45,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:45,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:45,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:45,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:45,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 15:11:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:45,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 15:11:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:45,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 15:11:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:46,025 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 15:11:46,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:46,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828134100] [2024-10-12 15:11:46,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828134100] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:46,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816426075] [2024-10-12 15:11:46,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:46,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:46,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:46,028 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:11:46,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-12 15:11:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:46,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-12 15:11:46,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:46,189 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 15:11:46,189 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:11:46,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816426075] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:11:46,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:11:46,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 10] total 21 [2024-10-12 15:11:46,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207184939] [2024-10-12 15:11:46,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:11:46,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-12 15:11:46,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:46,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-12 15:11:46,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-10-12 15:11:46,429 INFO L87 Difference]: Start difference. First operand 282 states and 397 transitions. Second operand has 21 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-12 15:11:46,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:46,871 INFO L93 Difference]: Finished difference Result 435 states and 644 transitions. [2024-10-12 15:11:46,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-12 15:11:46,871 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) Word has length 44 [2024-10-12 15:11:46,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:46,874 INFO L225 Difference]: With dead ends: 435 [2024-10-12 15:11:46,874 INFO L226 Difference]: Without dead ends: 401 [2024-10-12 15:11:46,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2024-10-12 15:11:46,876 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 239 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:46,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1343 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 15:11:46,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-12 15:11:46,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 283. [2024-10-12 15:11:46,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 221 states have (on average 1.2941176470588236) internal successors, (286), 231 states have internal predecessors, (286), 40 states have call successors, (40), 11 states have call predecessors, (40), 21 states have return successors, (83), 40 states have call predecessors, (83), 39 states have call successors, (83) [2024-10-12 15:11:46,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 409 transitions. [2024-10-12 15:11:46,898 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 409 transitions. Word has length 44 [2024-10-12 15:11:46,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:46,898 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 409 transitions. [2024-10-12 15:11:46,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-12 15:11:46,899 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 409 transitions. [2024-10-12 15:11:46,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-12 15:11:46,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:46,900 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:46,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-12 15:11:47,103 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,SelfDestructingSolverStorable14 [2024-10-12 15:11:47,104 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:47,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:47,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1803090472, now seen corresponding path program 1 times [2024-10-12 15:11:47,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:47,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533225945] [2024-10-12 15:11:47,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:47,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:47,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:47,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:47,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 15:11:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:47,500 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 15:11:47,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:47,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533225945] [2024-10-12 15:11:47,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533225945] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:47,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002840079] [2024-10-12 15:11:47,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:47,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:47,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:47,503 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:11:47,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-12 15:11:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:47,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 15:11:47,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-12 15:11:47,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:47,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002840079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:47,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:11:47,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2024-10-12 15:11:47,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911976074] [2024-10-12 15:11:47,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:47,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 15:11:47,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:47,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 15:11:47,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2024-10-12 15:11:47,803 INFO L87 Difference]: Start difference. First operand 283 states and 409 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 15:11:47,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:47,911 INFO L93 Difference]: Finished difference Result 289 states and 414 transitions. [2024-10-12 15:11:47,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 15:11:47,912 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-10-12 15:11:47,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:47,914 INFO L225 Difference]: With dead ends: 289 [2024-10-12 15:11:47,914 INFO L226 Difference]: Without dead ends: 287 [2024-10-12 15:11:47,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2024-10-12 15:11:47,915 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 14 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:47,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 495 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:47,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-10-12 15:11:47,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-10-12 15:11:47,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 224 states have (on average 1.2901785714285714) internal successors, (289), 234 states have internal predecessors, (289), 40 states have call successors, (40), 12 states have call predecessors, (40), 22 states have return successors, (83), 40 states have call predecessors, (83), 39 states have call successors, (83) [2024-10-12 15:11:47,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 412 transitions. [2024-10-12 15:11:47,936 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 412 transitions. Word has length 44 [2024-10-12 15:11:47,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:47,936 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 412 transitions. [2024-10-12 15:11:47,936 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 15:11:47,936 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 412 transitions. [2024-10-12 15:11:47,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-12 15:11:47,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:47,937 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:47,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-12 15:11:48,141 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,SelfDestructingSolverStorable15 [2024-10-12 15:11:48,142 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:48,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:48,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1283058859, now seen corresponding path program 1 times [2024-10-12 15:11:48,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:48,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968869680] [2024-10-12 15:11:48,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:48,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:48,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:48,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:48,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 15:11:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:48,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 15:11:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:48,303 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 15:11:48,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:48,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968869680] [2024-10-12 15:11:48,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968869680] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:48,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933675811] [2024-10-12 15:11:48,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:48,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:48,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:48,305 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:11:48,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-12 15:11:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:48,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-12 15:11:48,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:48,541 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 15:11:48,542 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:48,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933675811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:48,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:11:48,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [9] total 18 [2024-10-12 15:11:48,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378662991] [2024-10-12 15:11:48,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:48,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-12 15:11:48,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:48,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-12 15:11:48,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2024-10-12 15:11:48,544 INFO L87 Difference]: Start difference. First operand 287 states and 412 transitions. Second operand has 15 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-12 15:11:48,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:48,772 INFO L93 Difference]: Finished difference Result 375 states and 529 transitions. [2024-10-12 15:11:48,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 15:11:48,772 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2024-10-12 15:11:48,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:48,775 INFO L225 Difference]: With dead ends: 375 [2024-10-12 15:11:48,775 INFO L226 Difference]: Without dead ends: 305 [2024-10-12 15:11:48,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2024-10-12 15:11:48,776 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 68 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:48,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1174 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:48,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-10-12 15:11:48,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 289. [2024-10-12 15:11:48,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 225 states have (on average 1.28) internal successors, (288), 235 states have internal predecessors, (288), 40 states have call successors, (40), 13 states have call predecessors, (40), 23 states have return successors, (83), 40 states have call predecessors, (83), 39 states have call successors, (83) [2024-10-12 15:11:48,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 411 transitions. [2024-10-12 15:11:48,796 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 411 transitions. Word has length 45 [2024-10-12 15:11:48,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:48,796 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 411 transitions. [2024-10-12 15:11:48,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-12 15:11:48,796 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 411 transitions. [2024-10-12 15:11:48,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 15:11:48,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:48,798 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:11:48,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-12 15:11:49,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-12 15:11:49,003 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:49,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:49,003 INFO L85 PathProgramCache]: Analyzing trace with hash -988441476, now seen corresponding path program 1 times [2024-10-12 15:11:49,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:49,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109601355] [2024-10-12 15:11:49,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:49,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:49,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:49,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:49,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 15:11:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:49,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 15:11:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:49,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 15:11:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:49,213 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:11:49,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:49,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109601355] [2024-10-12 15:11:49,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109601355] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:49,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764024961] [2024-10-12 15:11:49,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:49,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:49,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:49,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-10-12 15:11:49,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-10-12 15:11:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:49,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-12 15:11:49,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:11:49,342 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:49,609 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:11:49,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764024961] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:11:49,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:11:49,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-10-12 15:11:49,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178108721] [2024-10-12 15:11:49,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:11:49,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-12 15:11:49,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:49,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-12 15:11:49,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2024-10-12 15:11:49,611 INFO L87 Difference]: Start difference. First operand 289 states and 411 transitions. Second operand has 25 states, 19 states have (on average 2.526315789473684) internal successors, (48), 21 states have internal predecessors, (48), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 15:11:50,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:50,161 INFO L93 Difference]: Finished difference Result 350 states and 520 transitions. [2024-10-12 15:11:50,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-12 15:11:50,162 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 19 states have (on average 2.526315789473684) internal successors, (48), 21 states have internal predecessors, (48), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 49 [2024-10-12 15:11:50,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:50,164 INFO L225 Difference]: With dead ends: 350 [2024-10-12 15:11:50,164 INFO L226 Difference]: Without dead ends: 320 [2024-10-12 15:11:50,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2024-10-12 15:11:50,165 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 198 mSDsluCounter, 1915 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 2039 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:50,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 2039 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 15:11:50,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-12 15:11:50,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 277. [2024-10-12 15:11:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 217 states have (on average 1.2903225806451613) internal successors, (280), 226 states have internal predecessors, (280), 38 states have call successors, (38), 11 states have call predecessors, (38), 21 states have return successors, (79), 39 states have call predecessors, (79), 37 states have call successors, (79) [2024-10-12 15:11:50,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 397 transitions. [2024-10-12 15:11:50,183 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 397 transitions. Word has length 49 [2024-10-12 15:11:50,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:50,183 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 397 transitions. [2024-10-12 15:11:50,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 19 states have (on average 2.526315789473684) internal successors, (48), 21 states have internal predecessors, (48), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 15:11:50,184 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 397 transitions. [2024-10-12 15:11:50,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 15:11:50,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:50,185 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:11:50,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-12 15:11:50,389 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,SelfDestructingSolverStorable17 [2024-10-12 15:11:50,390 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:50,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:50,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1303146410, now seen corresponding path program 2 times [2024-10-12 15:11:50,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:50,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762029254] [2024-10-12 15:11:50,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:50,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:50,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:50,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:50,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 15:11:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:50,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 15:11:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:50,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 15:11:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:50,585 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:11:50,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:50,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762029254] [2024-10-12 15:11:50,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762029254] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:50,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330117412] [2024-10-12 15:11:50,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 15:11:50,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:50,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:50,588 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:11:50,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-12 15:11:50,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 15:11:50,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 15:11:50,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-12 15:11:50,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:51,376 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 15:11:51,376 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:51,839 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:11:51,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330117412] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:11:51,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:11:51,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 13] total 36 [2024-10-12 15:11:51,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055944047] [2024-10-12 15:11:51,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:11:51,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-12 15:11:51,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:51,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-12 15:11:51,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1167, Unknown=0, NotChecked=0, Total=1260 [2024-10-12 15:11:51,841 INFO L87 Difference]: Start difference. First operand 277 states and 397 transitions. Second operand has 36 states, 27 states have (on average 2.111111111111111) internal successors, (57), 29 states have internal predecessors, (57), 6 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-12 15:11:53,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:53,113 INFO L93 Difference]: Finished difference Result 387 states and 616 transitions. [2024-10-12 15:11:53,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-12 15:11:53,114 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 27 states have (on average 2.111111111111111) internal successors, (57), 29 states have internal predecessors, (57), 6 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) Word has length 49 [2024-10-12 15:11:53,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:53,117 INFO L225 Difference]: With dead ends: 387 [2024-10-12 15:11:53,117 INFO L226 Difference]: Without dead ends: 349 [2024-10-12 15:11:53,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=185, Invalid=2167, Unknown=0, NotChecked=0, Total=2352 [2024-10-12 15:11:53,119 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 158 mSDsluCounter, 3520 mSDsCounter, 0 mSdLazyCounter, 1337 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 3651 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:53,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 3651 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1337 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:11:53,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-12 15:11:53,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 269. [2024-10-12 15:11:53,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 210 states have (on average 1.3) internal successors, (273), 221 states have internal predecessors, (273), 37 states have call successors, (37), 9 states have call predecessors, (37), 21 states have return successors, (78), 38 states have call predecessors, (78), 36 states have call successors, (78) [2024-10-12 15:11:53,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 388 transitions. [2024-10-12 15:11:53,145 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 388 transitions. Word has length 49 [2024-10-12 15:11:53,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:53,145 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 388 transitions. [2024-10-12 15:11:53,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 27 states have (on average 2.111111111111111) internal successors, (57), 29 states have internal predecessors, (57), 6 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-12 15:11:53,145 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 388 transitions. [2024-10-12 15:11:53,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 15:11:53,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:53,147 INFO L215 NwaCegarLoop]: trace histogram [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-10-12 15:11:53,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-12 15:11:53,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:53,347 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:53,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:53,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1166570143, now seen corresponding path program 1 times [2024-10-12 15:11:53,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:53,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665873989] [2024-10-12 15:11:53,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:53,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:53,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:53,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:53,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 15:11:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:53,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 15:11:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 15:11:53,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:53,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665873989] [2024-10-12 15:11:53,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665873989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:53,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:53,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 15:11:53,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207207279] [2024-10-12 15:11:53,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:53,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 15:11:53,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:53,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 15:11:53,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 15:11:53,518 INFO L87 Difference]: Start difference. First operand 269 states and 388 transitions. Second operand has 9 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 15:11:53,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:53,628 INFO L93 Difference]: Finished difference Result 455 states and 645 transitions. [2024-10-12 15:11:53,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 15:11:53,628 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2024-10-12 15:11:53,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:53,630 INFO L225 Difference]: With dead ends: 455 [2024-10-12 15:11:53,630 INFO L226 Difference]: Without dead ends: 282 [2024-10-12 15:11:53,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-12 15:11:53,632 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 58 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:53,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 706 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:53,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-12 15:11:53,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 269. [2024-10-12 15:11:53,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 221 states have internal predecessors, (271), 37 states have call successors, (37), 9 states have call predecessors, (37), 21 states have return successors, (78), 38 states have call predecessors, (78), 36 states have call successors, (78) [2024-10-12 15:11:53,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 386 transitions. [2024-10-12 15:11:53,655 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 386 transitions. Word has length 50 [2024-10-12 15:11:53,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:53,655 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 386 transitions. [2024-10-12 15:11:53,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 15:11:53,656 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 386 transitions. [2024-10-12 15:11:53,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 15:11:53,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:53,657 INFO L215 NwaCegarLoop]: trace histogram [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-10-12 15:11:53,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 15:11:53,657 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:53,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:53,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1777007429, now seen corresponding path program 1 times [2024-10-12 15:11:53,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:53,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908150101] [2024-10-12 15:11:53,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:53,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:53,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:53,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:53,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 15:11:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:53,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 15:11:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:53,817 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 15:11:53,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:53,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908150101] [2024-10-12 15:11:53,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908150101] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:53,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308646149] [2024-10-12 15:11:53,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:53,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:53,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:53,820 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:11:53,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-12 15:11:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:53,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 15:11:53,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:53,898 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:11:53,898 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:54,039 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 15:11:54,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308646149] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:11:54,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:11:54,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 15 [2024-10-12 15:11:54,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169425910] [2024-10-12 15:11:54,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:11:54,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-12 15:11:54,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:54,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-12 15:11:54,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-12 15:11:54,041 INFO L87 Difference]: Start difference. First operand 269 states and 386 transitions. Second operand has 15 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-12 15:11:54,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:54,146 INFO L93 Difference]: Finished difference Result 393 states and 551 transitions. [2024-10-12 15:11:54,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 15:11:54,146 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 50 [2024-10-12 15:11:54,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:54,150 INFO L225 Difference]: With dead ends: 393 [2024-10-12 15:11:54,150 INFO L226 Difference]: Without dead ends: 315 [2024-10-12 15:11:54,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-12 15:11:54,152 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 114 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:54,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1113 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:54,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-12 15:11:54,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 304. [2024-10-12 15:11:54,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 239 states have (on average 1.301255230125523) internal successors, (311), 252 states have internal predecessors, (311), 40 states have call successors, (40), 10 states have call predecessors, (40), 24 states have return successors, (79), 41 states have call predecessors, (79), 39 states have call successors, (79) [2024-10-12 15:11:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 430 transitions. [2024-10-12 15:11:54,172 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 430 transitions. Word has length 50 [2024-10-12 15:11:54,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:54,173 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 430 transitions. [2024-10-12 15:11:54,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-12 15:11:54,173 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 430 transitions. [2024-10-12 15:11:54,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 15:11:54,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:54,174 INFO L215 NwaCegarLoop]: trace histogram [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-10-12 15:11:54,192 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-10-12 15:11:54,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:54,375 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:54,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:54,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1496891513, now seen corresponding path program 2 times [2024-10-12 15:11:54,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:54,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774744463] [2024-10-12 15:11:54,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:54,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:54,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 15:11:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:54,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 15:11:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:54,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 15:11:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:54,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 15:11:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:54,531 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 15:11:54,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:54,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774744463] [2024-10-12 15:11:54,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774744463] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:54,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275906324] [2024-10-12 15:11:54,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 15:11:54,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:54,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:54,534 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:11:54,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-12 15:11:54,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 15:11:54,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 15:11:54,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-12 15:11:54,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:54,635 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:11:54,635 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:54,771 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 15:11:54,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275906324] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:11:54,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:11:54,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-10-12 15:11:54,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528398248] [2024-10-12 15:11:54,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:11:54,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 15:11:54,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:54,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 15:11:54,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-10-12 15:11:54,773 INFO L87 Difference]: Start difference. First operand 304 states and 430 transitions. Second operand has 16 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-12 15:11:55,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:55,019 INFO L93 Difference]: Finished difference Result 524 states and 737 transitions. [2024-10-12 15:11:55,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 15:11:55,020 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 50 [2024-10-12 15:11:55,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:55,022 INFO L225 Difference]: With dead ends: 524 [2024-10-12 15:11:55,022 INFO L226 Difference]: Without dead ends: 343 [2024-10-12 15:11:55,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-10-12 15:11:55,024 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 133 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:55,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1206 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 15:11:55,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-10-12 15:11:55,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 304. [2024-10-12 15:11:55,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 239 states have (on average 1.292887029288703) internal successors, (309), 252 states have internal predecessors, (309), 40 states have call successors, (40), 10 states have call predecessors, (40), 24 states have return successors, (79), 41 states have call predecessors, (79), 39 states have call successors, (79) [2024-10-12 15:11:55,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 428 transitions. [2024-10-12 15:11:55,049 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 428 transitions. Word has length 50 [2024-10-12 15:11:55,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:55,049 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 428 transitions. [2024-10-12 15:11:55,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-12 15:11:55,049 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 428 transitions. [2024-10-12 15:11:55,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 15:11:55,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:55,050 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:11:55,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-12 15:11:55,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:55,251 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:55,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:55,251 INFO L85 PathProgramCache]: Analyzing trace with hash -814828544, now seen corresponding path program 1 times [2024-10-12 15:11:55,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:55,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823942580] [2024-10-12 15:11:55,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:55,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 15:11:55,286 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 15:11:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 15:11:55,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 15:11:55,332 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 15:11:55,335 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:11:55,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 15:11:55,339 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:55,378 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:11:55,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:11:55 BoogieIcfgContainer [2024-10-12 15:11:55,382 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:11:55,382 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:11:55,382 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:11:55,383 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:11:55,383 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:11:34" (3/4) ... [2024-10-12 15:11:55,385 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 15:11:55,386 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:11:55,386 INFO L158 Benchmark]: Toolchain (without parser) took 22338.21ms. Allocated memory was 151.0MB in the beginning and 257.9MB in the end (delta: 107.0MB). Free memory was 95.9MB in the beginning and 150.5MB in the end (delta: -54.6MB). Peak memory consumption was 54.6MB. Max. memory is 16.1GB. [2024-10-12 15:11:55,389 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 151.0MB. Free memory is still 112.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:11:55,389 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.46ms. Allocated memory is still 151.0MB. Free memory was 95.9MB in the beginning and 80.7MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-12 15:11:55,390 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.53ms. Allocated memory is still 151.0MB. Free memory was 80.4MB in the beginning and 79.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 15:11:55,390 INFO L158 Benchmark]: Boogie Preprocessor took 39.70ms. Allocated memory is still 151.0MB. Free memory was 79.1MB in the beginning and 76.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 15:11:55,390 INFO L158 Benchmark]: RCFGBuilder took 648.38ms. Allocated memory is still 151.0MB. Free memory was 76.6MB in the beginning and 117.8MB in the end (delta: -41.2MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2024-10-12 15:11:55,390 INFO L158 Benchmark]: TraceAbstraction took 21246.04ms. Allocated memory was 151.0MB in the beginning and 257.9MB in the end (delta: 107.0MB). Free memory was 117.0MB in the beginning and 150.5MB in the end (delta: -33.5MB). Peak memory consumption was 75.3MB. Max. memory is 16.1GB. [2024-10-12 15:11:55,390 INFO L158 Benchmark]: Witness Printer took 3.62ms. Allocated memory is still 257.9MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:11:55,391 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.18ms. Allocated memory is still 151.0MB. Free memory is still 112.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.46ms. Allocated memory is still 151.0MB. Free memory was 95.9MB in the beginning and 80.7MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.53ms. Allocated memory is still 151.0MB. Free memory was 80.4MB in the beginning and 79.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.70ms. Allocated memory is still 151.0MB. Free memory was 79.1MB in the beginning and 76.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 648.38ms. Allocated memory is still 151.0MB. Free memory was 76.6MB in the beginning and 117.8MB in the end (delta: -41.2MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. * TraceAbstraction took 21246.04ms. Allocated memory was 151.0MB in the beginning and 257.9MB in the end (delta: 107.0MB). Free memory was 117.0MB in the beginning and 150.5MB in the end (delta: -33.5MB). Peak memory consumption was 75.3MB. Max. memory is 16.1GB. * Witness Printer took 3.62ms. Allocated memory is still 257.9MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; VAL [ea=-127, eb=127] [L241] 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); [L241] RET, EXPR base2flt(0, 0) VAL [ea=-127, eb=127] [L241] zero = base2flt(0, 0) [L242] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-127, \old(m)=4311744512] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L29] COND FALSE !(! m) VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L57] COND TRUE 1 VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L76] EXPR m & ~ (1U << 24U) VAL [\old(e)=-127, \old(m)=4311744512, e=-127] [L76] m = m & ~ (1U << 24U) [L77] EXPR m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-127, \old(m)=4311744512] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-127, \old(m)=4311744512, __retres4=16777216] [L80] return (__retres4); [L242] RET, EXPR base2flt(ma, ea) VAL [ea=-127, eb=127, ma=4311744512] [L242] a = base2flt(ma, ea) [L243] CALL, EXPR base2flt(mb, eb) 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); [L243] RET, EXPR base2flt(mb, eb) VAL [a=16777216, ea=-127, eb=127, ma=4311744512, mb=33554432] [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) VAL [\old(a)=16777216, \old(b)=4294967295] [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 [\old(a)=16777216, \old(b)=4294967295, a=16777216, b=4294967295] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [\old(a)=16777216, \old(b)=4294967295, a=4294967295, b=16777216] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 VAL [\old(a)=16777216, \old(b)=4294967295, a=4294967295, b=16777216, ea=127, ma=16777215] [L110] EXPR ma | (1U << 24U) VAL [\old(a)=16777216, \old(b)=4294967295, a=4294967295, b=16777216, ea=127] [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 VAL [\old(a)=16777216, \old(b)=4294967295, a=4294967295, ea=127, eb=-127, ma=16777216, mb=0] [L113] EXPR mb | (1U << 24U) VAL [\old(a)=16777216, \old(b)=4294967295, a=4294967295, ea=127, eb=-127, ma=16777216] [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 [\old(a)=16777216, \old(b)=4294967295, a=4294967295, ea=127, eb=-127, ma=16777216, mb=16777216] [L115] delta = ea - eb VAL [\old(a)=16777216, \old(b)=4294967295, a=4294967295, delta=254, ea=127, ma=16777216, 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 4 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.1s, OverallIterations: 23, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2232 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2064 mSDsluCounter, 28592 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26177 mSDsCounter, 313 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7023 IncrementalHoareTripleChecker+Invalid, 7336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 313 mSolverCounterUnsat, 2415 mSDtfsCounter, 7023 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1544 GetRequests, 1106 SyntacticMatches, 5 SemanticMatches, 433 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2088 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=305occurred in iteration=11, InterpolantAutomatonStates: 324, 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, 22 MinimizatonAttempts, 829 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 1627 NumberOfCodeBlocks, 1611 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1924 ConstructedInterpolants, 1 QuantifiedInterpolants, 4612 SizeOfPredicates, 26 NumberOfNonLiveVariables, 2131 ConjunctsInSsa, 320 ConjunctsInUnsatCore, 46 InterpolantComputations, 13 PerfectInterpolantSequences, 631/738 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-12 15:11:55,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-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 c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:11:57,554 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:11:57,636 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-12 15:11:57,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:11:57,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:11:57,673 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:11:57,674 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:11:57,674 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:11:57,674 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:11:57,675 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:11:57,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:11:57,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:11:57,676 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:11:57,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:11:57,677 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:11:57,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:11:57,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:11:57,679 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:11:57,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:11:57,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:11:57,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:11:57,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:11:57,684 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:11:57,684 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 15:11:57,684 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 15:11:57,684 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:11:57,685 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 15:11:57,685 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:11:57,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:11:57,685 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:11:57,686 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:11:57,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:11:57,688 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:11:57,688 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:11:57,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:11:57,689 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:11:57,689 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:11:57,690 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:11:57,690 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 15:11:57,691 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 15:11:57,691 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:11:57,691 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:11:57,691 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:11:57,692 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:11:57,692 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 15:11:57,692 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 -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2024-10-12 15:11:58,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:11:58,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:11:58,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:11:58,051 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:11:58,051 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:11:58,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-10-12 15:11:59,543 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:11:59,742 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:11:59,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-10-12 15:11:59,752 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29d02e8bd/d8a668047c134534bb20a35d5395188e/FLAG756fbe629 [2024-10-12 15:11:59,763 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29d02e8bd/d8a668047c134534bb20a35d5395188e [2024-10-12 15:11:59,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:11:59,766 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:11:59,768 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:11:59,768 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:11:59,783 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:11:59,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:11:59" (1/1) ... [2024-10-12 15:11:59,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd3e006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:59, skipping insertion in model container [2024-10-12 15:11:59,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:11:59" (1/1) ... [2024-10-12 15:11:59,807 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:11:59,990 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2024-10-12 15:12:00,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:12:00,072 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:12:00,084 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2024-10-12 15:12:00,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:12:00,139 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:12:00,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:00 WrapperNode [2024-10-12 15:12:00,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:12:00,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:12:00,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:12:00,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:12:00,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:00" (1/1) ... [2024-10-12 15:12:00,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:00" (1/1) ... [2024-10-12 15:12:00,174 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2024-10-12 15:12:00,175 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:12:00,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:12:00,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:12:00,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:12:00,187 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:00" (1/1) ... [2024-10-12 15:12:00,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:00" (1/1) ... [2024-10-12 15:12:00,193 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:00" (1/1) ... [2024-10-12 15:12:00,217 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 15:12:00,217 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:00" (1/1) ... [2024-10-12 15:12:00,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:00" (1/1) ... [2024-10-12 15:12:00,226 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:00" (1/1) ... [2024-10-12 15:12:00,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:00" (1/1) ... [2024-10-12 15:12:00,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:00" (1/1) ... [2024-10-12 15:12:00,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:00" (1/1) ... [2024-10-12 15:12:00,243 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:12:00,247 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:12:00,247 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:12:00,247 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:12:00,248 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:00" (1/1) ... [2024-10-12 15:12:00,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:12:00,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:12:00,278 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 15:12:00,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 15:12:00,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:12:00,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 15:12:00,337 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-10-12 15:12:00,337 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-10-12 15:12:00,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:12:00,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:12:00,338 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-10-12 15:12:00,338 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-10-12 15:12:00,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-12 15:12:00,338 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-12 15:12:00,405 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:12:00,406 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:12:00,630 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-12 15:12:00,630 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:12:00,656 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:12:00,656 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 15:12:00,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:12:00 BoogieIcfgContainer [2024-10-12 15:12:00,657 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:12:00,663 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:12:00,663 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:12:00,666 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:12:00,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:11:59" (1/3) ... [2024-10-12 15:12:00,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285e8557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:12:00, skipping insertion in model container [2024-10-12 15:12:00,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:00" (2/3) ... [2024-10-12 15:12:00,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285e8557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:12:00, skipping insertion in model container [2024-10-12 15:12:00,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:12:00" (3/3) ... [2024-10-12 15:12:00,673 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2024-10-12 15:12:00,692 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:12:00,692 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:12:00,748 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:12:00,757 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;@64e9c02b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:12:00,757 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:12:00,770 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 35 states have (on average 1.542857142857143) internal successors, (54), 36 states have internal predecessors, (54), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-12 15:12:00,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 15:12:00,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:00,782 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:12:00,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:00,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:00,791 INFO L85 PathProgramCache]: Analyzing trace with hash -2129999647, now seen corresponding path program 1 times [2024-10-12 15:12:00,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:12:00,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932554170] [2024-10-12 15:12:00,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:00,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:12:00,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:12:00,810 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 15:12:00,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-12 15:12:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:00,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 15:12:00,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:12:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 15:12:01,081 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:12:01,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:12:01,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932554170] [2024-10-12 15:12:01,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932554170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:01,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:01,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 15:12:01,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214410180] [2024-10-12 15:12:01,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:01,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 15:12:01,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:12:01,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 15:12:01,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 15:12:01,111 INFO L87 Difference]: Start difference. First operand has 49 states, 35 states have (on average 1.542857142857143) internal successors, (54), 36 states have internal predecessors, (54), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 15:12:01,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:01,289 INFO L93 Difference]: Finished difference Result 113 states and 178 transitions. [2024-10-12 15:12:01,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 15:12:01,303 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-10-12 15:12:01,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:01,312 INFO L225 Difference]: With dead ends: 113 [2024-10-12 15:12:01,313 INFO L226 Difference]: Without dead ends: 63 [2024-10-12 15:12:01,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-12 15:12:01,320 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 12 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:01,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 400 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:12:01,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-12 15:12:01,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2024-10-12 15:12:01,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.35) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-12 15:12:01,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2024-10-12 15:12:01,361 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 27 [2024-10-12 15:12:01,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:01,361 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2024-10-12 15:12:01,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 15:12:01,362 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2024-10-12 15:12:01,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-12 15:12:01,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:01,364 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:12:01,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-12 15:12:01,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:12:01,568 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:01,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:01,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1461087604, now seen corresponding path program 1 times [2024-10-12 15:12:01,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:12:01,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [798561047] [2024-10-12 15:12:01,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:01,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:12:01,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:12:01,574 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 15:12:01,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-12 15:12:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:01,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 15:12:01,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:12:01,715 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 15:12:01,715 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:12:01,794 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 15:12:01,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:12:01,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [798561047] [2024-10-12 15:12:01,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [798561047] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:12:01,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 15:12:01,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-10-12 15:12:01,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043274860] [2024-10-12 15:12:01,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 15:12:01,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 15:12:01,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:12:01,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 15:12:01,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 15:12:01,801 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 15:12:01,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:01,965 INFO L93 Difference]: Finished difference Result 107 states and 145 transitions. [2024-10-12 15:12:01,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 15:12:01,966 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-10-12 15:12:01,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:01,968 INFO L225 Difference]: With dead ends: 107 [2024-10-12 15:12:01,968 INFO L226 Difference]: Without dead ends: 80 [2024-10-12 15:12:01,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-12 15:12:01,973 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 14 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:01,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 447 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:12:01,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-12 15:12:01,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 65. [2024-10-12 15:12:01,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.326086956521739) internal successors, (61), 48 states have internal predecessors, (61), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2024-10-12 15:12:01,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 88 transitions. [2024-10-12 15:12:01,994 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 88 transitions. Word has length 31 [2024-10-12 15:12:01,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:01,994 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 88 transitions. [2024-10-12 15:12:01,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 15:12:01,995 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 88 transitions. [2024-10-12 15:12:01,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-12 15:12:01,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:01,996 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] [2024-10-12 15:12:02,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-12 15:12:02,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:12:02,200 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:02,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:02,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1786129759, now seen corresponding path program 1 times [2024-10-12 15:12:02,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:12:02,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922753595] [2024-10-12 15:12:02,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:02,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:12:02,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:12:02,205 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 15:12:02,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-12 15:12:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:02,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 15:12:02,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:12:02,313 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 15:12:02,314 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:12:02,362 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 15:12:02,362 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:12:02,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922753595] [2024-10-12 15:12:02,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922753595] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:12:02,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 15:12:02,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-10-12 15:12:02,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990402343] [2024-10-12 15:12:02,363 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 15:12:02,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 15:12:02,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:12:02,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 15:12:02,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 15:12:02,365 INFO L87 Difference]: Start difference. First operand 65 states and 88 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 15:12:02,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:02,455 INFO L93 Difference]: Finished difference Result 102 states and 138 transitions. [2024-10-12 15:12:02,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 15:12:02,456 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2024-10-12 15:12:02,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:02,459 INFO L225 Difference]: With dead ends: 102 [2024-10-12 15:12:02,459 INFO L226 Difference]: Without dead ends: 79 [2024-10-12 15:12:02,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-12 15:12:02,461 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 11 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:02,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 408 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:12:02,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-12 15:12:02,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2024-10-12 15:12:02,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 54 states have internal predecessors, (67), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2024-10-12 15:12:02,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 98 transitions. [2024-10-12 15:12:02,475 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 98 transitions. Word has length 34 [2024-10-12 15:12:02,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:02,476 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 98 transitions. [2024-10-12 15:12:02,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 15:12:02,476 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2024-10-12 15:12:02,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 15:12:02,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:02,478 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:12:02,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-12 15:12:02,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:12:02,681 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:02,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:02,682 INFO L85 PathProgramCache]: Analyzing trace with hash -867370505, now seen corresponding path program 2 times [2024-10-12 15:12:02,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:12:02,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2116038663] [2024-10-12 15:12:02,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 15:12:02,682 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:12:02,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:12:02,685 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 15:12:02,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-12 15:12:02,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-12 15:12:02,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 15:12:02,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 15:12:02,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:12:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 15:12:02,882 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:12:02,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:12:02,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2116038663] [2024-10-12 15:12:02,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2116038663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:02,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:02,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 15:12:02,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7009918] [2024-10-12 15:12:02,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:02,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 15:12:02,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:12:02,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 15:12:02,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:12:02,884 INFO L87 Difference]: Start difference. First operand 74 states and 98 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 15:12:03,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:03,011 INFO L93 Difference]: Finished difference Result 84 states and 109 transitions. [2024-10-12 15:12:03,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 15:12:03,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-10-12 15:12:03,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:03,015 INFO L225 Difference]: With dead ends: 84 [2024-10-12 15:12:03,016 INFO L226 Difference]: Without dead ends: 82 [2024-10-12 15:12:03,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:12:03,018 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 3 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:03,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 283 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:12:03,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-12 15:12:03,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2024-10-12 15:12:03,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 59 states have internal predecessors, (72), 15 states have call successors, (15), 7 states have call predecessors, (15), 8 states have return successors, (18), 13 states have call predecessors, (18), 14 states have call successors, (18) [2024-10-12 15:12:03,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 105 transitions. [2024-10-12 15:12:03,039 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 105 transitions. Word has length 35 [2024-10-12 15:12:03,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:03,039 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 105 transitions. [2024-10-12 15:12:03,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 15:12:03,039 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2024-10-12 15:12:03,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 15:12:03,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:03,042 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:12:03,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-12 15:12:03,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:12:03,243 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:03,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:03,244 INFO L85 PathProgramCache]: Analyzing trace with hash -810112203, now seen corresponding path program 1 times [2024-10-12 15:12:03,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:12:03,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718174417] [2024-10-12 15:12:03,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:03,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:12:03,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:12:03,246 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 15:12:03,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-12 15:12:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:03,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 15:12:03,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:12:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 15:12:03,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:12:03,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:12:03,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718174417] [2024-10-12 15:12:03,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718174417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:03,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:03,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 15:12:03,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497242105] [2024-10-12 15:12:03,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:03,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 15:12:03,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:12:03,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 15:12:03,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:12:03,414 INFO L87 Difference]: Start difference. First operand 80 states and 105 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 15:12:03,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:03,529 INFO L93 Difference]: Finished difference Result 86 states and 110 transitions. [2024-10-12 15:12:03,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 15:12:03,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-10-12 15:12:03,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:03,531 INFO L225 Difference]: With dead ends: 86 [2024-10-12 15:12:03,531 INFO L226 Difference]: Without dead ends: 84 [2024-10-12 15:12:03,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:12:03,532 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 3 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:03,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 278 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:12:03,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-12 15:12:03,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2024-10-12 15:12:03,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 57 states have internal predecessors, (70), 14 states have call successors, (14), 7 states have call predecessors, (14), 8 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2024-10-12 15:12:03,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2024-10-12 15:12:03,549 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 35 [2024-10-12 15:12:03,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:03,549 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2024-10-12 15:12:03,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 15:12:03,549 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2024-10-12 15:12:03,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 15:12:03,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:03,553 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] [2024-10-12 15:12:03,559 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 (6)] Forceful destruction successful, exit code 0 [2024-10-12 15:12:03,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:12:03,754 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:03,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:03,755 INFO L85 PathProgramCache]: Analyzing trace with hash -899164875, now seen corresponding path program 1 times [2024-10-12 15:12:03,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:12:03,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055636910] [2024-10-12 15:12:03,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:03,756 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:12:03,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:12:03,758 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 15:12:03,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-12 15:12:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:03,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 15:12:03,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:12:03,925 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 15:12:03,926 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:12:03,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:12:03,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055636910] [2024-10-12 15:12:03,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055636910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:03,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:03,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 15:12:03,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342257119] [2024-10-12 15:12:03,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:03,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 15:12:03,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:12:03,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 15:12:03,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-12 15:12:03,939 INFO L87 Difference]: Start difference. First operand 78 states and 101 transitions. Second operand has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 15:12:04,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:04,174 INFO L93 Difference]: Finished difference Result 114 states and 153 transitions. [2024-10-12 15:12:04,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 15:12:04,175 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2024-10-12 15:12:04,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:04,177 INFO L225 Difference]: With dead ends: 114 [2024-10-12 15:12:04,178 INFO L226 Difference]: Without dead ends: 107 [2024-10-12 15:12:04,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-12 15:12:04,180 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 21 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:04,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 607 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 15:12:04,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-12 15:12:04,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 92. [2024-10-12 15:12:04,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.265625) internal successors, (81), 66 states have internal predecessors, (81), 18 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (24), 18 states have call predecessors, (24), 17 states have call successors, (24) [2024-10-12 15:12:04,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 123 transitions. [2024-10-12 15:12:04,201 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 123 transitions. Word has length 38 [2024-10-12 15:12:04,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:04,202 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 123 transitions. [2024-10-12 15:12:04,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 15:12:04,202 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions. [2024-10-12 15:12:04,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 15:12:04,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:04,203 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] [2024-10-12 15:12:04,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-12 15:12:04,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:12:04,407 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:04,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:04,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1049521637, now seen corresponding path program 1 times [2024-10-12 15:12:04,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:12:04,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41912939] [2024-10-12 15:12:04,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:04,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:12:04,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:12:04,409 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 15:12:04,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-12 15:12:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:04,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 15:12:04,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:12:04,555 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 15:12:04,555 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:12:04,741 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 15:12:04,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:12:04,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41912939] [2024-10-12 15:12:04,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41912939] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:12:04,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 15:12:04,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2024-10-12 15:12:04,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191584113] [2024-10-12 15:12:04,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 15:12:04,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 15:12:04,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:12:04,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 15:12:04,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-12 15:12:04,743 INFO L87 Difference]: Start difference. First operand 92 states and 123 transitions. Second operand has 14 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 15:12:04,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:04,997 INFO L93 Difference]: Finished difference Result 121 states and 161 transitions. [2024-10-12 15:12:04,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 15:12:04,998 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2024-10-12 15:12:04,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:04,999 INFO L225 Difference]: With dead ends: 121 [2024-10-12 15:12:04,999 INFO L226 Difference]: Without dead ends: 113 [2024-10-12 15:12:05,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-10-12 15:12:05,000 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 22 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:05,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 773 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 15:12:05,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-12 15:12:05,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 102. [2024-10-12 15:12:05,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 72 states have (on average 1.25) internal successors, (90), 73 states have internal predecessors, (90), 19 states have call successors, (19), 7 states have call predecessors, (19), 10 states have return successors, (26), 21 states have call predecessors, (26), 18 states have call successors, (26) [2024-10-12 15:12:05,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 135 transitions. [2024-10-12 15:12:05,013 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 135 transitions. Word has length 40 [2024-10-12 15:12:05,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:05,013 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 135 transitions. [2024-10-12 15:12:05,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 15:12:05,014 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 135 transitions. [2024-10-12 15:12:05,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 15:12:05,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:05,015 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] [2024-10-12 15:12:05,020 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-10-12 15:12:05,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:12:05,218 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:05,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:05,219 INFO L85 PathProgramCache]: Analyzing trace with hash -992263335, now seen corresponding path program 1 times [2024-10-12 15:12:05,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:12:05,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198258201] [2024-10-12 15:12:05,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:05,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:12:05,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:12:05,223 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 15:12:05,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-12 15:12:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:05,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 15:12:05,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:12:05,311 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-12 15:12:05,312 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:12:05,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:12:05,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198258201] [2024-10-12 15:12:05,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [198258201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:05,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:05,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 15:12:05,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673070841] [2024-10-12 15:12:05,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:05,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 15:12:05,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:12:05,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 15:12:05,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:12:05,314 INFO L87 Difference]: Start difference. First operand 102 states and 135 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-12 15:12:05,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:05,375 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2024-10-12 15:12:05,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 15:12:05,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 40 [2024-10-12 15:12:05,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:05,376 INFO L225 Difference]: With dead ends: 110 [2024-10-12 15:12:05,377 INFO L226 Difference]: Without dead ends: 95 [2024-10-12 15:12:05,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:12:05,379 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 3 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 288 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-10-12 15:12:05,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 288 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:05,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-12 15:12:05,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-12 15:12:05,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 69 states have internal predecessors, (83), 17 states have call successors, (17), 7 states have call predecessors, (17), 10 states have return successors, (23), 18 states have call predecessors, (23), 16 states have call successors, (23) [2024-10-12 15:12:05,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2024-10-12 15:12:05,396 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 40 [2024-10-12 15:12:05,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:05,396 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2024-10-12 15:12:05,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-12 15:12:05,397 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2024-10-12 15:12:05,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-12 15:12:05,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:05,398 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:12:05,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 (9)] Ended with exit code 0 [2024-10-12 15:12:05,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:12:05,602 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:05,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:05,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1844658447, now seen corresponding path program 1 times [2024-10-12 15:12:05,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:12:05,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585928975] [2024-10-12 15:12:05,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:05,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:12:05,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:12:05,605 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 15:12:05,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-12 15:12:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:05,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 15:12:05,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:12:05,735 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 15:12:05,737 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:12:05,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:12:05,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585928975] [2024-10-12 15:12:05,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585928975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:05,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:05,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 15:12:05,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850784719] [2024-10-12 15:12:05,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:05,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 15:12:05,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:12:05,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 15:12:05,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 15:12:05,740 INFO L87 Difference]: Start difference. First operand 95 states and 123 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 15:12:05,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:05,853 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2024-10-12 15:12:05,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 15:12:05,854 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 44 [2024-10-12 15:12:05,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:05,855 INFO L225 Difference]: With dead ends: 143 [2024-10-12 15:12:05,857 INFO L226 Difference]: Without dead ends: 108 [2024-10-12 15:12:05,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-12 15:12:05,858 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 11 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:05,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 545 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:12:05,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-12 15:12:05,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 95. [2024-10-12 15:12:05,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 70 states have internal predecessors, (83), 15 states have call successors, (15), 8 states have call predecessors, (15), 11 states have return successors, (19), 16 states have call predecessors, (19), 14 states have call successors, (19) [2024-10-12 15:12:05,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2024-10-12 15:12:05,871 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 44 [2024-10-12 15:12:05,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:05,872 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2024-10-12 15:12:05,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 15:12:05,872 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2024-10-12 15:12:05,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-12 15:12:05,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:05,874 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:12:05,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-12 15:12:06,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:12:06,074 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:06,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:06,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2074234608, now seen corresponding path program 1 times [2024-10-12 15:12:06,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:12:06,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249132402] [2024-10-12 15:12:06,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:06,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:12:06,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:12:06,076 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 15:12:06,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-12 15:12:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 15:12:06,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 15:12:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 15:12:06,177 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-12 15:12:06,177 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 15:12:06,178 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:12:06,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-12 15:12:06,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:12:06,387 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:12:06,416 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:12:06,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:12:06 BoogieIcfgContainer [2024-10-12 15:12:06,419 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:12:06,419 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:12:06,419 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:12:06,420 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:12:06,420 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:12:00" (3/4) ... [2024-10-12 15:12:06,421 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 15:12:06,494 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 15:12:06,497 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:12:06,497 INFO L158 Benchmark]: Toolchain (without parser) took 6731.09ms. Allocated memory was 65.0MB in the beginning and 96.5MB in the end (delta: 31.5MB). Free memory was 31.4MB in the beginning and 72.5MB in the end (delta: -41.1MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2024-10-12 15:12:06,498 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 50.3MB. Free memory is still 33.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:12:06,498 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.61ms. Allocated memory is still 65.0MB. Free memory was 31.2MB in the beginning and 31.9MB in the end (delta: -654.6kB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2024-10-12 15:12:06,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.43ms. Allocated memory is still 65.0MB. Free memory was 31.9MB in the beginning and 30.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:12:06,498 INFO L158 Benchmark]: Boogie Preprocessor took 70.94ms. Allocated memory is still 65.0MB. Free memory was 30.3MB in the beginning and 28.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 15:12:06,499 INFO L158 Benchmark]: RCFGBuilder took 410.06ms. Allocated memory is still 65.0MB. Free memory was 28.2MB in the beginning and 30.3MB in the end (delta: -2.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 15:12:06,499 INFO L158 Benchmark]: TraceAbstraction took 5756.17ms. Allocated memory was 65.0MB in the beginning and 96.5MB in the end (delta: 31.5MB). Free memory was 29.7MB in the beginning and 32.1MB in the end (delta: -2.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-12 15:12:06,499 INFO L158 Benchmark]: Witness Printer took 77.51ms. Allocated memory is still 96.5MB. Free memory was 32.1MB in the beginning and 72.5MB in the end (delta: -40.4MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. [2024-10-12 15:12:06,500 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.17ms. Allocated memory is still 50.3MB. Free memory is still 33.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.61ms. Allocated memory is still 65.0MB. Free memory was 31.2MB in the beginning and 31.9MB in the end (delta: -654.6kB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.43ms. Allocated memory is still 65.0MB. Free memory was 31.9MB in the beginning and 30.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 70.94ms. Allocated memory is still 65.0MB. Free memory was 30.3MB in the beginning and 28.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 410.06ms. Allocated memory is still 65.0MB. Free memory was 28.2MB in the beginning and 30.3MB in the end (delta: -2.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5756.17ms. Allocated memory was 65.0MB in the beginning and 96.5MB in the end (delta: 31.5MB). Free memory was 29.7MB in the beginning and 32.1MB in the end (delta: -2.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Witness Printer took 77.51ms. Allocated memory is still 96.5MB. Free memory was 32.1MB in the beginning and 72.5MB in the end (delta: -40.4MB). Peak memory consumption was 2.7MB. 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_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; [L241] 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); [L241] RET, EXPR base2flt(0, 0) [L241] zero = base2flt(0, 0) [L242] CALL, EXPR base2flt(ma, ea) 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); [L242] RET, EXPR base2flt(ma, ea) VAL [ea=0, ma=16777216] [L242] a = base2flt(ma, ea) [L243] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=64, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=64, \old(m)=16777216, __retres4=-1073741824] [L80] return (__retres4); [L243] RET, EXPR base2flt(mb, eb) VAL [a=-2147483648, ea=0, eb=64, ma=16777216, mb=16777216] [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) VAL [\old(a)=-2147483648, \old(b)=-1073741824] [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 [\old(a)=-2147483648, \old(b)=-1073741824, a=-2147483648, b=-1073741824] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [\old(a)=-2147483648, \old(b)=-1073741824, a=-1073741824, 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 [\old(a)=-2147483648, \old(b)=-1073741824, a=-1073741824, ea=64, eb=0, ma=16777216, 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 [\old(a)=-2147483648, \old(b)=-1073741824, a=-1073741824, ea=64, eb=0, ma=16777216, mb=16777216] [L115] delta = ea - eb VAL [\old(a)=-2147483648, \old(b)=-1073741824, a=-1073741824, delta=64, ea=64, ma=16777216, 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 4 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 120 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 4029 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3476 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 928 IncrementalHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 553 mSDtfsCounter, 928 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 432 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=7, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 74 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 365 NumberOfCodeBlocks, 349 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 417 ConstructedInterpolants, 2 QuantifiedInterpolants, 689 SizeOfPredicates, 13 NumberOfNonLiveVariables, 663 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 163/183 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-10-12 15:12:06,533 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