./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 09:33:06,302 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 09:33:06,372 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 09:33:06,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 09:33:06,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 09:33:06,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 09:33:06,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 09:33:06,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 09:33:06,416 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 09:33:06,417 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 09:33:06,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 09:33:06,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 09:33:06,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 09:33:06,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 09:33:06,421 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 09:33:06,422 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 09:33:06,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 09:33:06,422 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 09:33:06,422 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 09:33:06,423 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 09:33:06,423 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 09:33:06,423 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 09:33:06,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 09:33:06,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 09:33:06,427 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 09:33:06,427 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 09:33:06,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 09:33:06,427 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 09:33:06,428 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 09:33:06,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 09:33:06,428 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 09:33:06,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 09:33:06,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:33:06,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 09:33:06,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 09:33:06,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 09:33:06,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 09:33:06,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 09:33:06,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 09:33:06,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 09:33:06,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 09:33:06,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 09:33:06,432 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2024-11-18 09:33:06,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 09:33:06,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 09:33:06,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 09:33:06,726 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 09:33:06,726 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 09:33:06,727 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2024-11-18 09:33:08,247 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 09:33:08,425 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 09:33:08,426 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2024-11-18 09:33:08,436 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8f5ee0fb/bcf73f1c47084fdfb2925868bdc62a42/FLAG911e0849a [2024-11-18 09:33:08,450 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8f5ee0fb/bcf73f1c47084fdfb2925868bdc62a42 [2024-11-18 09:33:08,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 09:33:08,454 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 09:33:08,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 09:33:08,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 09:33:08,461 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 09:33:08,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:33:08" (1/1) ... [2024-11-18 09:33:08,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d2ba3d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:08, skipping insertion in model container [2024-11-18 09:33:08,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:33:08" (1/1) ... [2024-11-18 09:33:08,501 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 09:33:08,735 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c[730,743] [2024-11-18 09:33:08,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:33:08,856 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 09:33:08,868 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c[730,743] [2024-11-18 09:33:08,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:33:08,936 INFO L204 MainTranslator]: Completed translation [2024-11-18 09:33:08,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:08 WrapperNode [2024-11-18 09:33:08,936 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 09:33:08,938 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 09:33:08,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 09:33:08,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 09:33:08,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:08" (1/1) ... [2024-11-18 09:33:08,954 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:08" (1/1) ... [2024-11-18 09:33:08,980 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 189 [2024-11-18 09:33:08,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 09:33:08,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 09:33:08,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 09:33:08,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 09:33:08,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:08" (1/1) ... [2024-11-18 09:33:08,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:08" (1/1) ... [2024-11-18 09:33:08,994 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:08" (1/1) ... [2024-11-18 09:33:09,007 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 09:33:09,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:08" (1/1) ... [2024-11-18 09:33:09,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:08" (1/1) ... [2024-11-18 09:33:09,013 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:08" (1/1) ... [2024-11-18 09:33:09,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:08" (1/1) ... [2024-11-18 09:33:09,019 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:08" (1/1) ... [2024-11-18 09:33:09,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:08" (1/1) ... [2024-11-18 09:33:09,023 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 09:33:09,023 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 09:33:09,024 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 09:33:09,024 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 09:33:09,024 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:08" (1/1) ... [2024-11-18 09:33:09,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:33:09,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:33:09,062 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 09:33:09,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 09:33:09,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 09:33:09,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 09:33:09,115 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-18 09:33:09,115 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-18 09:33:09,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 09:33:09,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 09:33:09,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-18 09:33:09,116 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-18 09:33:09,204 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 09:33:09,206 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 09:33:09,576 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-11-18 09:33:09,576 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 09:33:09,594 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 09:33:09,597 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-18 09:33:09,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:33:09 BoogieIcfgContainer [2024-11-18 09:33:09,598 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 09:33:09,599 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 09:33:09,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 09:33:09,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 09:33:09,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:33:08" (1/3) ... [2024-11-18 09:33:09,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3330d406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:33:09, skipping insertion in model container [2024-11-18 09:33:09,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:08" (2/3) ... [2024-11-18 09:33:09,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3330d406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:33:09, skipping insertion in model container [2024-11-18 09:33:09,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:33:09" (3/3) ... [2024-11-18 09:33:09,605 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2024-11-18 09:33:09,619 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 09:33:09,619 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 09:33:09,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 09:33:09,674 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1f25b61c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 09:33:09,674 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 09:33:09,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 83 states have (on average 1.5783132530120483) internal successors, (131), 86 states have internal predecessors, (131), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-18 09:33:09,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-18 09:33:09,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:09,691 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:09,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:09,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:09,697 INFO L85 PathProgramCache]: Analyzing trace with hash 766642651, now seen corresponding path program 1 times [2024-11-18 09:33:09,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:09,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293814558] [2024-11-18 09:33:09,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:09,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:10,251 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 09:33:10,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:10,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293814558] [2024-11-18 09:33:10,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293814558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:10,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:10,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 09:33:10,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398015651] [2024-11-18 09:33:10,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:10,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 09:33:10,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:10,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 09:33:10,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:33:10,291 INFO L87 Difference]: Start difference. First operand has 96 states, 83 states have (on average 1.5783132530120483) internal successors, (131), 86 states have internal predecessors, (131), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:10,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:10,497 INFO L93 Difference]: Finished difference Result 225 states and 366 transitions. [2024-11-18 09:33:10,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 09:33:10,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-11-18 09:33:10,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:10,513 INFO L225 Difference]: With dead ends: 225 [2024-11-18 09:33:10,513 INFO L226 Difference]: Without dead ends: 126 [2024-11-18 09:33:10,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-18 09:33:10,536 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 38 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:10,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 754 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:33:10,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-18 09:33:10,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2024-11-18 09:33:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 109 states have (on average 1.4770642201834863) internal successors, (161), 112 states have internal predecessors, (161), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-18 09:33:10,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 185 transitions. [2024-11-18 09:33:10,592 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 185 transitions. Word has length 36 [2024-11-18 09:33:10,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:10,593 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 185 transitions. [2024-11-18 09:33:10,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:10,594 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 185 transitions. [2024-11-18 09:33:10,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-18 09:33:10,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:10,597 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:10,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 09:33:10,598 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:10,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:10,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1140690581, now seen corresponding path program 1 times [2024-11-18 09:33:10,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:10,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110174079] [2024-11-18 09:33:10,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:10,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:10,682 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:33:10,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:10,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110174079] [2024-11-18 09:33:10,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110174079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:10,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:10,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:33:10,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687800137] [2024-11-18 09:33:10,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:10,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:33:10,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:10,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:33:10,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:33:10,688 INFO L87 Difference]: Start difference. First operand 124 states and 185 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:10,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:10,723 INFO L93 Difference]: Finished difference Result 212 states and 318 transitions. [2024-11-18 09:33:10,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:33:10,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-11-18 09:33:10,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:10,728 INFO L225 Difference]: With dead ends: 212 [2024-11-18 09:33:10,728 INFO L226 Difference]: Without dead ends: 170 [2024-11-18 09:33:10,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:33:10,731 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 40 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:10,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 265 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:33:10,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-18 09:33:10,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2024-11-18 09:33:10,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 155 states have internal predecessors, (219), 14 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-18 09:33:10,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 249 transitions. [2024-11-18 09:33:10,757 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 249 transitions. Word has length 37 [2024-11-18 09:33:10,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:10,757 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 249 transitions. [2024-11-18 09:33:10,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:10,757 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 249 transitions. [2024-11-18 09:33:10,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-18 09:33:10,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:10,759 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:10,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 09:33:10,760 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:10,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:10,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2070341150, now seen corresponding path program 1 times [2024-11-18 09:33:10,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:10,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228095626] [2024-11-18 09:33:10,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:10,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:10,829 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:33:10,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:10,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228095626] [2024-11-18 09:33:10,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228095626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:10,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:10,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:33:10,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963043295] [2024-11-18 09:33:10,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:10,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:33:10,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:10,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:33:10,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:33:10,836 INFO L87 Difference]: Start difference. First operand 170 states and 249 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:10,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:10,861 INFO L93 Difference]: Finished difference Result 308 states and 453 transitions. [2024-11-18 09:33:10,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:33:10,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-11-18 09:33:10,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:10,865 INFO L225 Difference]: With dead ends: 308 [2024-11-18 09:33:10,866 INFO L226 Difference]: Without dead ends: 250 [2024-11-18 09:33:10,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:33:10,869 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 52 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:10,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 293 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:33:10,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-18 09:33:10,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 236. [2024-11-18 09:33:10,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 212 states have (on average 1.4103773584905661) internal successors, (299), 216 states have internal predecessors, (299), 20 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (21), 19 states have call predecessors, (21), 18 states have call successors, (21) [2024-11-18 09:33:10,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 340 transitions. [2024-11-18 09:33:10,887 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 340 transitions. Word has length 39 [2024-11-18 09:33:10,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:10,888 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 340 transitions. [2024-11-18 09:33:10,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:10,888 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 340 transitions. [2024-11-18 09:33:10,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-18 09:33:10,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:10,890 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:10,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 09:33:10,890 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:10,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:10,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1761849684, now seen corresponding path program 1 times [2024-11-18 09:33:10,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:10,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342722014] [2024-11-18 09:33:10,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:10,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:10,951 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:33:10,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:10,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342722014] [2024-11-18 09:33:10,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342722014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:10,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:10,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:33:10,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503980998] [2024-11-18 09:33:10,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:10,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:33:10,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:10,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:33:10,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:33:10,954 INFO L87 Difference]: Start difference. First operand 236 states and 340 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:10,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:10,991 INFO L93 Difference]: Finished difference Result 370 states and 536 transitions. [2024-11-18 09:33:10,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:33:10,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-11-18 09:33:10,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:10,994 INFO L225 Difference]: With dead ends: 370 [2024-11-18 09:33:10,994 INFO L226 Difference]: Without dead ends: 326 [2024-11-18 09:33:10,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:33:10,998 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 52 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:10,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 502 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:33:11,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-18 09:33:11,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 300. [2024-11-18 09:33:11,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 269 states have (on average 1.4089219330855018) internal successors, (379), 275 states have internal predecessors, (379), 27 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (28), 26 states have call predecessors, (28), 25 states have call successors, (28) [2024-11-18 09:33:11,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 434 transitions. [2024-11-18 09:33:11,026 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 434 transitions. Word has length 40 [2024-11-18 09:33:11,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:11,026 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 434 transitions. [2024-11-18 09:33:11,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:11,026 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 434 transitions. [2024-11-18 09:33:11,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-18 09:33:11,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:11,028 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:11,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 09:33:11,029 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:11,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:11,032 INFO L85 PathProgramCache]: Analyzing trace with hash 740781330, now seen corresponding path program 1 times [2024-11-18 09:33:11,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:11,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571107790] [2024-11-18 09:33:11,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:11,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:11,085 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:33:11,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:11,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571107790] [2024-11-18 09:33:11,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571107790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:11,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:11,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:33:11,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47994408] [2024-11-18 09:33:11,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:11,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:33:11,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:11,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:33:11,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:33:11,087 INFO L87 Difference]: Start difference. First operand 300 states and 434 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:11,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:11,106 INFO L93 Difference]: Finished difference Result 309 states and 444 transitions. [2024-11-18 09:33:11,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:33:11,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-11-18 09:33:11,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:11,109 INFO L225 Difference]: With dead ends: 309 [2024-11-18 09:33:11,109 INFO L226 Difference]: Without dead ends: 302 [2024-11-18 09:33:11,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:33:11,112 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:11,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 268 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:33:11,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-18 09:33:11,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2024-11-18 09:33:11,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 271 states have (on average 1.4059040590405905) internal successors, (381), 277 states have internal predecessors, (381), 27 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (28), 26 states have call predecessors, (28), 25 states have call successors, (28) [2024-11-18 09:33:11,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 436 transitions. [2024-11-18 09:33:11,127 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 436 transitions. Word has length 40 [2024-11-18 09:33:11,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:11,127 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 436 transitions. [2024-11-18 09:33:11,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:11,128 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 436 transitions. [2024-11-18 09:33:11,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-18 09:33:11,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:11,129 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:11,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 09:33:11,129 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:11,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:11,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2116211210, now seen corresponding path program 1 times [2024-11-18 09:33:11,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:11,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176668706] [2024-11-18 09:33:11,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:11,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:11,305 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 09:33:11,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:11,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176668706] [2024-11-18 09:33:11,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176668706] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:33:11,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959729799] [2024-11-18 09:33:11,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:11,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:33:11,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:33:11,310 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:33:11,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 09:33:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:11,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-18 09:33:11,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:11,483 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 09:33:11,483 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:33:11,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959729799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:11,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 09:33:11,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-11-18 09:33:11,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861930916] [2024-11-18 09:33:11,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:11,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 09:33:11,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:11,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 09:33:11,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-18 09:33:11,487 INFO L87 Difference]: Start difference. First operand 302 states and 436 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:11,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:11,580 INFO L93 Difference]: Finished difference Result 525 states and 768 transitions. [2024-11-18 09:33:11,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 09:33:11,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-11-18 09:33:11,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:11,583 INFO L225 Difference]: With dead ends: 525 [2024-11-18 09:33:11,583 INFO L226 Difference]: Without dead ends: 444 [2024-11-18 09:33:11,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-18 09:33:11,589 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 72 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:11,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 810 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:33:11,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-18 09:33:11,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 443. [2024-11-18 09:33:11,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 398 states have (on average 1.414572864321608) internal successors, (563), 406 states have internal predecessors, (563), 40 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (44), 40 states have call predecessors, (44), 38 states have call successors, (44) [2024-11-18 09:33:11,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 647 transitions. [2024-11-18 09:33:11,614 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 647 transitions. Word has length 40 [2024-11-18 09:33:11,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:11,616 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 647 transitions. [2024-11-18 09:33:11,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 647 transitions. [2024-11-18 09:33:11,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-18 09:33:11,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:11,617 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:11,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 09:33:11,818 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,SelfDestructingSolverStorable5 [2024-11-18 09:33:11,819 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:11,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:11,819 INFO L85 PathProgramCache]: Analyzing trace with hash 484387891, now seen corresponding path program 1 times [2024-11-18 09:33:11,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:11,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434200411] [2024-11-18 09:33:11,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:11,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:11,881 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:33:11,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:11,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434200411] [2024-11-18 09:33:11,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434200411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:11,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:11,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:33:11,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840104036] [2024-11-18 09:33:11,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:11,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:33:11,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:11,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:33:11,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:33:11,884 INFO L87 Difference]: Start difference. First operand 443 states and 647 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:11,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:11,917 INFO L93 Difference]: Finished difference Result 744 states and 1096 transitions. [2024-11-18 09:33:11,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:33:11,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2024-11-18 09:33:11,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:11,921 INFO L225 Difference]: With dead ends: 744 [2024-11-18 09:33:11,921 INFO L226 Difference]: Without dead ends: 658 [2024-11-18 09:33:11,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:33:11,923 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 53 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:11,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 502 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:33:11,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-11-18 09:33:11,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 563. [2024-11-18 09:33:11,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 510 states have (on average 1.4058823529411764) internal successors, (717), 516 states have internal predecessors, (717), 48 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (52), 48 states have call predecessors, (52), 46 states have call successors, (52) [2024-11-18 09:33:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 817 transitions. [2024-11-18 09:33:11,946 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 817 transitions. Word has length 41 [2024-11-18 09:33:11,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:11,947 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 817 transitions. [2024-11-18 09:33:11,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:11,947 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 817 transitions. [2024-11-18 09:33:11,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-18 09:33:11,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:11,949 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:11,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 09:33:11,949 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:11,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:11,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2128449260, now seen corresponding path program 1 times [2024-11-18 09:33:11,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:11,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838576109] [2024-11-18 09:33:11,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:11,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:33:11,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:11,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838576109] [2024-11-18 09:33:11,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838576109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:11,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:11,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:33:11,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505316379] [2024-11-18 09:33:11,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:11,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:33:11,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:11,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:33:11,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:33:11,999 INFO L87 Difference]: Start difference. First operand 563 states and 817 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:12,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:12,024 INFO L93 Difference]: Finished difference Result 576 states and 832 transitions. [2024-11-18 09:33:12,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:33:12,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2024-11-18 09:33:12,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:12,029 INFO L225 Difference]: With dead ends: 576 [2024-11-18 09:33:12,029 INFO L226 Difference]: Without dead ends: 569 [2024-11-18 09:33:12,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:33:12,031 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:12,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 401 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:33:12,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-11-18 09:33:12,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 566. [2024-11-18 09:33:12,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 513 states have (on average 1.4035087719298245) internal successors, (720), 519 states have internal predecessors, (720), 48 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (52), 48 states have call predecessors, (52), 46 states have call successors, (52) [2024-11-18 09:33:12,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 820 transitions. [2024-11-18 09:33:12,063 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 820 transitions. Word has length 42 [2024-11-18 09:33:12,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:12,063 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 820 transitions. [2024-11-18 09:33:12,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:12,064 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 820 transitions. [2024-11-18 09:33:12,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-18 09:33:12,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:12,065 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:12,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 09:33:12,065 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:12,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:12,066 INFO L85 PathProgramCache]: Analyzing trace with hash -391510674, now seen corresponding path program 1 times [2024-11-18 09:33:12,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:12,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288356798] [2024-11-18 09:33:12,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:12,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:12,139 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:33:12,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:12,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288356798] [2024-11-18 09:33:12,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288356798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:12,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:12,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 09:33:12,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887124537] [2024-11-18 09:33:12,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:12,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:33:12,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:12,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:33:12,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:33:12,141 INFO L87 Difference]: Start difference. First operand 566 states and 820 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:12,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:12,189 INFO L93 Difference]: Finished difference Result 573 states and 826 transitions. [2024-11-18 09:33:12,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:33:12,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2024-11-18 09:33:12,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:12,192 INFO L225 Difference]: With dead ends: 573 [2024-11-18 09:33:12,193 INFO L226 Difference]: Without dead ends: 566 [2024-11-18 09:33:12,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 09:33:12,194 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 3 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:12,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 530 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:33:12,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-11-18 09:33:12,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 560. [2024-11-18 09:33:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 507 states have (on average 1.4003944773175543) internal successors, (710), 513 states have internal predecessors, (710), 48 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (52), 48 states have call predecessors, (52), 46 states have call successors, (52) [2024-11-18 09:33:12,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 810 transitions. [2024-11-18 09:33:12,214 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 810 transitions. Word has length 42 [2024-11-18 09:33:12,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:12,215 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 810 transitions. [2024-11-18 09:33:12,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:12,215 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 810 transitions. [2024-11-18 09:33:12,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-18 09:33:12,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:12,217 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:12,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 09:33:12,217 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:12,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:12,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1040982236, now seen corresponding path program 1 times [2024-11-18 09:33:12,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:12,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509882985] [2024-11-18 09:33:12,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:12,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:12,437 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 09:33:12,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:12,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509882985] [2024-11-18 09:33:12,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509882985] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:33:12,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273166551] [2024-11-18 09:33:12,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:12,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:33:12,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:33:12,440 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:33:12,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 09:33:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:12,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-18 09:33:12,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:12,528 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 09:33:12,528 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:33:12,641 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 09:33:12,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273166551] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:33:12,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:33:12,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2024-11-18 09:33:12,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026634381] [2024-11-18 09:33:12,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:33:12,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-18 09:33:12,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:12,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-18 09:33:12,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-18 09:33:12,643 INFO L87 Difference]: Start difference. First operand 560 states and 810 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-18 09:33:12,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:12,736 INFO L93 Difference]: Finished difference Result 957 states and 1382 transitions. [2024-11-18 09:33:12,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 09:33:12,736 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 42 [2024-11-18 09:33:12,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:12,739 INFO L225 Difference]: With dead ends: 957 [2024-11-18 09:33:12,739 INFO L226 Difference]: Without dead ends: 611 [2024-11-18 09:33:12,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-18 09:33:12,741 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 22 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:12,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 772 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:33:12,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2024-11-18 09:33:12,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 589. [2024-11-18 09:33:12,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 533 states have (on average 1.3846153846153846) internal successors, (738), 533 states have internal predecessors, (738), 51 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (61), 57 states have call predecessors, (61), 49 states have call successors, (61) [2024-11-18 09:33:12,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 850 transitions. [2024-11-18 09:33:12,758 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 850 transitions. Word has length 42 [2024-11-18 09:33:12,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:12,758 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 850 transitions. [2024-11-18 09:33:12,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-18 09:33:12,758 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 850 transitions. [2024-11-18 09:33:12,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-18 09:33:12,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:12,760 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:12,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 09:33:12,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-18 09:33:12,964 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:12,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:12,964 INFO L85 PathProgramCache]: Analyzing trace with hash -789051416, now seen corresponding path program 1 times [2024-11-18 09:33:12,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:12,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978046227] [2024-11-18 09:33:12,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:12,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:13,137 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 09:33:13,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:13,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978046227] [2024-11-18 09:33:13,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978046227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:33:13,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695250526] [2024-11-18 09:33:13,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:13,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:33:13,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:33:13,141 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:33:13,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 09:33:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:13,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-18 09:33:13,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:13,318 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 09:33:13,318 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:33:13,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695250526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:13,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 09:33:13,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2024-11-18 09:33:13,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274480886] [2024-11-18 09:33:13,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:13,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 09:33:13,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:13,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 09:33:13,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-18 09:33:13,320 INFO L87 Difference]: Start difference. First operand 589 states and 850 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:13,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:13,495 INFO L93 Difference]: Finished difference Result 777 states and 1125 transitions. [2024-11-18 09:33:13,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 09:33:13,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-18 09:33:13,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:13,499 INFO L225 Difference]: With dead ends: 777 [2024-11-18 09:33:13,499 INFO L226 Difference]: Without dead ends: 629 [2024-11-18 09:33:13,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-18 09:33:13,501 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 80 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:13,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 997 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:33:13,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-18 09:33:13,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 619. [2024-11-18 09:33:13,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 563 states have (on average 1.3730017761989344) internal successors, (773), 563 states have internal predecessors, (773), 51 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (61), 57 states have call predecessors, (61), 49 states have call successors, (61) [2024-11-18 09:33:13,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 885 transitions. [2024-11-18 09:33:13,523 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 885 transitions. Word has length 44 [2024-11-18 09:33:13,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:13,523 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 885 transitions. [2024-11-18 09:33:13,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:13,524 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 885 transitions. [2024-11-18 09:33:13,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-18 09:33:13,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:13,525 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:13,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-18 09:33:13,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:33:13,729 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:13,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:13,730 INFO L85 PathProgramCache]: Analyzing trace with hash -396024406, now seen corresponding path program 1 times [2024-11-18 09:33:13,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:13,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133065865] [2024-11-18 09:33:13,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:13,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:13,849 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 09:33:13,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:13,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133065865] [2024-11-18 09:33:13,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133065865] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:33:13,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2442503] [2024-11-18 09:33:13,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:13,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:33:13,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:33:13,851 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:33:13,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 09:33:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:13,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-18 09:33:13,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:13,955 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 09:33:13,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:33:14,083 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 09:33:14,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2442503] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:33:14,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:33:14,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-18 09:33:14,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445295257] [2024-11-18 09:33:14,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:33:14,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-18 09:33:14,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:14,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-18 09:33:14,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-18 09:33:14,085 INFO L87 Difference]: Start difference. First operand 619 states and 885 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-18 09:33:14,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:14,281 INFO L93 Difference]: Finished difference Result 1247 states and 1786 transitions. [2024-11-18 09:33:14,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 09:33:14,281 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 44 [2024-11-18 09:33:14,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:14,285 INFO L225 Difference]: With dead ends: 1247 [2024-11-18 09:33:14,285 INFO L226 Difference]: Without dead ends: 761 [2024-11-18 09:33:14,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-18 09:33:14,286 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 28 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:14,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1417 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:33:14,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-11-18 09:33:14,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 753. [2024-11-18 09:33:14,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 692 states have (on average 1.346820809248555) internal successors, (932), 691 states have internal predecessors, (932), 56 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (68), 65 states have call predecessors, (68), 54 states have call successors, (68) [2024-11-18 09:33:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1056 transitions. [2024-11-18 09:33:14,306 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1056 transitions. Word has length 44 [2024-11-18 09:33:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:14,306 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 1056 transitions. [2024-11-18 09:33:14,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-18 09:33:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1056 transitions. [2024-11-18 09:33:14,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-18 09:33:14,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:14,308 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:14,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-18 09:33:14,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:33:14,513 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:14,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:14,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1611000684, now seen corresponding path program 1 times [2024-11-18 09:33:14,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:14,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507362713] [2024-11-18 09:33:14,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:14,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:14,560 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:33:14,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:14,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507362713] [2024-11-18 09:33:14,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507362713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:14,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:14,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:33:14,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666829418] [2024-11-18 09:33:14,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:14,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:33:14,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:14,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:33:14,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:33:14,562 INFO L87 Difference]: Start difference. First operand 753 states and 1056 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:14,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:14,585 INFO L93 Difference]: Finished difference Result 798 states and 1115 transitions. [2024-11-18 09:33:14,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:33:14,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2024-11-18 09:33:14,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:14,589 INFO L225 Difference]: With dead ends: 798 [2024-11-18 09:33:14,589 INFO L226 Difference]: Without dead ends: 707 [2024-11-18 09:33:14,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:33:14,590 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 38 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:14,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 443 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:33:14,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-11-18 09:33:14,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 567. [2024-11-18 09:33:14,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 523 states have (on average 1.315487571701721) internal successors, (688), 518 states have internal predecessors, (688), 39 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (51), 48 states have call predecessors, (51), 37 states have call successors, (51) [2024-11-18 09:33:14,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 778 transitions. [2024-11-18 09:33:14,605 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 778 transitions. Word has length 47 [2024-11-18 09:33:14,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:14,606 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 778 transitions. [2024-11-18 09:33:14,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:14,606 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 778 transitions. [2024-11-18 09:33:14,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-18 09:33:14,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:14,607 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:14,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-18 09:33:14,607 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:14,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:14,608 INFO L85 PathProgramCache]: Analyzing trace with hash -928708749, now seen corresponding path program 1 times [2024-11-18 09:33:14,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:14,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453502301] [2024-11-18 09:33:14,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:14,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 09:33:14,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:14,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453502301] [2024-11-18 09:33:14,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453502301] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:33:14,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472759777] [2024-11-18 09:33:14,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:14,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:33:14,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:33:14,800 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:33:14,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 09:33:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:14,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-18 09:33:14,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:14,942 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 09:33:14,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:33:15,037 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:33:15,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472759777] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 09:33:15,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:33:15,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 11] total 15 [2024-11-18 09:33:15,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832678283] [2024-11-18 09:33:15,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:15,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 09:33:15,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:15,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 09:33:15,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-18 09:33:15,040 INFO L87 Difference]: Start difference. First operand 567 states and 778 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:15,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:15,210 INFO L93 Difference]: Finished difference Result 903 states and 1252 transitions. [2024-11-18 09:33:15,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 09:33:15,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-18 09:33:15,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:15,215 INFO L225 Difference]: With dead ends: 903 [2024-11-18 09:33:15,215 INFO L226 Difference]: Without dead ends: 863 [2024-11-18 09:33:15,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-18 09:33:15,216 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 46 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:15,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 666 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:33:15,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-11-18 09:33:15,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 737. [2024-11-18 09:33:15,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 673 states have (on average 1.298662704309064) internal successors, (874), 670 states have internal predecessors, (874), 59 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (71), 68 states have call predecessors, (71), 57 states have call successors, (71) [2024-11-18 09:33:15,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1004 transitions. [2024-11-18 09:33:15,240 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1004 transitions. Word has length 48 [2024-11-18 09:33:15,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:15,240 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 1004 transitions. [2024-11-18 09:33:15,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:15,241 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1004 transitions. [2024-11-18 09:33:15,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-18 09:33:15,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:15,242 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:15,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-18 09:33:15,446 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,SelfDestructingSolverStorable13 [2024-11-18 09:33:15,447 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:15,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:15,447 INFO L85 PathProgramCache]: Analyzing trace with hash -227644171, now seen corresponding path program 1 times [2024-11-18 09:33:15,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:15,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175216079] [2024-11-18 09:33:15,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:15,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:15,482 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:33:15,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:15,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175216079] [2024-11-18 09:33:15,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175216079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:15,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:15,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:33:15,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085755845] [2024-11-18 09:33:15,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:15,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:33:15,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:15,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:33:15,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:33:15,484 INFO L87 Difference]: Start difference. First operand 737 states and 1004 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:15,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:15,506 INFO L93 Difference]: Finished difference Result 756 states and 1025 transitions. [2024-11-18 09:33:15,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:33:15,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-18 09:33:15,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:15,510 INFO L225 Difference]: With dead ends: 756 [2024-11-18 09:33:15,510 INFO L226 Difference]: Without dead ends: 690 [2024-11-18 09:33:15,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:33:15,511 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:15,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 396 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:33:15,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-18 09:33:15,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2024-11-18 09:33:15,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 626 states have (on average 1.3067092651757188) internal successors, (818), 625 states have internal predecessors, (818), 59 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (69), 66 states have call predecessors, (69), 57 states have call successors, (69) [2024-11-18 09:33:15,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 946 transitions. [2024-11-18 09:33:15,533 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 946 transitions. Word has length 48 [2024-11-18 09:33:15,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:15,533 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 946 transitions. [2024-11-18 09:33:15,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:15,533 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 946 transitions. [2024-11-18 09:33:15,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-18 09:33:15,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:15,534 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:15,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-18 09:33:15,535 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:15,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:15,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1414516131, now seen corresponding path program 1 times [2024-11-18 09:33:15,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:15,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493977389] [2024-11-18 09:33:15,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:15,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:15,665 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-18 09:33:15,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:15,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493977389] [2024-11-18 09:33:15,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493977389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:33:15,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096798117] [2024-11-18 09:33:15,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:15,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:33:15,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:33:15,668 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:33:15,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-18 09:33:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:15,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-18 09:33:15,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:15,813 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-18 09:33:15,814 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:33:15,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096798117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:15,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 09:33:15,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 10 [2024-11-18 09:33:15,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139173842] [2024-11-18 09:33:15,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:15,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 09:33:15,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:15,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 09:33:15,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-18 09:33:15,815 INFO L87 Difference]: Start difference. First operand 690 states and 946 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 09:33:16,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:16,078 INFO L93 Difference]: Finished difference Result 1378 states and 1901 transitions. [2024-11-18 09:33:16,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 09:33:16,078 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2024-11-18 09:33:16,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:16,083 INFO L225 Difference]: With dead ends: 1378 [2024-11-18 09:33:16,083 INFO L226 Difference]: Without dead ends: 1086 [2024-11-18 09:33:16,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-18 09:33:16,084 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 128 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:16,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1210 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 09:33:16,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2024-11-18 09:33:16,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 901. [2024-11-18 09:33:16,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 817 states have (on average 1.3231334149326806) internal successors, (1081), 812 states have internal predecessors, (1081), 79 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (93), 90 states have call predecessors, (93), 77 states have call successors, (93) [2024-11-18 09:33:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1253 transitions. [2024-11-18 09:33:16,122 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1253 transitions. Word has length 48 [2024-11-18 09:33:16,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:16,123 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1253 transitions. [2024-11-18 09:33:16,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 09:33:16,123 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1253 transitions. [2024-11-18 09:33:16,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-18 09:33:16,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:16,125 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:16,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-18 09:33:16,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-18 09:33:16,327 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:16,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:16,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1738528056, now seen corresponding path program 1 times [2024-11-18 09:33:16,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:16,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101117478] [2024-11-18 09:33:16,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:16,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-18 09:33:16,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:16,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101117478] [2024-11-18 09:33:16,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101117478] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:33:16,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503822428] [2024-11-18 09:33:16,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:16,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:33:16,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:33:16,747 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:33:16,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-18 09:33:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:16,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-18 09:33:16,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:17,019 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 09:33:17,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:33:17,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503822428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:17,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 09:33:17,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 24 [2024-11-18 09:33:17,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529583352] [2024-11-18 09:33:17,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:17,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-18 09:33:17,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:17,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-18 09:33:17,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2024-11-18 09:33:17,021 INFO L87 Difference]: Start difference. First operand 901 states and 1253 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:17,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:17,329 INFO L93 Difference]: Finished difference Result 1041 states and 1439 transitions. [2024-11-18 09:33:17,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 09:33:17,330 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-18 09:33:17,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:17,334 INFO L225 Difference]: With dead ends: 1041 [2024-11-18 09:33:17,334 INFO L226 Difference]: Without dead ends: 1004 [2024-11-18 09:33:17,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2024-11-18 09:33:17,335 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 108 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:17,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1458 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 09:33:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2024-11-18 09:33:17,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 933. [2024-11-18 09:33:17,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 845 states have (on average 1.3124260355029587) internal successors, (1109), 842 states have internal predecessors, (1109), 83 states have call successors, (83), 2 states have call predecessors, (83), 4 states have return successors, (96), 93 states have call predecessors, (96), 80 states have call successors, (96) [2024-11-18 09:33:17,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1288 transitions. [2024-11-18 09:33:17,367 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1288 transitions. Word has length 50 [2024-11-18 09:33:17,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:17,367 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1288 transitions. [2024-11-18 09:33:17,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:17,368 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1288 transitions. [2024-11-18 09:33:17,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-18 09:33:17,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:17,369 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:17,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-18 09:33:17,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:33:17,570 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:17,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:17,571 INFO L85 PathProgramCache]: Analyzing trace with hash 636967370, now seen corresponding path program 1 times [2024-11-18 09:33:17,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:17,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545759682] [2024-11-18 09:33:17,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:17,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:33:17,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:17,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545759682] [2024-11-18 09:33:17,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545759682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:17,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:17,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 09:33:17,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509360138] [2024-11-18 09:33:17,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:17,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:33:17,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:17,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:33:17,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:33:17,638 INFO L87 Difference]: Start difference. First operand 933 states and 1288 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:17,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:17,761 INFO L93 Difference]: Finished difference Result 1088 states and 1490 transitions. [2024-11-18 09:33:17,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 09:33:17,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-18 09:33:17,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:17,766 INFO L225 Difference]: With dead ends: 1088 [2024-11-18 09:33:17,766 INFO L226 Difference]: Without dead ends: 1052 [2024-11-18 09:33:17,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:33:17,767 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 46 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:17,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 567 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:33:17,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2024-11-18 09:33:17,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1005. [2024-11-18 09:33:17,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 908 states have (on average 1.3204845814977975) internal successors, (1199), 907 states have internal predecessors, (1199), 92 states have call successors, (92), 2 states have call predecessors, (92), 4 states have return successors, (105), 101 states have call predecessors, (105), 89 states have call successors, (105) [2024-11-18 09:33:17,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1396 transitions. [2024-11-18 09:33:17,797 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1396 transitions. Word has length 50 [2024-11-18 09:33:17,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:17,798 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1396 transitions. [2024-11-18 09:33:17,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:17,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1396 transitions. [2024-11-18 09:33:17,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-18 09:33:17,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:17,800 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:17,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-18 09:33:17,800 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:17,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:17,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1829184296, now seen corresponding path program 1 times [2024-11-18 09:33:17,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:17,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369507324] [2024-11-18 09:33:17,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:17,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-18 09:33:17,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:17,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369507324] [2024-11-18 09:33:17,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369507324] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:33:17,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510422574] [2024-11-18 09:33:17,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:17,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:33:17,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:33:17,949 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:33:17,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-18 09:33:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:18,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-18 09:33:18,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:18,222 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-18 09:33:18,222 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:33:18,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510422574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:18,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 09:33:18,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 15 [2024-11-18 09:33:18,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893962407] [2024-11-18 09:33:18,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:18,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-18 09:33:18,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:18,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-18 09:33:18,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-18 09:33:18,224 INFO L87 Difference]: Start difference. First operand 1005 states and 1396 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 09:33:18,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:18,578 INFO L93 Difference]: Finished difference Result 1134 states and 1551 transitions. [2024-11-18 09:33:18,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 09:33:18,578 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2024-11-18 09:33:18,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:18,583 INFO L225 Difference]: With dead ends: 1134 [2024-11-18 09:33:18,583 INFO L226 Difference]: Without dead ends: 1132 [2024-11-18 09:33:18,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-18 09:33:18,584 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 164 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:18,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1745 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 09:33:18,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2024-11-18 09:33:18,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1009. [2024-11-18 09:33:18,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 911 states have (on average 1.3194291986827662) internal successors, (1202), 910 states have internal predecessors, (1202), 92 states have call successors, (92), 3 states have call predecessors, (92), 5 states have return successors, (105), 101 states have call predecessors, (105), 89 states have call successors, (105) [2024-11-18 09:33:18,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1399 transitions. [2024-11-18 09:33:18,617 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1399 transitions. Word has length 50 [2024-11-18 09:33:18,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:18,617 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1399 transitions. [2024-11-18 09:33:18,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 09:33:18,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1399 transitions. [2024-11-18 09:33:18,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-18 09:33:18,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:18,619 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:18,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-18 09:33:18,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:33:18,824 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:18,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:18,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1086009428, now seen corresponding path program 1 times [2024-11-18 09:33:18,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:18,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49727235] [2024-11-18 09:33:18,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:18,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:18,849 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 09:33:18,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:18,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49727235] [2024-11-18 09:33:18,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49727235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:33:18,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116642673] [2024-11-18 09:33:18,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:18,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:33:18,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:33:18,852 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:33:18,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-18 09:33:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:18,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 09:33:18,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 09:33:18,921 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:33:18,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116642673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:18,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 09:33:18,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-18 09:33:18,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322190878] [2024-11-18 09:33:18,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:18,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:33:18,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:18,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:33:18,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:33:18,922 INFO L87 Difference]: Start difference. First operand 1009 states and 1399 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 09:33:18,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:18,973 INFO L93 Difference]: Finished difference Result 2012 states and 2793 transitions. [2024-11-18 09:33:18,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:33:18,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-11-18 09:33:18,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:18,978 INFO L225 Difference]: With dead ends: 2012 [2024-11-18 09:33:18,978 INFO L226 Difference]: Without dead ends: 1014 [2024-11-18 09:33:18,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 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-11-18 09:33:18,981 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 6 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:18,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 245 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:33:18,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2024-11-18 09:33:19,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 1012. [2024-11-18 09:33:19,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 914 states have (on average 1.3194748358862145) internal successors, (1206), 913 states have internal predecessors, (1206), 92 states have call successors, (92), 3 states have call predecessors, (92), 5 states have return successors, (105), 101 states have call predecessors, (105), 89 states have call successors, (105) [2024-11-18 09:33:19,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1403 transitions. [2024-11-18 09:33:19,012 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1403 transitions. Word has length 51 [2024-11-18 09:33:19,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:19,013 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1403 transitions. [2024-11-18 09:33:19,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 09:33:19,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1403 transitions. [2024-11-18 09:33:19,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-18 09:33:19,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:19,015 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:19,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-18 09:33:19,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:33:19,216 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:19,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:19,217 INFO L85 PathProgramCache]: Analyzing trace with hash -542193564, now seen corresponding path program 1 times [2024-11-18 09:33:19,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:19,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339641671] [2024-11-18 09:33:19,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:19,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:19,251 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:33:19,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:19,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339641671] [2024-11-18 09:33:19,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339641671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:19,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:19,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:33:19,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607949553] [2024-11-18 09:33:19,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:19,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:33:19,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:19,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:33:19,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:33:19,254 INFO L87 Difference]: Start difference. First operand 1012 states and 1403 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:19,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:19,301 INFO L93 Difference]: Finished difference Result 1021 states and 1411 transitions. [2024-11-18 09:33:19,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:33:19,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-11-18 09:33:19,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:19,305 INFO L225 Difference]: With dead ends: 1021 [2024-11-18 09:33:19,306 INFO L226 Difference]: Without dead ends: 975 [2024-11-18 09:33:19,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:33:19,307 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:19,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 393 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:33:19,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2024-11-18 09:33:19,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 954. [2024-11-18 09:33:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 860 states have (on average 1.319767441860465) internal successors, (1135), 859 states have internal predecessors, (1135), 88 states have call successors, (88), 3 states have call predecessors, (88), 5 states have return successors, (99), 95 states have call predecessors, (99), 85 states have call successors, (99) [2024-11-18 09:33:19,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1322 transitions. [2024-11-18 09:33:19,335 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1322 transitions. Word has length 52 [2024-11-18 09:33:19,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:19,336 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1322 transitions. [2024-11-18 09:33:19,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:19,336 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1322 transitions. [2024-11-18 09:33:19,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-18 09:33:19,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:19,339 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:19,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-18 09:33:19,339 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:19,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:19,339 INFO L85 PathProgramCache]: Analyzing trace with hash 715958260, now seen corresponding path program 1 times [2024-11-18 09:33:19,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:19,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518453004] [2024-11-18 09:33:19,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:19,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:19,372 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-18 09:33:19,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:19,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518453004] [2024-11-18 09:33:19,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518453004] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:33:19,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249888087] [2024-11-18 09:33:19,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:19,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:33:19,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:33:19,375 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:33:19,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-18 09:33:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:19,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 09:33:19,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:19,455 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 09:33:19,456 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:33:19,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249888087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:19,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 09:33:19,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-11-18 09:33:19,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499486656] [2024-11-18 09:33:19,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:19,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:33:19,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:19,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:33:19,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:33:19,458 INFO L87 Difference]: Start difference. First operand 954 states and 1322 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 09:33:19,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:19,503 INFO L93 Difference]: Finished difference Result 1905 states and 2647 transitions. [2024-11-18 09:33:19,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:33:19,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2024-11-18 09:33:19,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:19,508 INFO L225 Difference]: With dead ends: 1905 [2024-11-18 09:33:19,508 INFO L226 Difference]: Without dead ends: 960 [2024-11-18 09:33:19,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 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-11-18 09:33:19,512 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 5 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:19,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 246 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:33:19,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-11-18 09:33:19,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 956. [2024-11-18 09:33:19,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 862 states have (on average 1.3190255220417633) internal successors, (1137), 861 states have internal predecessors, (1137), 88 states have call successors, (88), 3 states have call predecessors, (88), 5 states have return successors, (99), 95 states have call predecessors, (99), 85 states have call successors, (99) [2024-11-18 09:33:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1324 transitions. [2024-11-18 09:33:19,544 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1324 transitions. Word has length 52 [2024-11-18 09:33:19,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:19,544 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 1324 transitions. [2024-11-18 09:33:19,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 09:33:19,545 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1324 transitions. [2024-11-18 09:33:19,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-18 09:33:19,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:19,546 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:19,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-18 09:33:19,747 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,SelfDestructingSolverStorable21 [2024-11-18 09:33:19,747 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:19,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:19,748 INFO L85 PathProgramCache]: Analyzing trace with hash 402749068, now seen corresponding path program 1 times [2024-11-18 09:33:19,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:19,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276986581] [2024-11-18 09:33:19,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:19,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:33:19,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:19,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276986581] [2024-11-18 09:33:19,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276986581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:19,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:19,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 09:33:19,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447979523] [2024-11-18 09:33:19,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:19,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 09:33:19,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:19,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 09:33:19,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:33:19,909 INFO L87 Difference]: Start difference. First operand 956 states and 1324 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:20,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:20,143 INFO L93 Difference]: Finished difference Result 1307 states and 1822 transitions. [2024-11-18 09:33:20,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 09:33:20,144 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-11-18 09:33:20,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:20,149 INFO L225 Difference]: With dead ends: 1307 [2024-11-18 09:33:20,149 INFO L226 Difference]: Without dead ends: 1250 [2024-11-18 09:33:20,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-18 09:33:20,151 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 54 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:20,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 626 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 09:33:20,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2024-11-18 09:33:20,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 990. [2024-11-18 09:33:20,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 888 states have (on average 1.3322072072072073) internal successors, (1183), 889 states have internal predecessors, (1183), 96 states have call successors, (96), 3 states have call predecessors, (96), 5 states have return successors, (103), 101 states have call predecessors, (103), 93 states have call successors, (103) [2024-11-18 09:33:20,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1382 transitions. [2024-11-18 09:33:20,211 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1382 transitions. Word has length 52 [2024-11-18 09:33:20,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:20,211 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1382 transitions. [2024-11-18 09:33:20,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:20,212 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1382 transitions. [2024-11-18 09:33:20,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-18 09:33:20,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:20,214 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:20,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-18 09:33:20,214 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:20,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:20,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1996652087, now seen corresponding path program 1 times [2024-11-18 09:33:20,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:20,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93680397] [2024-11-18 09:33:20,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:20,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:20,555 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-18 09:33:20,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:20,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93680397] [2024-11-18 09:33:20,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93680397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:20,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:20,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-18 09:33:20,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344932349] [2024-11-18 09:33:20,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:20,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-18 09:33:20,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:20,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-18 09:33:20,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-18 09:33:20,558 INFO L87 Difference]: Start difference. First operand 990 states and 1382 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:20,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:20,817 INFO L93 Difference]: Finished difference Result 1082 states and 1505 transitions. [2024-11-18 09:33:20,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-18 09:33:20,818 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2024-11-18 09:33:20,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:20,822 INFO L225 Difference]: With dead ends: 1082 [2024-11-18 09:33:20,822 INFO L226 Difference]: Without dead ends: 1080 [2024-11-18 09:33:20,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-11-18 09:33:20,824 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 119 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:20,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1664 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 09:33:20,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2024-11-18 09:33:20,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 994. [2024-11-18 09:33:20,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 891 states have (on average 1.3310886644219977) internal successors, (1186), 892 states have internal predecessors, (1186), 96 states have call successors, (96), 4 states have call predecessors, (96), 6 states have return successors, (103), 101 states have call predecessors, (103), 93 states have call successors, (103) [2024-11-18 09:33:20,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1385 transitions. [2024-11-18 09:33:20,882 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1385 transitions. Word has length 53 [2024-11-18 09:33:20,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:20,884 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1385 transitions. [2024-11-18 09:33:20,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:20,884 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1385 transitions. [2024-11-18 09:33:20,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-18 09:33:20,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:20,886 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:20,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-18 09:33:20,886 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:20,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:20,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1712366785, now seen corresponding path program 1 times [2024-11-18 09:33:20,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:20,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705016947] [2024-11-18 09:33:20,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:20,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:21,045 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-18 09:33:21,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:21,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705016947] [2024-11-18 09:33:21,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705016947] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:33:21,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649256435] [2024-11-18 09:33:21,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:21,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:33:21,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:33:21,048 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:33:21,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-18 09:33:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:21,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-18 09:33:21,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:21,146 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-18 09:33:21,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:33:21,265 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-18 09:33:21,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649256435] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:33:21,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:33:21,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-18 09:33:21,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574476625] [2024-11-18 09:33:21,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:33:21,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-18 09:33:21,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:21,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-18 09:33:21,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-18 09:33:21,267 INFO L87 Difference]: Start difference. First operand 994 states and 1385 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 12 states have internal predecessors, (54), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-18 09:33:21,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:21,512 INFO L93 Difference]: Finished difference Result 1436 states and 2001 transitions. [2024-11-18 09:33:21,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 09:33:21,513 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 12 states have internal predecessors, (54), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2024-11-18 09:33:21,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:21,517 INFO L225 Difference]: With dead ends: 1436 [2024-11-18 09:33:21,518 INFO L226 Difference]: Without dead ends: 1114 [2024-11-18 09:33:21,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-11-18 09:33:21,519 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 158 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:21,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1272 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 09:33:21,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2024-11-18 09:33:21,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 950. [2024-11-18 09:33:21,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 853 states have (on average 1.3153575615474795) internal successors, (1122), 854 states have internal predecessors, (1122), 90 states have call successors, (90), 4 states have call predecessors, (90), 6 states have return successors, (97), 95 states have call predecessors, (97), 87 states have call successors, (97) [2024-11-18 09:33:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1309 transitions. [2024-11-18 09:33:21,561 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1309 transitions. Word has length 53 [2024-11-18 09:33:21,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:21,562 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1309 transitions. [2024-11-18 09:33:21,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 12 states have internal predecessors, (54), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-18 09:33:21,562 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1309 transitions. [2024-11-18 09:33:21,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-18 09:33:21,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:21,564 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:21,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-18 09:33:21,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-18 09:33:21,769 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:21,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:21,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1600809393, now seen corresponding path program 1 times [2024-11-18 09:33:21,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:21,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721438987] [2024-11-18 09:33:21,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:21,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:21,961 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-18 09:33:21,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:21,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721438987] [2024-11-18 09:33:21,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721438987] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:33:21,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557223334] [2024-11-18 09:33:21,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:21,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:33:21,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:33:21,963 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:33:21,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-18 09:33:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:22,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-18 09:33:22,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:22,117 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-18 09:33:22,118 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:33:22,216 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-18 09:33:22,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557223334] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 09:33:22,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:33:22,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 10] total 19 [2024-11-18 09:33:22,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146426714] [2024-11-18 09:33:22,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:22,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 09:33:22,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:22,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 09:33:22,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-18 09:33:22,219 INFO L87 Difference]: Start difference. First operand 950 states and 1309 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:22,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:22,387 INFO L93 Difference]: Finished difference Result 1056 states and 1434 transitions. [2024-11-18 09:33:22,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 09:33:22,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2024-11-18 09:33:22,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:22,391 INFO L225 Difference]: With dead ends: 1056 [2024-11-18 09:33:22,392 INFO L226 Difference]: Without dead ends: 1001 [2024-11-18 09:33:22,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-18 09:33:22,393 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 50 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:22,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 493 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:33:22,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2024-11-18 09:33:22,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 928. [2024-11-18 09:33:22,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 835 states have (on average 1.2850299401197605) internal successors, (1073), 839 states have internal predecessors, (1073), 86 states have call successors, (86), 4 states have call predecessors, (86), 6 states have return successors, (93), 87 states have call predecessors, (93), 83 states have call successors, (93) [2024-11-18 09:33:22,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1252 transitions. [2024-11-18 09:33:22,435 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1252 transitions. Word has length 54 [2024-11-18 09:33:22,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:22,436 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1252 transitions. [2024-11-18 09:33:22,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:22,436 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1252 transitions. [2024-11-18 09:33:22,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-18 09:33:22,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:22,440 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:22,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-18 09:33:22,643 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,SelfDestructingSolverStorable25 [2024-11-18 09:33:22,644 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:22,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:22,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1093181230, now seen corresponding path program 1 times [2024-11-18 09:33:22,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:22,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334200375] [2024-11-18 09:33:22,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:22,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-18 09:33:23,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:23,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334200375] [2024-11-18 09:33:23,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334200375] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:33:23,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449282409] [2024-11-18 09:33:23,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:23,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:33:23,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:33:23,121 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:33:23,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-18 09:33:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:23,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-18 09:33:23,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:23,302 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:33:23,303 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:33:23,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449282409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:23,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 09:33:23,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 23 [2024-11-18 09:33:23,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369016923] [2024-11-18 09:33:23,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:23,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 09:33:23,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:23,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 09:33:23,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2024-11-18 09:33:23,305 INFO L87 Difference]: Start difference. First operand 928 states and 1252 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:23,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:23,514 INFO L93 Difference]: Finished difference Result 1181 states and 1594 transitions. [2024-11-18 09:33:23,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 09:33:23,514 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2024-11-18 09:33:23,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:23,519 INFO L225 Difference]: With dead ends: 1181 [2024-11-18 09:33:23,519 INFO L226 Difference]: Without dead ends: 1104 [2024-11-18 09:33:23,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2024-11-18 09:33:23,523 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 62 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:23,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 907 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 09:33:23,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2024-11-18 09:33:23,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 839. [2024-11-18 09:33:23,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 756 states have (on average 1.283068783068783) internal successors, (970), 762 states have internal predecessors, (970), 76 states have call successors, (76), 4 states have call predecessors, (76), 6 states have return successors, (81), 75 states have call predecessors, (81), 73 states have call successors, (81) [2024-11-18 09:33:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1127 transitions. [2024-11-18 09:33:23,559 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1127 transitions. Word has length 55 [2024-11-18 09:33:23,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:23,560 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1127 transitions. [2024-11-18 09:33:23,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:23,561 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1127 transitions. [2024-11-18 09:33:23,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-18 09:33:23,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:23,563 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:23,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-18 09:33:23,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-18 09:33:23,764 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:23,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:23,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1378877764, now seen corresponding path program 1 times [2024-11-18 09:33:23,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:23,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209237638] [2024-11-18 09:33:23,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:23,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:24,169 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-18 09:33:24,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:24,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209237638] [2024-11-18 09:33:24,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209237638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:24,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:24,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-18 09:33:24,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273547525] [2024-11-18 09:33:24,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:24,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-18 09:33:24,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:24,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-18 09:33:24,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-18 09:33:24,171 INFO L87 Difference]: Start difference. First operand 839 states and 1127 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:24,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:24,405 INFO L93 Difference]: Finished difference Result 893 states and 1192 transitions. [2024-11-18 09:33:24,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-18 09:33:24,406 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2024-11-18 09:33:24,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:24,410 INFO L225 Difference]: With dead ends: 893 [2024-11-18 09:33:24,410 INFO L226 Difference]: Without dead ends: 891 [2024-11-18 09:33:24,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-11-18 09:33:24,411 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 86 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:24,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1154 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:33:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2024-11-18 09:33:24,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 843. [2024-11-18 09:33:24,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 759 states have (on average 1.2819499341238472) internal successors, (973), 765 states have internal predecessors, (973), 76 states have call successors, (76), 5 states have call predecessors, (76), 7 states have return successors, (81), 75 states have call predecessors, (81), 73 states have call successors, (81) [2024-11-18 09:33:24,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1130 transitions. [2024-11-18 09:33:24,444 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1130 transitions. Word has length 55 [2024-11-18 09:33:24,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:24,444 INFO L471 AbstractCegarLoop]: Abstraction has 843 states and 1130 transitions. [2024-11-18 09:33:24,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:24,445 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1130 transitions. [2024-11-18 09:33:24,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-18 09:33:24,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:24,446 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:24,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-18 09:33:24,447 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:24,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:24,447 INFO L85 PathProgramCache]: Analyzing trace with hash 346443804, now seen corresponding path program 1 times [2024-11-18 09:33:24,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:24,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510508596] [2024-11-18 09:33:24,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:24,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:24,830 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-18 09:33:24,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:24,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510508596] [2024-11-18 09:33:24,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510508596] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:33:24,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449283847] [2024-11-18 09:33:24,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:24,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:33:24,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:33:24,833 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:33:24,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-18 09:33:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:24,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-18 09:33:24,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:25,132 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-18 09:33:25,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:33:25,271 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-18 09:33:25,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449283847] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 09:33:25,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:33:25,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12, 11] total 18 [2024-11-18 09:33:25,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275131870] [2024-11-18 09:33:25,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:25,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 09:33:25,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:25,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 09:33:25,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-11-18 09:33:25,273 INFO L87 Difference]: Start difference. First operand 843 states and 1130 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:25,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:25,371 INFO L93 Difference]: Finished difference Result 849 states and 1135 transitions. [2024-11-18 09:33:25,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 09:33:25,372 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2024-11-18 09:33:25,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:25,375 INFO L225 Difference]: With dead ends: 849 [2024-11-18 09:33:25,375 INFO L226 Difference]: Without dead ends: 847 [2024-11-18 09:33:25,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-11-18 09:33:25,376 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 12 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:25,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 712 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:33:25,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2024-11-18 09:33:25,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2024-11-18 09:33:25,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 762 states have (on average 1.2808398950131235) internal successors, (976), 768 states have internal predecessors, (976), 76 states have call successors, (76), 6 states have call predecessors, (76), 8 states have return successors, (81), 75 states have call predecessors, (81), 73 states have call successors, (81) [2024-11-18 09:33:25,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1133 transitions. [2024-11-18 09:33:25,411 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1133 transitions. Word has length 55 [2024-11-18 09:33:25,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:25,412 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1133 transitions. [2024-11-18 09:33:25,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:25,412 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1133 transitions. [2024-11-18 09:33:25,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-18 09:33:25,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:25,413 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:25,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-18 09:33:25,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:33:25,614 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:25,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:25,615 INFO L85 PathProgramCache]: Analyzing trace with hash 38676205, now seen corresponding path program 1 times [2024-11-18 09:33:25,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:25,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694996957] [2024-11-18 09:33:25,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:25,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:25,705 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-18 09:33:25,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:25,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694996957] [2024-11-18 09:33:25,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694996957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:25,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:25,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 09:33:25,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769522645] [2024-11-18 09:33:25,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:25,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 09:33:25,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:25,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 09:33:25,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 09:33:25,708 INFO L87 Difference]: Start difference. First operand 847 states and 1133 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:25,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:25,765 INFO L93 Difference]: Finished difference Result 874 states and 1161 transitions. [2024-11-18 09:33:25,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 09:33:25,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2024-11-18 09:33:25,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:25,769 INFO L225 Difference]: With dead ends: 874 [2024-11-18 09:33:25,769 INFO L226 Difference]: Without dead ends: 872 [2024-11-18 09:33:25,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:33:25,770 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 19 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:25,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 732 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:33:25,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-11-18 09:33:25,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 853. [2024-11-18 09:33:25,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 766 states have (on average 1.279373368146214) internal successors, (980), 773 states have internal predecessors, (980), 77 states have call successors, (77), 7 states have call predecessors, (77), 9 states have return successors, (82), 75 states have call predecessors, (82), 74 states have call successors, (82) [2024-11-18 09:33:25,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1139 transitions. [2024-11-18 09:33:25,808 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1139 transitions. Word has length 56 [2024-11-18 09:33:25,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:25,808 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1139 transitions. [2024-11-18 09:33:25,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:25,809 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1139 transitions. [2024-11-18 09:33:25,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-18 09:33:25,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:25,810 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:25,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-18 09:33:25,811 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:25,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:25,811 INFO L85 PathProgramCache]: Analyzing trace with hash 95934507, now seen corresponding path program 1 times [2024-11-18 09:33:25,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:25,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717132046] [2024-11-18 09:33:25,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:25,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-18 09:33:25,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:25,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717132046] [2024-11-18 09:33:25,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717132046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:25,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:25,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 09:33:25,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535984993] [2024-11-18 09:33:25,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:25,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 09:33:25,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:25,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 09:33:25,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 09:33:25,902 INFO L87 Difference]: Start difference. First operand 853 states and 1139 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:25,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:25,956 INFO L93 Difference]: Finished difference Result 863 states and 1148 transitions. [2024-11-18 09:33:25,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 09:33:25,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2024-11-18 09:33:25,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:25,960 INFO L225 Difference]: With dead ends: 863 [2024-11-18 09:33:25,960 INFO L226 Difference]: Without dead ends: 861 [2024-11-18 09:33:25,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:33:25,961 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 8 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:25,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 645 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:33:25,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-11-18 09:33:25,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 857. [2024-11-18 09:33:25,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 769 states have (on average 1.2782834850455136) internal successors, (983), 776 states have internal predecessors, (983), 77 states have call successors, (77), 8 states have call predecessors, (77), 10 states have return successors, (82), 75 states have call predecessors, (82), 74 states have call successors, (82) [2024-11-18 09:33:26,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1142 transitions. [2024-11-18 09:33:26,002 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1142 transitions. Word has length 56 [2024-11-18 09:33:26,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:26,002 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1142 transitions. [2024-11-18 09:33:26,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:26,003 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1142 transitions. [2024-11-18 09:33:26,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-18 09:33:26,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:26,004 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:26,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-18 09:33:26,005 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:26,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:26,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1674208059, now seen corresponding path program 1 times [2024-11-18 09:33:26,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:26,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456586405] [2024-11-18 09:33:26,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:26,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:26,367 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-18 09:33:26,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:26,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456586405] [2024-11-18 09:33:26,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456586405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:26,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:26,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-18 09:33:26,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643788764] [2024-11-18 09:33:26,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:26,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-18 09:33:26,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:26,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-18 09:33:26,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-18 09:33:26,371 INFO L87 Difference]: Start difference. First operand 857 states and 1142 transitions. Second operand has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-18 09:33:26,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:26,673 INFO L93 Difference]: Finished difference Result 1110 states and 1474 transitions. [2024-11-18 09:33:26,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 09:33:26,673 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2024-11-18 09:33:26,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:26,678 INFO L225 Difference]: With dead ends: 1110 [2024-11-18 09:33:26,678 INFO L226 Difference]: Without dead ends: 913 [2024-11-18 09:33:26,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-18 09:33:26,680 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 91 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1420 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:26,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1420 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 09:33:26,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2024-11-18 09:33:26,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 870. [2024-11-18 09:33:26,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 777 states have (on average 1.2715572715572716) internal successors, (988), 780 states have internal predecessors, (988), 81 states have call successors, (81), 9 states have call predecessors, (81), 11 states have return successors, (86), 83 states have call predecessors, (86), 78 states have call successors, (86) [2024-11-18 09:33:26,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1155 transitions. [2024-11-18 09:33:26,724 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1155 transitions. Word has length 58 [2024-11-18 09:33:26,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:26,724 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1155 transitions. [2024-11-18 09:33:26,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-18 09:33:26,724 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1155 transitions. [2024-11-18 09:33:26,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-18 09:33:26,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:26,729 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:26,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-18 09:33:26,729 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:26,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:26,730 INFO L85 PathProgramCache]: Analyzing trace with hash -232984945, now seen corresponding path program 1 times [2024-11-18 09:33:26,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:26,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976125940] [2024-11-18 09:33:26,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:26,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:26,923 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-18 09:33:26,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:33:26,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976125940] [2024-11-18 09:33:26,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976125940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:26,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:26,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 09:33:26,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442237709] [2024-11-18 09:33:26,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:26,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 09:33:26,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:33:26,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 09:33:26,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-18 09:33:26,925 INFO L87 Difference]: Start difference. First operand 870 states and 1155 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-18 09:33:27,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:27,139 INFO L93 Difference]: Finished difference Result 1143 states and 1517 transitions. [2024-11-18 09:33:27,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 09:33:27,140 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 59 [2024-11-18 09:33:27,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:27,144 INFO L225 Difference]: With dead ends: 1143 [2024-11-18 09:33:27,147 INFO L226 Difference]: Without dead ends: 973 [2024-11-18 09:33:27,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-18 09:33:27,149 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 110 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:27,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1142 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:33:27,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2024-11-18 09:33:27,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 870. [2024-11-18 09:33:27,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 777 states have (on average 1.2664092664092663) internal successors, (984), 780 states have internal predecessors, (984), 81 states have call successors, (81), 9 states have call predecessors, (81), 11 states have return successors, (86), 83 states have call predecessors, (86), 78 states have call successors, (86) [2024-11-18 09:33:27,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1151 transitions. [2024-11-18 09:33:27,193 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1151 transitions. Word has length 59 [2024-11-18 09:33:27,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:27,194 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1151 transitions. [2024-11-18 09:33:27,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-18 09:33:27,194 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1151 transitions. [2024-11-18 09:33:27,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-18 09:33:27,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:27,196 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:27,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-18 09:33:27,196 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:27,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:27,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1601933524, now seen corresponding path program 1 times [2024-11-18 09:33:27,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:33:27,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007446415] [2024-11-18 09:33:27,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:27,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:33:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 09:33:27,235 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 09:33:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 09:33:27,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 09:33:27,288 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 09:33:27,289 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 09:33:27,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-18 09:33:27,294 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:27,343 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 09:33:27,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:33:27 BoogieIcfgContainer [2024-11-18 09:33:27,346 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 09:33:27,346 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 09:33:27,346 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 09:33:27,347 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 09:33:27,347 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:33:09" (3/4) ... [2024-11-18 09:33:27,349 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 09:33:27,350 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 09:33:27,351 INFO L158 Benchmark]: Toolchain (without parser) took 18897.52ms. Allocated memory was 165.7MB in the beginning and 383.8MB in the end (delta: 218.1MB). Free memory was 97.0MB in the beginning and 149.3MB in the end (delta: -52.3MB). Peak memory consumption was 168.0MB. Max. memory is 16.1GB. [2024-11-18 09:33:27,351 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 104.9MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 09:33:27,351 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.97ms. Allocated memory is still 165.7MB. Free memory was 96.7MB in the beginning and 133.1MB in the end (delta: -36.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 09:33:27,352 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.02ms. Allocated memory is still 165.7MB. Free memory was 133.1MB in the beginning and 131.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 09:33:27,352 INFO L158 Benchmark]: Boogie Preprocessor took 41.45ms. Allocated memory is still 165.7MB. Free memory was 131.1MB in the beginning and 128.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 09:33:27,352 INFO L158 Benchmark]: RCFGBuilder took 574.37ms. Allocated memory is still 165.7MB. Free memory was 128.4MB in the beginning and 104.3MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-18 09:33:27,352 INFO L158 Benchmark]: TraceAbstraction took 17746.40ms. Allocated memory was 165.7MB in the beginning and 383.8MB in the end (delta: 218.1MB). Free memory was 103.7MB in the beginning and 149.3MB in the end (delta: -45.6MB). Peak memory consumption was 174.9MB. Max. memory is 16.1GB. [2024-11-18 09:33:27,352 INFO L158 Benchmark]: Witness Printer took 4.28ms. Allocated memory is still 383.8MB. Free memory is still 149.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 09:33:27,353 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.12ms. Allocated memory is still 104.9MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 481.97ms. Allocated memory is still 165.7MB. Free memory was 96.7MB in the beginning and 133.1MB in the end (delta: -36.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.02ms. Allocated memory is still 165.7MB. Free memory was 133.1MB in the beginning and 131.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.45ms. Allocated memory is still 165.7MB. Free memory was 131.1MB in the beginning and 128.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 574.37ms. Allocated memory is still 165.7MB. Free memory was 128.4MB in the beginning and 104.3MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17746.40ms. Allocated memory was 165.7MB in the beginning and 383.8MB in the end (delta: 218.1MB). Free memory was 103.7MB in the beginning and 149.3MB in the end (delta: -45.6MB). Peak memory consumption was 174.9MB. Max. memory is 16.1GB. * Witness Printer took 4.28ms. Allocated memory is still 383.8MB. Free memory is still 149.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 17]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 110, overapproximation of bitwiseAnd at line 76. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; VAL [ea=-127, eb=127] [L251] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L251] RET, EXPR base2flt(0, 0) VAL [ea=-127, eb=127] [L251] zero = base2flt(0, 0) [L252] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-127, \old(m)=33554431] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-127, \old(m)=33554431, e=-127, m=33554431] [L29] COND FALSE !(! m) VAL [\old(e)=-127, \old(m)=33554431, e=-127, m=33554431] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-127, \old(m)=33554431, e=-127, m=33554431] [L57] COND TRUE 1 VAL [\old(e)=-127, \old(m)=33554431, e=-127, m=33554431] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-127, \old(m)=33554431, e=-127, m=33554431] [L76] EXPR m & ~ (1U << 24U) VAL [\old(e)=-127, \old(m)=33554431, e=-127] [L76] m = m & ~ (1U << 24U) [L77] EXPR m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-127, \old(m)=33554431] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-127, \old(m)=33554431, __retres4=16777216] [L80] return (__retres4); VAL [\old(e)=-127, \old(m)=33554431, \result=16777216] [L252] RET, EXPR base2flt(ma, ea) VAL [ea=-127, eb=127, ma=33554431, zero=0] [L252] a = base2flt(ma, ea) [L253] 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); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, m=33554432] [L253] RET, EXPR base2flt(mb, eb) VAL [a=16777216, ea=-127, eb=127, ma=33554431, mb=33554432, zero=0] [L253] b = base2flt(mb, eb) [L255] COND FALSE !(a < zero) VAL [a=16777216, b=4294967295, ea=-127, eb=127, ma=33554431, mb=33554432, zero=0] [L258] COND TRUE a > zero [L259] tmp = 1 VAL [a=16777216, b=4294967295, ea=-127, eb=127, ma=33554431, mb=33554432, tmp=1, zero=0] [L263] sa = tmp VAL [a=16777216, b=4294967295, ea=-127, eb=127, ma=33554431, mb=33554432, sa=1, zero=0] [L265] COND FALSE !(b < zero) VAL [a=16777216, b=4294967295, ea=-127, eb=127, ma=33554431, mb=33554432, sa=1, zero=0] [L268] COND TRUE b > zero [L269] tmp___0 = 1 VAL [a=16777216, b=4294967295, ea=-127, eb=127, ma=33554431, mb=33554432, sa=1, tmp___0=1] [L273] sb = tmp___0 VAL [a=16777216, b=4294967295, ea=-127, eb=127, ma=33554431, mb=33554432, sa=1, sb=1] [L276] CALL addflt(a, b) [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [a=16777216, b=4294967295] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [a=4294967295, b=16777216] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 VAL [a=4294967295, b=16777216, ea=127, ma=16777215] [L110] EXPR ma | (1U << 24U) VAL [a=4294967295, b=16777216, ea=127] [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 VAL [a=4294967295, ea=127, eb=-127, ma=16777216, mb=0] [L113] EXPR mb | (1U << 24U) VAL [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 [a=4294967295, ea=127, eb=-127, ma=16777216, mb=16777216] [L115] delta = ea - eb VAL [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 3 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.6s, OverallIterations: 34, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1866 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1750 mSDsluCounter, 25647 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20826 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3952 IncrementalHoareTripleChecker+Invalid, 4051 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 4821 mSDtfsCounter, 3952 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1268 GetRequests, 975 SyntacticMatches, 4 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1012occurred in iteration=20, InterpolantAutomatonStates: 229, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 33 MinimizatonAttempts, 1971 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 2336 NumberOfCodeBlocks, 2336 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 2518 ConstructedInterpolants, 0 QuantifiedInterpolants, 5361 SizeOfPredicates, 17 NumberOfNonLiveVariables, 2084 ConjunctsInSsa, 222 ConjunctsInUnsatCore, 53 InterpolantComputations, 30 PerfectInterpolantSequences, 789/873 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-18 09:33:27,381 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 09:33:29,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 09:33:29,678 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 09:33:29,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 09:33:29,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 09:33:29,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 09:33:29,717 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 09:33:29,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 09:33:29,720 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 09:33:29,721 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 09:33:29,722 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 09:33:29,722 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 09:33:29,722 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 09:33:29,723 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 09:33:29,723 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 09:33:29,723 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 09:33:29,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 09:33:29,724 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 09:33:29,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 09:33:29,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 09:33:29,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 09:33:29,729 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 09:33:29,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 09:33:29,730 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 09:33:29,730 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 09:33:29,730 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 09:33:29,731 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 09:33:29,731 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 09:33:29,731 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 09:33:29,731 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 09:33:29,732 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 09:33:29,732 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 09:33:29,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 09:33:29,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 09:33:29,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:33:29,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 09:33:29,734 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 09:33:29,735 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 09:33:29,735 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 09:33:29,735 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 09:33:29,735 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 09:33:29,736 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 09:33:29,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 09:33:29,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 09:33:29,737 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2024-11-18 09:33:30,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 09:33:30,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 09:33:30,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 09:33:30,099 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 09:33:30,100 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 09:33:30,101 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2024-11-18 09:33:31,698 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 09:33:31,921 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 09:33:31,922 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2024-11-18 09:33:31,930 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0fad3837/abcc95d29d1a497c95d2a696db59ab67/FLAGfbe5ca5b6 [2024-11-18 09:33:31,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0fad3837/abcc95d29d1a497c95d2a696db59ab67 [2024-11-18 09:33:31,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 09:33:31,944 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 09:33:31,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 09:33:31,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 09:33:31,950 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 09:33:31,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:33:31" (1/1) ... [2024-11-18 09:33:31,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2026158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:31, skipping insertion in model container [2024-11-18 09:33:31,952 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:33:31" (1/1) ... [2024-11-18 09:33:31,982 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 09:33:32,177 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c[730,743] [2024-11-18 09:33:32,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:33:32,276 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 09:33:32,289 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c[730,743] [2024-11-18 09:33:32,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:33:32,358 INFO L204 MainTranslator]: Completed translation [2024-11-18 09:33:32,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:32 WrapperNode [2024-11-18 09:33:32,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 09:33:32,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 09:33:32,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 09:33:32,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 09:33:32,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:32" (1/1) ... [2024-11-18 09:33:32,381 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:32" (1/1) ... [2024-11-18 09:33:32,413 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 148 [2024-11-18 09:33:32,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 09:33:32,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 09:33:32,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 09:33:32,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 09:33:32,425 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:32" (1/1) ... [2024-11-18 09:33:32,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:32" (1/1) ... [2024-11-18 09:33:32,431 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:32" (1/1) ... [2024-11-18 09:33:32,457 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 09:33:32,461 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:32" (1/1) ... [2024-11-18 09:33:32,462 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:32" (1/1) ... [2024-11-18 09:33:32,471 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:32" (1/1) ... [2024-11-18 09:33:32,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:32" (1/1) ... [2024-11-18 09:33:32,479 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:32" (1/1) ... [2024-11-18 09:33:32,480 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:32" (1/1) ... [2024-11-18 09:33:32,486 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 09:33:32,487 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 09:33:32,487 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 09:33:32,487 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 09:33:32,488 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:32" (1/1) ... [2024-11-18 09:33:32,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:33:32,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:33:32,530 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 09:33:32,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 09:33:32,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 09:33:32,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 09:33:32,581 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-18 09:33:32,581 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-18 09:33:32,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 09:33:32,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 09:33:32,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-18 09:33:32,583 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-18 09:33:32,680 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 09:33:32,683 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 09:33:33,044 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-18 09:33:33,044 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 09:33:33,061 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 09:33:33,064 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-18 09:33:33,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:33:33 BoogieIcfgContainer [2024-11-18 09:33:33,065 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 09:33:33,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 09:33:33,068 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 09:33:33,072 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 09:33:33,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:33:31" (1/3) ... [2024-11-18 09:33:33,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba8ec25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:33:33, skipping insertion in model container [2024-11-18 09:33:33,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:32" (2/3) ... [2024-11-18 09:33:33,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba8ec25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:33:33, skipping insertion in model container [2024-11-18 09:33:33,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:33:33" (3/3) ... [2024-11-18 09:33:33,076 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2024-11-18 09:33:33,093 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 09:33:33,093 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 09:33:33,154 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 09:33:33,160 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;@63c7f408, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 09:33:33,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 09:33:33,167 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 62 states have internal predecessors, (94), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-18 09:33:33,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-18 09:33:33,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:33,177 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:33,178 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:33,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:33,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1607439287, now seen corresponding path program 1 times [2024-11-18 09:33:33,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:33:33,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561921859] [2024-11-18 09:33:33,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:33,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:33,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:33:33,216 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:33:33,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-18 09:33:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:33,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 09:33:33,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:33,450 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 09:33:33,451 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:33:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 09:33:33,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:33:33,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561921859] [2024-11-18 09:33:33,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561921859] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:33:33,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:33:33,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-18 09:33:33,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541479610] [2024-11-18 09:33:33,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 09:33:33,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 09:33:33,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:33:33,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 09:33:33,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 09:33:33,567 INFO L87 Difference]: Start difference. First operand has 72 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 62 states have internal predecessors, (94), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 09:33:33,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:33,692 INFO L93 Difference]: Finished difference Result 154 states and 254 transitions. [2024-11-18 09:33:33,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 09:33:33,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2024-11-18 09:33:33,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:33,707 INFO L225 Difference]: With dead ends: 154 [2024-11-18 09:33:33,707 INFO L226 Difference]: Without dead ends: 81 [2024-11-18 09:33:33,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 09:33:33,719 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 5 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:33,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 496 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:33:33,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-18 09:33:33,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2024-11-18 09:33:33,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 67 states have internal predecessors, (95), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2024-11-18 09:33:33,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 121 transitions. [2024-11-18 09:33:33,763 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 121 transitions. Word has length 32 [2024-11-18 09:33:33,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:33,764 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 121 transitions. [2024-11-18 09:33:33,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 09:33:33,764 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 121 transitions. [2024-11-18 09:33:33,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-18 09:33:33,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:33,767 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:33,770 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-11-18 09:33:33,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:33,969 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:33,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:33,970 INFO L85 PathProgramCache]: Analyzing trace with hash 861184615, now seen corresponding path program 1 times [2024-11-18 09:33:33,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:33:33,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684259418] [2024-11-18 09:33:33,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:33,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:33,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:33:33,972 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:33:33,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-18 09:33:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:34,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 09:33:34,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:34,118 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 09:33:34,119 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:33:34,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:33:34,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684259418] [2024-11-18 09:33:34,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1684259418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:34,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:34,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 09:33:34,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735023113] [2024-11-18 09:33:34,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:34,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 09:33:34,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:33:34,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 09:33:34,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 09:33:34,126 INFO L87 Difference]: Start difference. First operand 80 states and 121 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:34,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:34,230 INFO L93 Difference]: Finished difference Result 167 states and 257 transitions. [2024-11-18 09:33:34,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 09:33:34,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-11-18 09:33:34,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:34,233 INFO L225 Difference]: With dead ends: 167 [2024-11-18 09:33:34,233 INFO L226 Difference]: Without dead ends: 125 [2024-11-18 09:33:34,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 09:33:34,235 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 45 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:34,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 440 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:33:34,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-18 09:33:34,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2024-11-18 09:33:34,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 103 states have (on average 1.4660194174757282) internal successors, (151), 104 states have internal predecessors, (151), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (20), 18 states have call predecessors, (20), 15 states have call successors, (20) [2024-11-18 09:33:34,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 187 transitions. [2024-11-18 09:33:34,252 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 187 transitions. Word has length 36 [2024-11-18 09:33:34,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:34,253 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 187 transitions. [2024-11-18 09:33:34,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:34,254 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 187 transitions. [2024-11-18 09:33:34,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-18 09:33:34,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:34,255 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:34,260 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-11-18 09:33:34,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:34,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:34,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:34,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1541242985, now seen corresponding path program 1 times [2024-11-18 09:33:34,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:33:34,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025727741] [2024-11-18 09:33:34,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:34,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:34,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:33:34,464 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:33:34,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-18 09:33:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:34,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 09:33:34,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:34,601 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 09:33:34,601 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:33:34,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:33:34,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025727741] [2024-11-18 09:33:34,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025727741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:34,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:34,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 09:33:34,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314787834] [2024-11-18 09:33:34,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:34,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 09:33:34,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:33:34,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 09:33:34,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:33:34,604 INFO L87 Difference]: Start difference. First operand 123 states and 187 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:34,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:34,728 INFO L93 Difference]: Finished difference Result 155 states and 233 transitions. [2024-11-18 09:33:34,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 09:33:34,729 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-11-18 09:33:34,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:34,734 INFO L225 Difference]: With dead ends: 155 [2024-11-18 09:33:34,734 INFO L226 Difference]: Without dead ends: 116 [2024-11-18 09:33:34,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-18 09:33:34,736 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 33 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:34,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 517 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:33:34,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-18 09:33:34,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2024-11-18 09:33:34,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.443298969072165) internal successors, (140), 98 states have internal predecessors, (140), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (17), 15 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-18 09:33:34,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 170 transitions. [2024-11-18 09:33:34,754 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 170 transitions. Word has length 36 [2024-11-18 09:33:34,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:34,754 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 170 transitions. [2024-11-18 09:33:34,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:34,755 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 170 transitions. [2024-11-18 09:33:34,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-18 09:33:34,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:34,757 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:34,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-18 09:33:34,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:34,958 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:34,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:34,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1860643154, now seen corresponding path program 1 times [2024-11-18 09:33:34,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:33:34,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584197264] [2024-11-18 09:33:34,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:34,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:34,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:33:34,963 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:33:34,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-18 09:33:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:35,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-18 09:33:35,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:35,125 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 09:33:35,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:33:35,185 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 09:33:35,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:33:35,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584197264] [2024-11-18 09:33:35,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584197264] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:33:35,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:33:35,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-18 09:33:35,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779072347] [2024-11-18 09:33:35,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 09:33:35,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 09:33:35,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:33:35,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 09:33:35,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-18 09:33:35,192 INFO L87 Difference]: Start difference. First operand 114 states and 170 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 09:33:35,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:35,341 INFO L93 Difference]: Finished difference Result 256 states and 385 transitions. [2024-11-18 09:33:35,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 09:33:35,341 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2024-11-18 09:33:35,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:35,344 INFO L225 Difference]: With dead ends: 256 [2024-11-18 09:33:35,345 INFO L226 Difference]: Without dead ends: 181 [2024-11-18 09:33:35,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-18 09:33:35,347 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 28 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:35,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 597 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:33:35,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-18 09:33:35,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2024-11-18 09:33:35,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 155 states have (on average 1.3870967741935485) internal successors, (215), 154 states have internal predecessors, (215), 19 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (25), 25 states have call predecessors, (25), 18 states have call successors, (25) [2024-11-18 09:33:35,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 259 transitions. [2024-11-18 09:33:35,368 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 259 transitions. Word has length 40 [2024-11-18 09:33:35,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:35,369 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 259 transitions. [2024-11-18 09:33:35,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 09:33:35,369 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 259 transitions. [2024-11-18 09:33:35,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-18 09:33:35,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:35,371 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:35,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-18 09:33:35,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:35,572 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:35,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:35,573 INFO L85 PathProgramCache]: Analyzing trace with hash 339137576, now seen corresponding path program 1 times [2024-11-18 09:33:35,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:33:35,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137045295] [2024-11-18 09:33:35,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:35,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:35,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:33:35,575 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:33:35,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-18 09:33:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:35,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 09:33:35,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:33:35,671 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:33:35,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:33:35,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137045295] [2024-11-18 09:33:35,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2137045295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:35,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:35,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:33:35,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26117238] [2024-11-18 09:33:35,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:35,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:33:35,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:33:35,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:33:35,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:33:35,674 INFO L87 Difference]: Start difference. First operand 178 states and 259 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:35,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:35,748 INFO L93 Difference]: Finished difference Result 299 states and 439 transitions. [2024-11-18 09:33:35,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:33:35,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-11-18 09:33:35,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:35,752 INFO L225 Difference]: With dead ends: 299 [2024-11-18 09:33:35,752 INFO L226 Difference]: Without dead ends: 233 [2024-11-18 09:33:35,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:33:35,757 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 14 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:35,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 328 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:33:35,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-18 09:33:35,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-11-18 09:33:35,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 207 states have (on average 1.3478260869565217) internal successors, (279), 206 states have internal predecessors, (279), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (28), 28 states have call predecessors, (28), 21 states have call successors, (28) [2024-11-18 09:33:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 329 transitions. [2024-11-18 09:33:35,782 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 329 transitions. Word has length 43 [2024-11-18 09:33:35,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:35,783 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 329 transitions. [2024-11-18 09:33:35,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:35,783 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 329 transitions. [2024-11-18 09:33:35,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-18 09:33:35,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:35,786 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:35,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-18 09:33:35,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:35,987 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:35,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:35,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1682069059, now seen corresponding path program 1 times [2024-11-18 09:33:35,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:33:35,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693178442] [2024-11-18 09:33:35,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:35,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:35,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:33:35,990 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:33:35,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-18 09:33:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:36,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 09:33:36,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:36,088 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 09:33:36,089 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:33:36,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:33:36,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693178442] [2024-11-18 09:33:36,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693178442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:36,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:36,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:33:36,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843965993] [2024-11-18 09:33:36,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:36,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:33:36,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:33:36,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:33:36,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:33:36,092 INFO L87 Difference]: Start difference. First operand 233 states and 329 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 09:33:36,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:36,163 INFO L93 Difference]: Finished difference Result 408 states and 573 transitions. [2024-11-18 09:33:36,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:33:36,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2024-11-18 09:33:36,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:36,167 INFO L225 Difference]: With dead ends: 408 [2024-11-18 09:33:36,167 INFO L226 Difference]: Without dead ends: 178 [2024-11-18 09:33:36,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:33:36,172 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 26 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:36,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 261 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:33:36,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-18 09:33:36,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2024-11-18 09:33:36,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 146 states have (on average 1.3082191780821917) internal successors, (191), 148 states have internal predecessors, (191), 15 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (20), 17 states have call predecessors, (20), 14 states have call successors, (20) [2024-11-18 09:33:36,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 226 transitions. [2024-11-18 09:33:36,196 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 226 transitions. Word has length 43 [2024-11-18 09:33:36,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:36,196 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 226 transitions. [2024-11-18 09:33:36,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 09:33:36,197 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 226 transitions. [2024-11-18 09:33:36,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-18 09:33:36,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:36,198 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:36,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-18 09:33:36,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:36,405 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:36,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:36,405 INFO L85 PathProgramCache]: Analyzing trace with hash -690232792, now seen corresponding path program 1 times [2024-11-18 09:33:36,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:33:36,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123365735] [2024-11-18 09:33:36,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:36,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:36,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:33:36,408 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:33:36,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-18 09:33:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:36,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-18 09:33:36,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 09:33:36,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:33:36,708 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:33:36,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:33:36,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123365735] [2024-11-18 09:33:36,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123365735] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 09:33:36,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 09:33:36,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2024-11-18 09:33:36,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510436412] [2024-11-18 09:33:36,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:36,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 09:33:36,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:33:36,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 09:33:36,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-18 09:33:36,713 INFO L87 Difference]: Start difference. First operand 166 states and 226 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:36,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:36,897 INFO L93 Difference]: Finished difference Result 252 states and 354 transitions. [2024-11-18 09:33:36,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 09:33:36,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-18 09:33:36,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:36,900 INFO L225 Difference]: With dead ends: 252 [2024-11-18 09:33:36,901 INFO L226 Difference]: Without dead ends: 216 [2024-11-18 09:33:36,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-18 09:33:36,902 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 24 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:36,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 433 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 09:33:36,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-18 09:33:36,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 204. [2024-11-18 09:33:36,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 178 states have (on average 1.303370786516854) internal successors, (232), 181 states have internal predecessors, (232), 21 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2024-11-18 09:33:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 279 transitions. [2024-11-18 09:33:36,912 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 279 transitions. Word has length 44 [2024-11-18 09:33:36,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:36,913 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 279 transitions. [2024-11-18 09:33:36,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:36,913 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 279 transitions. [2024-11-18 09:33:36,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-18 09:33:36,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:36,914 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:36,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-18 09:33:37,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:37,115 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:37,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:37,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1084774570, now seen corresponding path program 1 times [2024-11-18 09:33:37,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:33:37,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266868682] [2024-11-18 09:33:37,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:37,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:37,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:33:37,119 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:33:37,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-18 09:33:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:37,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 09:33:37,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:37,189 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:33:37,189 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:33:37,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:33:37,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266868682] [2024-11-18 09:33:37,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266868682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:37,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:37,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 09:33:37,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574350541] [2024-11-18 09:33:37,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:37,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:33:37,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:33:37,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:33:37,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:33:37,192 INFO L87 Difference]: Start difference. First operand 204 states and 279 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:37,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:37,244 INFO L93 Difference]: Finished difference Result 211 states and 285 transitions. [2024-11-18 09:33:37,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:33:37,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-18 09:33:37,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:37,248 INFO L225 Difference]: With dead ends: 211 [2024-11-18 09:33:37,248 INFO L226 Difference]: Without dead ends: 204 [2024-11-18 09:33:37,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 09:33:37,249 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 3 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:37,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 382 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:33:37,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-18 09:33:37,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-11-18 09:33:37,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 178 states have (on average 1.2865168539325842) internal successors, (229), 181 states have internal predecessors, (229), 21 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2024-11-18 09:33:37,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 276 transitions. [2024-11-18 09:33:37,264 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 276 transitions. Word has length 44 [2024-11-18 09:33:37,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:37,264 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 276 transitions. [2024-11-18 09:33:37,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:37,266 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 276 transitions. [2024-11-18 09:33:37,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-18 09:33:37,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:37,268 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:37,273 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 (9)] Forceful destruction successful, exit code 0 [2024-11-18 09:33:37,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:37,470 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:37,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:37,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1077808761, now seen corresponding path program 2 times [2024-11-18 09:33:37,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:33:37,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306293259] [2024-11-18 09:33:37,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 09:33:37,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:37,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:33:37,472 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:33:37,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-18 09:33:37,512 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-18 09:33:37,513 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:33:37,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-18 09:33:37,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:37,644 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-18 09:33:37,644 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:33:37,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:33:37,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306293259] [2024-11-18 09:33:37,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306293259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:37,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:37,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 09:33:37,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484371807] [2024-11-18 09:33:37,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:37,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 09:33:37,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:33:37,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 09:33:37,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 09:33:37,646 INFO L87 Difference]: Start difference. First operand 204 states and 276 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:37,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:37,749 INFO L93 Difference]: Finished difference Result 210 states and 281 transitions. [2024-11-18 09:33:37,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 09:33:37,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-18 09:33:37,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:37,752 INFO L225 Difference]: With dead ends: 210 [2024-11-18 09:33:37,753 INFO L226 Difference]: Without dead ends: 208 [2024-11-18 09:33:37,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 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-11-18 09:33:37,755 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 3 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:37,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 459 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:33:37,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-18 09:33:37,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-11-18 09:33:37,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 1.281767955801105) internal successors, (232), 184 states have internal predecessors, (232), 21 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2024-11-18 09:33:37,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 279 transitions. [2024-11-18 09:33:37,768 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 279 transitions. Word has length 44 [2024-11-18 09:33:37,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:37,768 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 279 transitions. [2024-11-18 09:33:37,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:37,768 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 279 transitions. [2024-11-18 09:33:37,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-18 09:33:37,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:37,771 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:37,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-18 09:33:37,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:37,972 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:37,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:37,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1020550459, now seen corresponding path program 1 times [2024-11-18 09:33:37,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:33:37,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122537413] [2024-11-18 09:33:37,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:37,973 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:37,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:33:37,974 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:33:37,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-18 09:33:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:38,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-18 09:33:38,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:38,249 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-18 09:33:38,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:33:38,357 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-18 09:33:38,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:33:38,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122537413] [2024-11-18 09:33:38,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1122537413] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 09:33:38,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 09:33:38,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2024-11-18 09:33:38,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513494363] [2024-11-18 09:33:38,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:38,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 09:33:38,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:33:38,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 09:33:38,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-18 09:33:38,359 INFO L87 Difference]: Start difference. First operand 208 states and 279 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:38,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:38,437 INFO L93 Difference]: Finished difference Result 214 states and 284 transitions. [2024-11-18 09:33:38,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 09:33:38,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-18 09:33:38,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:38,439 INFO L225 Difference]: With dead ends: 214 [2024-11-18 09:33:38,440 INFO L226 Difference]: Without dead ends: 212 [2024-11-18 09:33:38,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-11-18 09:33:38,441 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 3 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:38,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 454 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:33:38,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-18 09:33:38,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-11-18 09:33:38,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 184 states have (on average 1.2771739130434783) internal successors, (235), 187 states have internal predecessors, (235), 21 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2024-11-18 09:33:38,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 282 transitions. [2024-11-18 09:33:38,456 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 282 transitions. Word has length 44 [2024-11-18 09:33:38,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:38,458 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 282 transitions. [2024-11-18 09:33:38,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:38,459 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 282 transitions. [2024-11-18 09:33:38,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-18 09:33:38,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:38,459 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:38,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-18 09:33:38,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:38,660 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:38,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:38,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1134786859, now seen corresponding path program 1 times [2024-11-18 09:33:38,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:33:38,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1945590904] [2024-11-18 09:33:38,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:38,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:38,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:33:38,662 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:33:38,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-18 09:33:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:38,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 09:33:38,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:38,731 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:33:38,731 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:33:38,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:33:38,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1945590904] [2024-11-18 09:33:38,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1945590904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:38,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:38,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:33:38,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68953907] [2024-11-18 09:33:38,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:38,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:33:38,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:33:38,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:33:38,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:33:38,734 INFO L87 Difference]: Start difference. First operand 212 states and 282 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:38,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:38,757 INFO L93 Difference]: Finished difference Result 345 states and 471 transitions. [2024-11-18 09:33:38,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:33:38,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2024-11-18 09:33:38,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:38,759 INFO L225 Difference]: With dead ends: 345 [2024-11-18 09:33:38,759 INFO L226 Difference]: Without dead ends: 293 [2024-11-18 09:33:38,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:33:38,761 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 27 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:38,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 321 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:33:38,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-18 09:33:38,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 231. [2024-11-18 09:33:38,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 200 states have (on average 1.285) internal successors, (257), 202 states have internal predecessors, (257), 24 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (29), 26 states have call predecessors, (29), 23 states have call successors, (29) [2024-11-18 09:33:38,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 310 transitions. [2024-11-18 09:33:38,782 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 310 transitions. Word has length 45 [2024-11-18 09:33:38,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:38,782 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 310 transitions. [2024-11-18 09:33:38,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:38,783 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 310 transitions. [2024-11-18 09:33:38,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-18 09:33:38,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:38,784 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:38,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-18 09:33:38,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:38,985 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:38,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:38,985 INFO L85 PathProgramCache]: Analyzing trace with hash 702695573, now seen corresponding path program 1 times [2024-11-18 09:33:38,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:33:38,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637814222] [2024-11-18 09:33:38,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:38,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:38,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:33:38,987 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:33:38,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-18 09:33:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:39,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 09:33:39,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:39,055 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:33:39,055 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:33:39,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:33:39,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637814222] [2024-11-18 09:33:39,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637814222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:39,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:39,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:33:39,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483213727] [2024-11-18 09:33:39,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:39,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:33:39,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:33:39,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:33:39,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:33:39,057 INFO L87 Difference]: Start difference. First operand 231 states and 310 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:39,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:39,074 INFO L93 Difference]: Finished difference Result 246 states and 326 transitions. [2024-11-18 09:33:39,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:33:39,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-18 09:33:39,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:39,077 INFO L225 Difference]: With dead ends: 246 [2024-11-18 09:33:39,079 INFO L226 Difference]: Without dead ends: 207 [2024-11-18 09:33:39,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:33:39,080 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:39,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:33:39,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-18 09:33:39,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-11-18 09:33:39,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 176 states have (on average 1.3011363636363635) internal successors, (229), 179 states have internal predecessors, (229), 24 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (27), 25 states have call predecessors, (27), 23 states have call successors, (27) [2024-11-18 09:33:39,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 280 transitions. [2024-11-18 09:33:39,093 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 280 transitions. Word has length 48 [2024-11-18 09:33:39,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:39,093 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 280 transitions. [2024-11-18 09:33:39,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:39,093 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 280 transitions. [2024-11-18 09:33:39,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-18 09:33:39,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:39,095 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:39,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-18 09:33:39,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:39,296 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:39,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:39,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1948634931, now seen corresponding path program 1 times [2024-11-18 09:33:39,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:33:39,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081213406] [2024-11-18 09:33:39,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:39,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:39,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:33:39,298 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:33:39,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-18 09:33:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:39,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-18 09:33:39,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:39,432 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:33:39,432 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:33:39,500 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-18 09:33:39,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:33:39,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2081213406] [2024-11-18 09:33:39,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2081213406] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:33:39,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:33:39,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-18 09:33:39,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527112443] [2024-11-18 09:33:39,501 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 09:33:39,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 09:33:39,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:33:39,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 09:33:39,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-18 09:33:39,504 INFO L87 Difference]: Start difference. First operand 207 states and 280 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-18 09:33:39,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:39,651 INFO L93 Difference]: Finished difference Result 245 states and 319 transitions. [2024-11-18 09:33:39,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-18 09:33:39,652 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2024-11-18 09:33:39,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:39,653 INFO L225 Difference]: With dead ends: 245 [2024-11-18 09:33:39,653 INFO L226 Difference]: Without dead ends: 179 [2024-11-18 09:33:39,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-18 09:33:39,654 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 17 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:39,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 649 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:33:39,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-18 09:33:39,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2024-11-18 09:33:39,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 140 states have (on average 1.3142857142857143) internal successors, (184), 143 states have internal predecessors, (184), 19 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (22), 20 states have call predecessors, (22), 18 states have call successors, (22) [2024-11-18 09:33:39,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 225 transitions. [2024-11-18 09:33:39,662 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 225 transitions. Word has length 50 [2024-11-18 09:33:39,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:39,662 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 225 transitions. [2024-11-18 09:33:39,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-18 09:33:39,663 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 225 transitions. [2024-11-18 09:33:39,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-18 09:33:39,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:39,664 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:39,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-18 09:33:39,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:39,867 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:39,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:39,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1060673824, now seen corresponding path program 1 times [2024-11-18 09:33:39,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:33:39,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259282682] [2024-11-18 09:33:39,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:39,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:39,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:33:39,870 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:33:39,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-18 09:33:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:33:39,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 09:33:39,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:33:39,944 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-18 09:33:39,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:33:39,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:33:39,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259282682] [2024-11-18 09:33:39,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259282682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:33:39,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:33:39,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 09:33:39,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842476742] [2024-11-18 09:33:39,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:33:39,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:33:39,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:33:39,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:33:39,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:33:39,946 INFO L87 Difference]: Start difference. First operand 166 states and 225 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:40,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:33:40,025 INFO L93 Difference]: Finished difference Result 213 states and 289 transitions. [2024-11-18 09:33:40,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 09:33:40,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2024-11-18 09:33:40,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:33:40,027 INFO L225 Difference]: With dead ends: 213 [2024-11-18 09:33:40,027 INFO L226 Difference]: Without dead ends: 171 [2024-11-18 09:33:40,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:33:40,028 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 48 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:33:40,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 331 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:33:40,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-18 09:33:40,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 166. [2024-11-18 09:33:40,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 140 states have (on average 1.3) internal successors, (182), 143 states have internal predecessors, (182), 19 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (22), 20 states have call predecessors, (22), 18 states have call successors, (22) [2024-11-18 09:33:40,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 223 transitions. [2024-11-18 09:33:40,037 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 223 transitions. Word has length 49 [2024-11-18 09:33:40,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:33:40,038 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 223 transitions. [2024-11-18 09:33:40,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 09:33:40,038 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 223 transitions. [2024-11-18 09:33:40,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-18 09:33:40,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:33:40,039 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:40,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-18 09:33:40,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:40,240 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:33:40,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:33:40,240 INFO L85 PathProgramCache]: Analyzing trace with hash 45509775, now seen corresponding path program 1 times [2024-11-18 09:33:40,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:33:40,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402861658] [2024-11-18 09:33:40,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:33:40,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:40,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:33:40,242 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:33:40,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-18 09:33:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 09:33:40,289 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 09:33:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 09:33:40,353 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-18 09:33:40,354 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 09:33:40,354 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 09:33:40,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-18 09:33:40,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:40,559 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:33:40,591 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 09:33:40,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:33:40 BoogieIcfgContainer [2024-11-18 09:33:40,597 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 09:33:40,598 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 09:33:40,598 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 09:33:40,598 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 09:33:40,599 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:33:33" (3/4) ... [2024-11-18 09:33:40,599 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-18 09:33:40,648 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 09:33:40,648 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 09:33:40,648 INFO L158 Benchmark]: Toolchain (without parser) took 8704.11ms. Allocated memory was 58.7MB in the beginning and 92.3MB in the end (delta: 33.6MB). Free memory was 32.6MB in the beginning and 27.8MB in the end (delta: 4.9MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. [2024-11-18 09:33:40,649 INFO L158 Benchmark]: CDTParser took 1.13ms. Allocated memory is still 44.0MB. Free memory is still 20.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 09:33:40,649 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.59ms. Allocated memory is still 58.7MB. Free memory was 32.5MB in the beginning and 32.2MB in the end (delta: 290.8kB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2024-11-18 09:33:40,649 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.68ms. Allocated memory is still 58.7MB. Free memory was 32.2MB in the beginning and 30.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 09:33:40,649 INFO L158 Benchmark]: Boogie Preprocessor took 72.12ms. Allocated memory is still 58.7MB. Free memory was 30.4MB in the beginning and 27.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 09:33:40,650 INFO L158 Benchmark]: RCFGBuilder took 577.87ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 27.8MB in the beginning and 41.9MB in the end (delta: -14.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-18 09:33:40,650 INFO L158 Benchmark]: TraceAbstraction took 7530.10ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 41.2MB in the beginning and 30.8MB in the end (delta: 10.5MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2024-11-18 09:33:40,650 INFO L158 Benchmark]: Witness Printer took 49.98ms. Allocated memory is still 92.3MB. Free memory was 30.8MB in the beginning and 27.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 09:33:40,652 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.13ms. Allocated memory is still 44.0MB. Free memory is still 20.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 413.59ms. Allocated memory is still 58.7MB. Free memory was 32.5MB in the beginning and 32.2MB in the end (delta: 290.8kB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.68ms. Allocated memory is still 58.7MB. Free memory was 32.2MB in the beginning and 30.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.12ms. Allocated memory is still 58.7MB. Free memory was 30.4MB in the beginning and 27.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 577.87ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 27.8MB in the beginning and 41.9MB in the end (delta: -14.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7530.10ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 41.2MB in the beginning and 30.8MB in the end (delta: 10.5MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * Witness Printer took 49.98ms. Allocated memory is still 92.3MB. Free memory was 30.8MB in the beginning and 27.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; [L251] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L251] RET, EXPR base2flt(0, 0) [L251] zero = base2flt(0, 0) [L252] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=16777216, __retres4=-2147483648] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=16777216, \result=-2147483648] [L252] RET, EXPR base2flt(ma, ea) VAL [ea=0, ma=16777216, zero=0] [L252] a = base2flt(ma, ea) [L253] 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); VAL [\old(e)=64, \old(m)=16777216, \result=-1073741824] [L253] RET, EXPR base2flt(mb, eb) VAL [a=-2147483648, ea=0, eb=64, ma=16777216, mb=16777216, zero=0] [L253] b = base2flt(mb, eb) [L255] COND FALSE !(a < zero) VAL [a=-2147483648, b=-1073741824, ea=0, eb=64, ma=16777216, mb=16777216, zero=0] [L258] COND TRUE a > zero [L259] tmp = 1 VAL [a=-2147483648, b=-1073741824, ea=0, eb=64, ma=16777216, mb=16777216, tmp=1, zero=0] [L263] sa = tmp VAL [a=-2147483648, b=-1073741824, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, zero=0] [L265] COND FALSE !(b < zero) VAL [a=-2147483648, b=-1073741824, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, zero=0] [L268] COND TRUE b > zero [L269] tmp___0 = 1 VAL [a=-2147483648, b=-1073741824, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, tmp___0=1] [L273] sb = tmp___0 VAL [a=-2147483648, b=-1073741824, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, sb=1] [L276] CALL addflt(a, b) [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [a=-2147483648, b=-1073741824] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [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 [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 [a=-1073741824, ea=64, eb=0, ma=16777216, mb=16777216] [L115] delta = ea - eb VAL [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 3 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 300 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 276 mSDsluCounter, 5953 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4591 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 825 IncrementalHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 1362 mSDtfsCounter, 825 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 803 GetRequests, 717 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=5, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 112 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 648 NumberOfCodeBlocks, 630 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 789 ConstructedInterpolants, 2 QuantifiedInterpolants, 1316 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1111 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 274/313 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-18 09:33:40,680 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE