./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/bitvector/byte_add_1-1.i --full-output --preprocessor.use.memory.slicer false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/bitvector/byte_add_1-1.i -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 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 21:13:49,026 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 21:13:49,102 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 21:13:49,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 21:13:49,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 21:13:49,132 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 21:13:49,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 21:13:49,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 21:13:49,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 21:13:49,133 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 21:13:49,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 21:13:49,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 21:13:49,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 21:13:49,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 21:13:49,135 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 21:13:49,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 21:13:49,135 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 21:13:49,135 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 21:13:49,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 21:13:49,136 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 21:13:49,136 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 21:13:49,136 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 21:13:49,136 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 21:13:49,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 21:13:49,137 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 21:13:49,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 21:13:49,137 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 21:13:49,137 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 21:13:49,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 21:13:49,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 21:13:49,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 21:13:49,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:13:49,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 21:13:49,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 21:13:49,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 21:13:49,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 21:13:49,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 21:13:49,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 21:13:49,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 21:13:49,139 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 21:13:49,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 21:13:49,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 21:13:49,140 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 -> 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-22 21:13:49,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 21:13:49,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 21:13:49,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 21:13:49,386 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 21:13:49,386 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 21:13:49,387 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/byte_add_1-1.i [2023-11-22 21:13:50,431 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 21:13:50,557 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 21:13:50,558 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_1-1.i [2023-11-22 21:13:50,567 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de23de8e2/963786d6a04d48098d5e8d1dbc339dfc/FLAG0c58cc7d4 [2023-11-22 21:13:50,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de23de8e2/963786d6a04d48098d5e8d1dbc339dfc [2023-11-22 21:13:50,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 21:13:50,583 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 21:13:50,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 21:13:50,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 21:13:50,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 21:13:50,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:13:50" (1/1) ... [2023-11-22 21:13:50,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f94630e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:50, skipping insertion in model container [2023-11-22 21:13:50,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:13:50" (1/1) ... [2023-11-22 21:13:50,613 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 21:13:50,739 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_1-1.i[1168,1181] [2023-11-22 21:13:50,814 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:13:50,823 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 21:13:50,836 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_1-1.i[1168,1181] [2023-11-22 21:13:50,869 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:13:50,882 INFO L206 MainTranslator]: Completed translation [2023-11-22 21:13:50,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:50 WrapperNode [2023-11-22 21:13:50,885 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 21:13:50,886 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 21:13:50,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 21:13:50,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 21:13:50,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:50" (1/1) ... [2023-11-22 21:13:50,910 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:50" (1/1) ... [2023-11-22 21:13:50,934 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 151 [2023-11-22 21:13:50,935 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 21:13:50,935 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 21:13:50,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 21:13:50,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 21:13:50,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:50" (1/1) ... [2023-11-22 21:13:50,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:50" (1/1) ... [2023-11-22 21:13:50,945 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:50" (1/1) ... [2023-11-22 21:13:50,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:50" (1/1) ... [2023-11-22 21:13:50,950 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:50" (1/1) ... [2023-11-22 21:13:50,958 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:50" (1/1) ... [2023-11-22 21:13:50,966 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:50" (1/1) ... [2023-11-22 21:13:50,975 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:50" (1/1) ... [2023-11-22 21:13:50,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 21:13:50,981 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 21:13:50,981 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 21:13:50,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 21:13:50,982 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:50" (1/1) ... [2023-11-22 21:13:50,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:13:51,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:13:51,058 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 21:13:51,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 21:13:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 21:13:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-22 21:13:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 21:13:51,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 21:13:51,166 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 21:13:51,168 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 21:13:51,497 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 21:13:51,515 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 21:13:51,515 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-22 21:13:51,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:13:51 BoogieIcfgContainer [2023-11-22 21:13:51,520 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 21:13:51,523 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 21:13:51,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 21:13:51,525 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 21:13:51,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:13:50" (1/3) ... [2023-11-22 21:13:51,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd1ca0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:13:51, skipping insertion in model container [2023-11-22 21:13:51,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:50" (2/3) ... [2023-11-22 21:13:51,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd1ca0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:13:51, skipping insertion in model container [2023-11-22 21:13:51,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:13:51" (3/3) ... [2023-11-22 21:13:51,529 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.i [2023-11-22 21:13:51,543 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 21:13:51,543 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 21:13:51,584 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 21:13:51,590 INFO L357 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, mHoare=true, 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;@35f2bf81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 21:13:51,591 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 21:13:51,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 42 states have (on average 1.880952380952381) internal successors, (79), 43 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:51,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-22 21:13:51,600 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:13:51,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:13:51,602 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:13:51,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:13:51,607 INFO L85 PathProgramCache]: Analyzing trace with hash -701051337, now seen corresponding path program 1 times [2023-11-22 21:13:51,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:13:51,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157559718] [2023-11-22 21:13:51,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:13:51,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:13:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:13:51,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:13:51,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:13:51,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157559718] [2023-11-22 21:13:51,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157559718] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:13:51,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:13:51,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 21:13:51,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759970500] [2023-11-22 21:13:51,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:13:51,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 21:13:51,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:13:51,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 21:13:51,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 21:13:51,815 INFO L87 Difference]: Start difference. First operand has 44 states, 42 states have (on average 1.880952380952381) internal successors, (79), 43 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:51,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:13:51,841 INFO L93 Difference]: Finished difference Result 62 states and 109 transitions. [2023-11-22 21:13:51,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 21:13:51,843 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-22 21:13:51,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:13:51,849 INFO L225 Difference]: With dead ends: 62 [2023-11-22 21:13:51,849 INFO L226 Difference]: Without dead ends: 42 [2023-11-22 21:13:51,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 21:13:51,853 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:13:51,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:13:51,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-22 21:13:51,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-11-22 21:13:51,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 41 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:51,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 74 transitions. [2023-11-22 21:13:51,896 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 74 transitions. Word has length 13 [2023-11-22 21:13:51,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:13:51,897 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 74 transitions. [2023-11-22 21:13:51,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:51,897 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 74 transitions. [2023-11-22 21:13:51,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-22 21:13:51,899 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:13:51,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:13:51,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 21:13:51,900 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:13:51,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:13:51,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1267888409, now seen corresponding path program 1 times [2023-11-22 21:13:51,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:13:51,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133881280] [2023-11-22 21:13:51,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:13:51,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:13:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:13:52,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:13:52,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:13:52,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133881280] [2023-11-22 21:13:52,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133881280] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:13:52,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:13:52,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:13:52,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856716774] [2023-11-22 21:13:52,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:13:52,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:13:52,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:13:52,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:13:52,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:13:52,082 INFO L87 Difference]: Start difference. First operand 42 states and 74 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:52,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:13:52,197 INFO L93 Difference]: Finished difference Result 98 states and 177 transitions. [2023-11-22 21:13:52,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:13:52,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-22 21:13:52,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:13:52,198 INFO L225 Difference]: With dead ends: 98 [2023-11-22 21:13:52,199 INFO L226 Difference]: Without dead ends: 65 [2023-11-22 21:13:52,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:13:52,200 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 24 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:13:52,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 76 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:13:52,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-22 21:13:52,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2023-11-22 21:13:52,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.596774193548387) internal successors, (99), 62 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:52,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 99 transitions. [2023-11-22 21:13:52,206 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 99 transitions. Word has length 13 [2023-11-22 21:13:52,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:13:52,207 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 99 transitions. [2023-11-22 21:13:52,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:52,207 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 99 transitions. [2023-11-22 21:13:52,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 21:13:52,208 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:13:52,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:13:52,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 21:13:52,208 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:13:52,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:13:52,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1612037902, now seen corresponding path program 1 times [2023-11-22 21:13:52,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:13:52,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069340951] [2023-11-22 21:13:52,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:13:52,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:13:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:13:52,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:13:52,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:13:52,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069340951] [2023-11-22 21:13:52,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069340951] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:13:52,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:13:52,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 21:13:52,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889618730] [2023-11-22 21:13:52,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:13:52,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:13:52,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:13:52,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:13:52,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:13:52,292 INFO L87 Difference]: Start difference. First operand 63 states and 99 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:52,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:13:52,437 INFO L93 Difference]: Finished difference Result 155 states and 270 transitions. [2023-11-22 21:13:52,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 21:13:52,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-22 21:13:52,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:13:52,439 INFO L225 Difference]: With dead ends: 155 [2023-11-22 21:13:52,439 INFO L226 Difference]: Without dead ends: 122 [2023-11-22 21:13:52,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:13:52,440 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 92 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:13:52,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 99 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:13:52,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-22 21:13:52,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 86. [2023-11-22 21:13:52,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.576470588235294) internal successors, (134), 85 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 134 transitions. [2023-11-22 21:13:52,448 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 134 transitions. Word has length 19 [2023-11-22 21:13:52,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:13:52,448 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 134 transitions. [2023-11-22 21:13:52,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:52,448 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 134 transitions. [2023-11-22 21:13:52,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-22 21:13:52,449 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:13:52,449 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:13:52,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 21:13:52,449 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:13:52,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:13:52,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1944328577, now seen corresponding path program 1 times [2023-11-22 21:13:52,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:13:52,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014254616] [2023-11-22 21:13:52,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:13:52,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:13:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:13:52,528 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-22 21:13:52,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:13:52,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014254616] [2023-11-22 21:13:52,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014254616] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:13:52,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:13:52,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 21:13:52,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789451134] [2023-11-22 21:13:52,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:13:52,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:13:52,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:13:52,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:13:52,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:13:52,531 INFO L87 Difference]: Start difference. First operand 86 states and 134 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:52,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:13:52,640 INFO L93 Difference]: Finished difference Result 247 states and 380 transitions. [2023-11-22 21:13:52,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:13:52,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-22 21:13:52,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:13:52,642 INFO L225 Difference]: With dead ends: 247 [2023-11-22 21:13:52,642 INFO L226 Difference]: Without dead ends: 173 [2023-11-22 21:13:52,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:13:52,643 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 94 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:13:52,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 198 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:13:52,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-11-22 21:13:52,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 94. [2023-11-22 21:13:52,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.5376344086021505) internal successors, (143), 93 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:52,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 143 transitions. [2023-11-22 21:13:52,683 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 143 transitions. Word has length 25 [2023-11-22 21:13:52,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:13:52,683 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 143 transitions. [2023-11-22 21:13:52,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:52,684 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 143 transitions. [2023-11-22 21:13:52,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-22 21:13:52,685 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:13:52,685 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:13:52,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 21:13:52,686 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:13:52,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:13:52,686 INFO L85 PathProgramCache]: Analyzing trace with hash 889628198, now seen corresponding path program 1 times [2023-11-22 21:13:52,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:13:52,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970083830] [2023-11-22 21:13:52,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:13:52,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:13:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:13:52,802 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-22 21:13:52,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:13:52,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970083830] [2023-11-22 21:13:52,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970083830] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:13:52,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:13:52,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:13:52,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858988398] [2023-11-22 21:13:52,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:13:52,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:13:52,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:13:52,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:13:52,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:13:52,804 INFO L87 Difference]: Start difference. First operand 94 states and 143 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:52,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:13:52,911 INFO L93 Difference]: Finished difference Result 268 states and 406 transitions. [2023-11-22 21:13:52,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:13:52,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-22 21:13:52,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:13:52,912 INFO L225 Difference]: With dead ends: 268 [2023-11-22 21:13:52,912 INFO L226 Difference]: Without dead ends: 193 [2023-11-22 21:13:52,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:13:52,914 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 98 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:13:52,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 206 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:13:52,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-11-22 21:13:52,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 104. [2023-11-22 21:13:52,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.5145631067961165) internal successors, (156), 103 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:52,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 156 transitions. [2023-11-22 21:13:52,933 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 156 transitions. Word has length 26 [2023-11-22 21:13:52,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:13:52,933 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 156 transitions. [2023-11-22 21:13:52,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:52,934 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 156 transitions. [2023-11-22 21:13:52,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-22 21:13:52,934 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:13:52,935 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:13:52,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 21:13:52,935 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:13:52,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:13:52,935 INFO L85 PathProgramCache]: Analyzing trace with hash -449843762, now seen corresponding path program 1 times [2023-11-22 21:13:52,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:13:52,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125837677] [2023-11-22 21:13:52,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:13:52,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:13:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:13:53,048 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:13:53,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:13:53,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125837677] [2023-11-22 21:13:53,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125837677] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:13:53,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871553547] [2023-11-22 21:13:53,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:13:53,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:13:53,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:13:53,068 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) [2023-11-22 21:13:53,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-22 21:13:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:13:53,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-22 21:13:53,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:13:53,228 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-22 21:13:53,228 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:13:53,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871553547] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:13:53,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:13:53,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2023-11-22 21:13:53,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646296471] [2023-11-22 21:13:53,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:13:53,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:13:53,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:13:53,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:13:53,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-22 21:13:53,231 INFO L87 Difference]: Start difference. First operand 104 states and 156 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:53,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:13:53,445 INFO L93 Difference]: Finished difference Result 425 states and 664 transitions. [2023-11-22 21:13:53,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:13:53,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-22 21:13:53,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:13:53,452 INFO L225 Difference]: With dead ends: 425 [2023-11-22 21:13:53,452 INFO L226 Difference]: Without dead ends: 336 [2023-11-22 21:13:53,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:13:53,458 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 205 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 21:13:53,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 374 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 21:13:53,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2023-11-22 21:13:53,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 184. [2023-11-22 21:13:53,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.4863387978142077) internal successors, (272), 183 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:53,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 272 transitions. [2023-11-22 21:13:53,475 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 272 transitions. Word has length 27 [2023-11-22 21:13:53,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:13:53,475 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 272 transitions. [2023-11-22 21:13:53,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:53,475 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 272 transitions. [2023-11-22 21:13:53,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-22 21:13:53,478 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:13:53,478 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:13:53,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-22 21:13:53,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-22 21:13:53,683 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:13:53,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:13:53,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1336537893, now seen corresponding path program 1 times [2023-11-22 21:13:53,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:13:53,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816810387] [2023-11-22 21:13:53,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:13:53,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:13:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:13:53,816 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:13:53,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:13:53,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816810387] [2023-11-22 21:13:53,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816810387] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:13:53,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561005422] [2023-11-22 21:13:53,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:13:53,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:13:53,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:13:53,818 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) [2023-11-22 21:13:53,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-22 21:13:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:13:53,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-22 21:13:53,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:13:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-22 21:13:53,901 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:13:53,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561005422] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:13:53,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:13:53,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2023-11-22 21:13:53,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438921336] [2023-11-22 21:13:53,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:13:53,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:13:53,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:13:53,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:13:53,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-22 21:13:53,903 INFO L87 Difference]: Start difference. First operand 184 states and 272 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:54,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:13:54,098 INFO L93 Difference]: Finished difference Result 734 states and 1113 transitions. [2023-11-22 21:13:54,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:13:54,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-22 21:13:54,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:13:54,100 INFO L225 Difference]: With dead ends: 734 [2023-11-22 21:13:54,100 INFO L226 Difference]: Without dead ends: 578 [2023-11-22 21:13:54,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:13:54,101 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 176 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 21:13:54,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 356 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 21:13:54,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2023-11-22 21:13:54,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 415. [2023-11-22 21:13:54,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 1.5120772946859904) internal successors, (626), 414 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:54,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 626 transitions. [2023-11-22 21:13:54,115 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 626 transitions. Word has length 28 [2023-11-22 21:13:54,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:13:54,115 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 626 transitions. [2023-11-22 21:13:54,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:54,116 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 626 transitions. [2023-11-22 21:13:54,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-22 21:13:54,116 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:13:54,117 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-22 21:13:54,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-22 21:13:54,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-22 21:13:54,328 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:13:54,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:13:54,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1045843213, now seen corresponding path program 1 times [2023-11-22 21:13:54,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:13:54,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173473758] [2023-11-22 21:13:54,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:13:54,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:13:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:13:54,384 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:13:54,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:13:54,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173473758] [2023-11-22 21:13:54,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173473758] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:13:54,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168787783] [2023-11-22 21:13:54,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:13:54,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:13:54,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:13:54,386 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) [2023-11-22 21:13:54,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-22 21:13:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:13:54,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 21:13:54,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:13:54,449 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 21:13:54,449 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:13:54,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168787783] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:13:54,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:13:54,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-11-22 21:13:54,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671675688] [2023-11-22 21:13:54,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:13:54,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:13:54,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:13:54,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:13:54,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:13:54,451 INFO L87 Difference]: Start difference. First operand 415 states and 626 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:54,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:13:54,581 INFO L93 Difference]: Finished difference Result 1053 states and 1666 transitions. [2023-11-22 21:13:54,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:13:54,582 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-22 21:13:54,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:13:54,583 INFO L225 Difference]: With dead ends: 1053 [2023-11-22 21:13:54,583 INFO L226 Difference]: Without dead ends: 616 [2023-11-22 21:13:54,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:13:54,585 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 37 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:13:54,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 134 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:13:54,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2023-11-22 21:13:54,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 535. [2023-11-22 21:13:54,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 1.3895131086142323) internal successors, (742), 534 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:54,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 742 transitions. [2023-11-22 21:13:54,596 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 742 transitions. Word has length 29 [2023-11-22 21:13:54,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:13:54,596 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 742 transitions. [2023-11-22 21:13:54,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:54,597 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 742 transitions. [2023-11-22 21:13:54,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-22 21:13:54,597 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:13:54,597 INFO L195 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] [2023-11-22 21:13:54,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-22 21:13:54,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:13:54,809 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:13:54,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:13:54,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1356275176, now seen corresponding path program 1 times [2023-11-22 21:13:54,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:13:54,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108419301] [2023-11-22 21:13:54,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:13:54,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:13:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:13:54,876 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:13:54,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:13:54,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108419301] [2023-11-22 21:13:54,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108419301] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:13:54,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477244779] [2023-11-22 21:13:54,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:13:54,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:13:54,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:13:54,878 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) [2023-11-22 21:13:54,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-22 21:13:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:13:54,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 21:13:54,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:13:54,999 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-22 21:13:54,999 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:13:54,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477244779] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:13:54,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:13:54,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-11-22 21:13:54,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252698612] [2023-11-22 21:13:55,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:13:55,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:13:55,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:13:55,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:13:55,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-22 21:13:55,001 INFO L87 Difference]: Start difference. First operand 535 states and 742 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:55,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:13:55,131 INFO L93 Difference]: Finished difference Result 1266 states and 1823 transitions. [2023-11-22 21:13:55,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:13:55,132 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-11-22 21:13:55,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:13:55,134 INFO L225 Difference]: With dead ends: 1266 [2023-11-22 21:13:55,134 INFO L226 Difference]: Without dead ends: 753 [2023-11-22 21:13:55,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-22 21:13:55,135 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 36 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:13:55,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 134 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:13:55,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2023-11-22 21:13:55,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 645. [2023-11-22 21:13:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.360248447204969) internal successors, (876), 644 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 876 transitions. [2023-11-22 21:13:55,147 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 876 transitions. Word has length 35 [2023-11-22 21:13:55,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:13:55,147 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 876 transitions. [2023-11-22 21:13:55,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 876 transitions. [2023-11-22 21:13:55,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-22 21:13:55,149 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:13:55,149 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-11-22 21:13:55,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-22 21:13:55,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:13:55,359 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:13:55,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:13:55,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1087520423, now seen corresponding path program 1 times [2023-11-22 21:13:55,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:13:55,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579779389] [2023-11-22 21:13:55,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:13:55,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:13:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:13:55,520 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-22 21:13:55,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:13:55,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579779389] [2023-11-22 21:13:55,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579779389] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:13:55,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:13:55,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:13:55,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993585845] [2023-11-22 21:13:55,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:13:55,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:13:55,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:13:55,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:13:55,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:13:55,522 INFO L87 Difference]: Start difference. First operand 645 states and 876 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:55,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:13:55,842 INFO L93 Difference]: Finished difference Result 1280 states and 1726 transitions. [2023-11-22 21:13:55,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 21:13:55,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-11-22 21:13:55,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:13:55,845 INFO L225 Difference]: With dead ends: 1280 [2023-11-22 21:13:55,845 INFO L226 Difference]: Without dead ends: 1046 [2023-11-22 21:13:55,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-22 21:13:55,846 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 284 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 21:13:55,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 621 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 21:13:55,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2023-11-22 21:13:55,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 661. [2023-11-22 21:13:55,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.353030303030303) internal successors, (893), 660 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 893 transitions. [2023-11-22 21:13:55,862 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 893 transitions. Word has length 41 [2023-11-22 21:13:55,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:13:55,862 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 893 transitions. [2023-11-22 21:13:55,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:55,863 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 893 transitions. [2023-11-22 21:13:55,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-22 21:13:55,863 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:13:55,863 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-11-22 21:13:55,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-22 21:13:55,864 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:13:55,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:13:55,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1156462875, now seen corresponding path program 1 times [2023-11-22 21:13:55,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:13:55,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054987420] [2023-11-22 21:13:55,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:13:55,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:13:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:13:55,947 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-22 21:13:55,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:13:55,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054987420] [2023-11-22 21:13:55,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054987420] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:13:55,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:13:55,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 21:13:55,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684675947] [2023-11-22 21:13:55,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:13:55,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:13:55,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:13:55,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:13:55,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:13:55,950 INFO L87 Difference]: Start difference. First operand 661 states and 893 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:55,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:13:55,963 INFO L93 Difference]: Finished difference Result 1009 states and 1353 transitions. [2023-11-22 21:13:55,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:13:55,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-11-22 21:13:55,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:13:55,965 INFO L225 Difference]: With dead ends: 1009 [2023-11-22 21:13:55,965 INFO L226 Difference]: Without dead ends: 350 [2023-11-22 21:13:55,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:13:55,966 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 65 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 67 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 [2023-11-22 21:13:55,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 67 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:13:55,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2023-11-22 21:13:55,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2023-11-22 21:13:55,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 1.32378223495702) internal successors, (462), 349 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:55,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 462 transitions. [2023-11-22 21:13:55,977 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 462 transitions. Word has length 41 [2023-11-22 21:13:55,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:13:55,977 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 462 transitions. [2023-11-22 21:13:55,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:55,977 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 462 transitions. [2023-11-22 21:13:55,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-22 21:13:55,978 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:13:55,978 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2023-11-22 21:13:55,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-22 21:13:55,978 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:13:55,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:13:55,979 INFO L85 PathProgramCache]: Analyzing trace with hash -160686071, now seen corresponding path program 1 times [2023-11-22 21:13:55,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:13:55,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808831125] [2023-11-22 21:13:55,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:13:55,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:13:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:13:56,054 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 21:13:56,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:13:56,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808831125] [2023-11-22 21:13:56,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808831125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:13:56,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:13:56,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:13:56,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681568759] [2023-11-22 21:13:56,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:13:56,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:13:56,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:13:56,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:13:56,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:13:56,057 INFO L87 Difference]: Start difference. First operand 350 states and 462 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:56,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:13:56,187 INFO L93 Difference]: Finished difference Result 756 states and 994 transitions. [2023-11-22 21:13:56,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 21:13:56,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2023-11-22 21:13:56,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:13:56,189 INFO L225 Difference]: With dead ends: 756 [2023-11-22 21:13:56,189 INFO L226 Difference]: Without dead ends: 427 [2023-11-22 21:13:56,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:13:56,190 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 78 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:13:56,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 98 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:13:56,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2023-11-22 21:13:56,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 343. [2023-11-22 21:13:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 1.3157894736842106) internal successors, (450), 342 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:56,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 450 transitions. [2023-11-22 21:13:56,200 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 450 transitions. Word has length 52 [2023-11-22 21:13:56,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:13:56,200 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 450 transitions. [2023-11-22 21:13:56,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:56,201 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 450 transitions. [2023-11-22 21:13:56,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-22 21:13:56,201 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:13:56,201 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2023-11-22 21:13:56,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-22 21:13:56,202 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:13:56,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:13:56,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1041096760, now seen corresponding path program 1 times [2023-11-22 21:13:56,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:13:56,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765209271] [2023-11-22 21:13:56,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:13:56,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:13:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:13:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-22 21:13:56,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:13:56,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765209271] [2023-11-22 21:13:56,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765209271] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:13:56,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:13:56,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:13:56,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586676206] [2023-11-22 21:13:56,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:13:56,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:13:56,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:13:56,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:13:56,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:13:56,251 INFO L87 Difference]: Start difference. First operand 343 states and 450 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:56,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:13:56,266 INFO L93 Difference]: Finished difference Result 476 states and 612 transitions. [2023-11-22 21:13:56,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:13:56,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2023-11-22 21:13:56,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:13:56,268 INFO L225 Difference]: With dead ends: 476 [2023-11-22 21:13:56,268 INFO L226 Difference]: Without dead ends: 439 [2023-11-22 21:13:56,268 INFO L412 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 [2023-11-22 21:13:56,269 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 4 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:13:56,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 130 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:13:56,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2023-11-22 21:13:56,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 400. [2023-11-22 21:13:56,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 1.300751879699248) internal successors, (519), 399 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:56,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 519 transitions. [2023-11-22 21:13:56,296 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 519 transitions. Word has length 60 [2023-11-22 21:13:56,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:13:56,296 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 519 transitions. [2023-11-22 21:13:56,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:56,296 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 519 transitions. [2023-11-22 21:13:56,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-22 21:13:56,297 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:13:56,297 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:13:56,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-22 21:13:56,297 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:13:56,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:13:56,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1858745210, now seen corresponding path program 1 times [2023-11-22 21:13:56,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:13:56,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763102472] [2023-11-22 21:13:56,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:13:56,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:13:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:13:56,480 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:13:56,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:13:56,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763102472] [2023-11-22 21:13:56,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763102472] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:13:56,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232619584] [2023-11-22 21:13:56,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:13:56,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:13:56,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:13:56,482 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) [2023-11-22 21:13:56,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-22 21:13:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:13:56,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-22 21:13:56,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:13:56,574 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-11-22 21:13:56,574 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:13:56,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232619584] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:13:56,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:13:56,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2023-11-22 21:13:56,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690223858] [2023-11-22 21:13:56,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:13:56,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:13:56,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:13:56,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:13:56,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-11-22 21:13:56,576 INFO L87 Difference]: Start difference. First operand 400 states and 519 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:56,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:13:56,629 INFO L93 Difference]: Finished difference Result 824 states and 1067 transitions. [2023-11-22 21:13:56,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:13:56,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2023-11-22 21:13:56,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:13:56,630 INFO L225 Difference]: With dead ends: 824 [2023-11-22 21:13:56,630 INFO L226 Difference]: Without dead ends: 407 [2023-11-22 21:13:56,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-22 21:13:56,631 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 54 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:13:56,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 67 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:13:56,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-11-22 21:13:56,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 371. [2023-11-22 21:13:56,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 370 states have (on average 1.2864864864864864) internal successors, (476), 370 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:56,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 476 transitions. [2023-11-22 21:13:56,641 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 476 transitions. Word has length 60 [2023-11-22 21:13:56,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:13:56,641 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 476 transitions. [2023-11-22 21:13:56,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:56,642 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 476 transitions. [2023-11-22 21:13:56,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-22 21:13:56,642 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:13:56,642 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2023-11-22 21:13:56,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-22 21:13:56,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-22 21:13:56,853 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:13:56,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:13:56,854 INFO L85 PathProgramCache]: Analyzing trace with hash 315293426, now seen corresponding path program 1 times [2023-11-22 21:13:56,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:13:56,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859441705] [2023-11-22 21:13:56,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:13:56,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:13:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:13:57,066 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-11-22 21:13:57,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:13:57,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859441705] [2023-11-22 21:13:57,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859441705] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:13:57,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:13:57,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 21:13:57,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503079391] [2023-11-22 21:13:57,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:13:57,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:13:57,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:13:57,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:13:57,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:13:57,068 INFO L87 Difference]: Start difference. First operand 371 states and 476 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:57,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:13:57,135 INFO L93 Difference]: Finished difference Result 1131 states and 1440 transitions. [2023-11-22 21:13:57,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 21:13:57,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2023-11-22 21:13:57,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:13:57,137 INFO L225 Difference]: With dead ends: 1131 [2023-11-22 21:13:57,137 INFO L226 Difference]: Without dead ends: 786 [2023-11-22 21:13:57,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-22 21:13:57,138 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 157 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:13:57,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 173 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:13:57,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2023-11-22 21:13:57,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 557. [2023-11-22 21:13:57,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 556 states have (on average 1.276978417266187) internal successors, (710), 556 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:57,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 710 transitions. [2023-11-22 21:13:57,153 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 710 transitions. Word has length 67 [2023-11-22 21:13:57,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:13:57,153 INFO L495 AbstractCegarLoop]: Abstraction has 557 states and 710 transitions. [2023-11-22 21:13:57,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:57,153 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 710 transitions. [2023-11-22 21:13:57,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-22 21:13:57,154 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:13:57,154 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2023-11-22 21:13:57,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-22 21:13:57,154 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:13:57,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:13:57,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1310614836, now seen corresponding path program 1 times [2023-11-22 21:13:57,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:13:57,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734734609] [2023-11-22 21:13:57,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:13:57,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:13:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:13:57,428 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 21:13:57,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:13:57,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734734609] [2023-11-22 21:13:57,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734734609] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:13:57,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986565053] [2023-11-22 21:13:57,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:13:57,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:13:57,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:13:57,430 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) [2023-11-22 21:13:57,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-22 21:13:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:13:57,536 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-22 21:13:57,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:13:57,591 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-22 21:13:57,592 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:13:57,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986565053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:13:57,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:13:57,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2023-11-22 21:13:57,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050494563] [2023-11-22 21:13:57,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:13:57,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 21:13:57,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:13:57,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 21:13:57,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-11-22 21:13:57,593 INFO L87 Difference]: Start difference. First operand 557 states and 710 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:57,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:13:57,749 INFO L93 Difference]: Finished difference Result 947 states and 1225 transitions. [2023-11-22 21:13:57,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:13:57,749 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2023-11-22 21:13:57,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:13:57,751 INFO L225 Difference]: With dead ends: 947 [2023-11-22 21:13:57,751 INFO L226 Difference]: Without dead ends: 749 [2023-11-22 21:13:57,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-11-22 21:13:57,752 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 191 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:13:57,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 706 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:13:57,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2023-11-22 21:13:57,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 707. [2023-11-22 21:13:57,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 706 states have (on average 1.2691218130311614) internal successors, (896), 706 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:57,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 896 transitions. [2023-11-22 21:13:57,770 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 896 transitions. Word has length 67 [2023-11-22 21:13:57,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:13:57,770 INFO L495 AbstractCegarLoop]: Abstraction has 707 states and 896 transitions. [2023-11-22 21:13:57,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:57,770 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 896 transitions. [2023-11-22 21:13:57,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-22 21:13:57,771 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:13:57,771 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2023-11-22 21:13:57,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-22 21:13:57,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-22 21:13:57,977 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:13:57,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:13:57,978 INFO L85 PathProgramCache]: Analyzing trace with hash -667674692, now seen corresponding path program 1 times [2023-11-22 21:13:57,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:13:57,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129170055] [2023-11-22 21:13:57,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:13:57,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:13:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:13:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-22 21:13:58,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:13:58,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129170055] [2023-11-22 21:13:58,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129170055] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:13:58,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222952430] [2023-11-22 21:13:58,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:13:58,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:13:58,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:13:58,119 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) [2023-11-22 21:13:58,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-22 21:13:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:13:58,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-22 21:13:58,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:13:58,294 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-22 21:13:58,294 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:13:58,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222952430] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:13:58,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:13:58,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2023-11-22 21:13:58,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528993119] [2023-11-22 21:13:58,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:13:58,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:13:58,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:13:58,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:13:58,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-11-22 21:13:58,296 INFO L87 Difference]: Start difference. First operand 707 states and 896 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:58,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:13:58,443 INFO L93 Difference]: Finished difference Result 959 states and 1236 transitions. [2023-11-22 21:13:58,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 21:13:58,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2023-11-22 21:13:58,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:13:58,446 INFO L225 Difference]: With dead ends: 959 [2023-11-22 21:13:58,446 INFO L226 Difference]: Without dead ends: 759 [2023-11-22 21:13:58,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-11-22 21:13:58,447 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 137 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:13:58,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 485 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:13:58,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2023-11-22 21:13:58,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 696. [2023-11-22 21:13:58,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 695 states have (on average 1.264748201438849) internal successors, (879), 695 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:58,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 879 transitions. [2023-11-22 21:13:58,464 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 879 transitions. Word has length 71 [2023-11-22 21:13:58,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:13:58,465 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 879 transitions. [2023-11-22 21:13:58,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:58,465 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 879 transitions. [2023-11-22 21:13:58,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-22 21:13:58,466 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:13:58,466 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2023-11-22 21:13:58,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-22 21:13:58,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:13:58,672 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:13:58,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:13:58,673 INFO L85 PathProgramCache]: Analyzing trace with hash 64292734, now seen corresponding path program 1 times [2023-11-22 21:13:58,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:13:58,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83817288] [2023-11-22 21:13:58,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:13:58,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:13:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:13:58,922 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-22 21:13:58,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:13:58,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83817288] [2023-11-22 21:13:58,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83817288] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:13:58,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004386512] [2023-11-22 21:13:58,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:13:58,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:13:58,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:13:58,924 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) [2023-11-22 21:13:58,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-22 21:13:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:13:59,427 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-22 21:13:59,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:13:59,509 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-22 21:13:59,509 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:13:59,591 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 21 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-22 21:13:59,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004386512] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:13:59,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 21:13:59,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-22 21:13:59,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843158620] [2023-11-22 21:13:59,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 21:13:59,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-22 21:13:59,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:13:59,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-22 21:13:59,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-11-22 21:13:59,594 INFO L87 Difference]: Start difference. First operand 696 states and 879 transitions. Second operand has 12 states, 12 states have (on average 9.666666666666666) internal successors, (116), 11 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:59,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:13:59,814 INFO L93 Difference]: Finished difference Result 1457 states and 1808 transitions. [2023-11-22 21:13:59,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 21:13:59,815 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.666666666666666) internal successors, (116), 11 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2023-11-22 21:13:59,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:13:59,818 INFO L225 Difference]: With dead ends: 1457 [2023-11-22 21:13:59,818 INFO L226 Difference]: Without dead ends: 783 [2023-11-22 21:13:59,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2023-11-22 21:13:59,819 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 230 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:13:59,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 540 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:13:59,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2023-11-22 21:13:59,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 537. [2023-11-22 21:13:59,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.242537313432836) internal successors, (666), 536 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:59,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 666 transitions. [2023-11-22 21:13:59,841 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 666 transitions. Word has length 71 [2023-11-22 21:13:59,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:13:59,841 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 666 transitions. [2023-11-22 21:13:59,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.666666666666666) internal successors, (116), 11 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:13:59,842 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 666 transitions. [2023-11-22 21:13:59,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-22 21:13:59,842 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:13:59,843 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:13:59,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-22 21:14:00,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-22 21:14:00,048 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:14:00,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:14:00,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1987520768, now seen corresponding path program 2 times [2023-11-22 21:14:00,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:14:00,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987706742] [2023-11-22 21:14:00,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:14:00,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:14:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:14:00,458 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 15 proven. 56 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-22 21:14:00,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:14:00,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987706742] [2023-11-22 21:14:00,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987706742] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:14:00,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147659838] [2023-11-22 21:14:00,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 21:14:00,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:14:00,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:14:00,460 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) [2023-11-22 21:14:00,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-22 21:14:00,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 21:14:00,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 21:14:00,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-22 21:14:00,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:14:00,800 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 32 proven. 34 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-22 21:14:00,800 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:14:01,249 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 22 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-22 21:14:01,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147659838] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:14:01,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 21:14:01,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2023-11-22 21:14:01,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044171406] [2023-11-22 21:14:01,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 21:14:01,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-22 21:14:01,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:14:01,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-22 21:14:01,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2023-11-22 21:14:01,253 INFO L87 Difference]: Start difference. First operand 537 states and 666 transitions. Second operand has 21 states, 21 states have (on average 8.0) internal successors, (168), 21 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:04,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:14:04,477 INFO L93 Difference]: Finished difference Result 2304 states and 2784 transitions. [2023-11-22 21:14:04,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-11-22 21:14:04,478 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.0) internal successors, (168), 21 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2023-11-22 21:14:04,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:14:04,484 INFO L225 Difference]: With dead ends: 2304 [2023-11-22 21:14:04,484 INFO L226 Difference]: Without dead ends: 2298 [2023-11-22 21:14:04,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=907, Invalid=4063, Unknown=0, NotChecked=0, Total=4970 [2023-11-22 21:14:04,486 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 437 mSDsluCounter, 2329 mSDsCounter, 0 mSdLazyCounter, 1533 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 2579 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:14:04,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 2579 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1533 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-22 21:14:04,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2023-11-22 21:14:04,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 816. [2023-11-22 21:14:04,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 815 states have (on average 1.2650306748466258) internal successors, (1031), 815 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1031 transitions. [2023-11-22 21:14:04,525 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1031 transitions. Word has length 71 [2023-11-22 21:14:04,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:14:04,525 INFO L495 AbstractCegarLoop]: Abstraction has 816 states and 1031 transitions. [2023-11-22 21:14:04,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.0) internal successors, (168), 21 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:04,526 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1031 transitions. [2023-11-22 21:14:04,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-22 21:14:04,526 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:14:04,527 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2023-11-22 21:14:04,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-22 21:14:04,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:14:04,731 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:14:04,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:14:04,732 INFO L85 PathProgramCache]: Analyzing trace with hash 615713470, now seen corresponding path program 3 times [2023-11-22 21:14:04,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:14:04,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570694831] [2023-11-22 21:14:04,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:14:04,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:14:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:14:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 4 proven. 57 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-22 21:14:05,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:14:05,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570694831] [2023-11-22 21:14:05,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570694831] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:14:05,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374024324] [2023-11-22 21:14:05,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-22 21:14:05,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:14:05,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:14:05,073 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) [2023-11-22 21:14:05,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-22 21:14:05,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-22 21:14:05,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 21:14:05,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-22 21:14:05,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:14:05,475 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-22 21:14:05,475 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:14:05,925 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-22 21:14:05,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374024324] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:14:05,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 21:14:05,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2023-11-22 21:14:05,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788313974] [2023-11-22 21:14:05,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 21:14:05,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-22 21:14:05,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:14:05,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-22 21:14:05,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2023-11-22 21:14:05,927 INFO L87 Difference]: Start difference. First operand 816 states and 1031 transitions. Second operand has 20 states, 20 states have (on average 7.55) internal successors, (151), 20 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:08,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:14:08,828 INFO L93 Difference]: Finished difference Result 3075 states and 3869 transitions. [2023-11-22 21:14:08,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-11-22 21:14:08,829 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.55) internal successors, (151), 20 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2023-11-22 21:14:08,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:14:08,863 INFO L225 Difference]: With dead ends: 3075 [2023-11-22 21:14:08,863 INFO L226 Difference]: Without dead ends: 2911 [2023-11-22 21:14:08,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=916, Invalid=3506, Unknown=0, NotChecked=0, Total=4422 [2023-11-22 21:14:08,870 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 513 mSDsluCounter, 1917 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 2170 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-22 21:14:08,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 2170 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-22 21:14:08,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2023-11-22 21:14:08,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 1248. [2023-11-22 21:14:08,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1247 states have (on average 1.280673616680032) internal successors, (1597), 1247 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:08,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1597 transitions. [2023-11-22 21:14:08,954 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1597 transitions. Word has length 71 [2023-11-22 21:14:08,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:14:08,954 INFO L495 AbstractCegarLoop]: Abstraction has 1248 states and 1597 transitions. [2023-11-22 21:14:08,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.55) internal successors, (151), 20 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:08,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1597 transitions. [2023-11-22 21:14:08,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-22 21:14:08,956 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:14:08,956 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2023-11-22 21:14:08,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-22 21:14:09,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:14:09,161 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:14:09,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:14:09,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1059614144, now seen corresponding path program 1 times [2023-11-22 21:14:09,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:14:09,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942984076] [2023-11-22 21:14:09,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:14:09,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:14:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:14:09,483 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 21:14:09,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:14:09,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942984076] [2023-11-22 21:14:09,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942984076] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:14:09,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153461749] [2023-11-22 21:14:09,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:14:09,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:14:09,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:14:09,485 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) [2023-11-22 21:14:09,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-22 21:14:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:14:09,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-22 21:14:09,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:14:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 1 proven. 60 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-22 21:14:09,787 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:14:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-22 21:14:09,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153461749] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:14:09,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 21:14:09,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-11-22 21:14:09,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212800172] [2023-11-22 21:14:09,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 21:14:09,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-22 21:14:09,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:14:09,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-22 21:14:09,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2023-11-22 21:14:09,970 INFO L87 Difference]: Start difference. First operand 1248 states and 1597 transitions. Second operand has 20 states, 20 states have (on average 9.05) internal successors, (181), 19 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:11,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:14:11,974 INFO L93 Difference]: Finished difference Result 2440 states and 3056 transitions. [2023-11-22 21:14:11,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-11-22 21:14:11,975 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 9.05) internal successors, (181), 19 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2023-11-22 21:14:11,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:14:11,980 INFO L225 Difference]: With dead ends: 2440 [2023-11-22 21:14:11,980 INFO L226 Difference]: Without dead ends: 2432 [2023-11-22 21:14:11,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1618 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1339, Invalid=4667, Unknown=0, NotChecked=0, Total=6006 [2023-11-22 21:14:11,982 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 627 mSDsluCounter, 1795 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 2003 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-22 21:14:11,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 2003 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-22 21:14:11,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2023-11-22 21:14:12,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 1336. [2023-11-22 21:14:12,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 1335 states have (on average 1.29063670411985) internal successors, (1723), 1335 states have internal predecessors, (1723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:12,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1723 transitions. [2023-11-22 21:14:12,087 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1723 transitions. Word has length 71 [2023-11-22 21:14:12,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:14:12,088 INFO L495 AbstractCegarLoop]: Abstraction has 1336 states and 1723 transitions. [2023-11-22 21:14:12,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.05) internal successors, (181), 19 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:12,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1723 transitions. [2023-11-22 21:14:12,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-22 21:14:12,089 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:14:12,089 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2023-11-22 21:14:12,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-22 21:14:12,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-22 21:14:12,296 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:14:12,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:14:12,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1960049728, now seen corresponding path program 1 times [2023-11-22 21:14:12,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:14:12,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755805835] [2023-11-22 21:14:12,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:14:12,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:14:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:14:12,846 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 28 proven. 53 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 21:14:12,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:14:12,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755805835] [2023-11-22 21:14:12,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755805835] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:14:12,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873192801] [2023-11-22 21:14:12,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:14:12,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:14:12,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:14:12,862 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) [2023-11-22 21:14:12,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-22 21:14:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:14:13,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-22 21:14:13,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:14:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-11-22 21:14:13,140 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:14:13,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873192801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:14:13,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:14:13,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 15 [2023-11-22 21:14:13,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249488153] [2023-11-22 21:14:13,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:14:13,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:14:13,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:14:13,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:14:13,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-11-22 21:14:13,143 INFO L87 Difference]: Start difference. First operand 1336 states and 1723 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:13,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:14:13,247 INFO L93 Difference]: Finished difference Result 1353 states and 1746 transitions. [2023-11-22 21:14:13,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:14:13,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2023-11-22 21:14:13,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:14:13,251 INFO L225 Difference]: With dead ends: 1353 [2023-11-22 21:14:13,252 INFO L226 Difference]: Without dead ends: 1349 [2023-11-22 21:14:13,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2023-11-22 21:14:13,253 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 150 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 [2023-11-22 21:14:13,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 150 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:14:13,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2023-11-22 21:14:13,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1342. [2023-11-22 21:14:13,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 1341 states have (on average 1.2915734526472782) internal successors, (1732), 1341 states have internal predecessors, (1732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:13,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1732 transitions. [2023-11-22 21:14:13,325 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1732 transitions. Word has length 72 [2023-11-22 21:14:13,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:14:13,325 INFO L495 AbstractCegarLoop]: Abstraction has 1342 states and 1732 transitions. [2023-11-22 21:14:13,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:13,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1732 transitions. [2023-11-22 21:14:13,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-22 21:14:13,327 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:14:13,327 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2023-11-22 21:14:13,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-22 21:14:13,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-22 21:14:13,534 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:14:13,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:14:13,535 INFO L85 PathProgramCache]: Analyzing trace with hash 633232545, now seen corresponding path program 1 times [2023-11-22 21:14:13,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:14:13,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839859983] [2023-11-22 21:14:13,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:14:13,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:14:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:14:13,687 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 37 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 21:14:13,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:14:13,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839859983] [2023-11-22 21:14:13,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839859983] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:14:13,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656753266] [2023-11-22 21:14:13,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:14:13,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:14:13,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:14:13,689 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) [2023-11-22 21:14:13,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-22 21:14:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:14:14,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-22 21:14:14,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:14:15,080 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 37 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 21:14:15,081 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:14:15,203 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 21:14:15,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656753266] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:14:15,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 21:14:15,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 14 [2023-11-22 21:14:15,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475616259] [2023-11-22 21:14:15,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 21:14:15,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-22 21:14:15,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:14:15,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-22 21:14:15,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-11-22 21:14:15,206 INFO L87 Difference]: Start difference. First operand 1342 states and 1732 transitions. Second operand has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 14 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:15,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:14:15,924 INFO L93 Difference]: Finished difference Result 4300 states and 5373 transitions. [2023-11-22 21:14:15,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-22 21:14:15,925 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 14 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2023-11-22 21:14:15,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:14:15,934 INFO L225 Difference]: With dead ends: 4300 [2023-11-22 21:14:15,934 INFO L226 Difference]: Without dead ends: 4296 [2023-11-22 21:14:15,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 136 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=313, Invalid=809, Unknown=0, NotChecked=0, Total=1122 [2023-11-22 21:14:15,935 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 604 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 21:14:15,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 904 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 21:14:15,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2023-11-22 21:14:16,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 1979. [2023-11-22 21:14:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1979 states, 1978 states have (on average 1.366026289180991) internal successors, (2702), 1978 states have internal predecessors, (2702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1979 states and 2702 transitions. [2023-11-22 21:14:16,027 INFO L78 Accepts]: Start accepts. Automaton has 1979 states and 2702 transitions. Word has length 73 [2023-11-22 21:14:16,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:14:16,028 INFO L495 AbstractCegarLoop]: Abstraction has 1979 states and 2702 transitions. [2023-11-22 21:14:16,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 14 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:16,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 2702 transitions. [2023-11-22 21:14:16,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-22 21:14:16,030 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:14:16,030 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2023-11-22 21:14:16,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-22 21:14:16,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-22 21:14:16,235 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:14:16,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:14:16,236 INFO L85 PathProgramCache]: Analyzing trace with hash 633292127, now seen corresponding path program 1 times [2023-11-22 21:14:16,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:14:16,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113593110] [2023-11-22 21:14:16,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:14:16,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:14:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 21:14:16,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-22 21:14:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 21:14:16,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-22 21:14:16,360 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-22 21:14:16,361 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-22 21:14:16,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-22 21:14:16,368 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:14:16,371 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 21:14:16,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-22 21:14:16,425 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-22 21:14:16,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-22 21:14:16,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-22 21:14:16,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-22 21:14:16,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated [2023-11-22 21:14:16,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:14:16 BoogieIcfgContainer [2023-11-22 21:14:16,443 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 21:14:16,444 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 21:14:16,444 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 21:14:16,444 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 21:14:16,444 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:13:51" (3/4) ... [2023-11-22 21:14:16,446 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-22 21:14:16,447 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 21:14:16,447 INFO L158 Benchmark]: Toolchain (without parser) took 25864.26ms. Allocated memory was 163.6MB in the beginning and 474.0MB in the end (delta: 310.4MB). Free memory was 94.3MB in the beginning and 242.6MB in the end (delta: -148.3MB). Peak memory consumption was 163.7MB. Max. memory is 16.1GB. [2023-11-22 21:14:16,448 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 111.1MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 21:14:16,448 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.81ms. Allocated memory is still 163.6MB. Free memory was 94.1MB in the beginning and 132.9MB in the end (delta: -38.8MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2023-11-22 21:14:16,448 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.59ms. Allocated memory is still 163.6MB. Free memory was 132.9MB in the beginning and 130.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 21:14:16,449 INFO L158 Benchmark]: Boogie Preprocessor took 42.23ms. Allocated memory is still 163.6MB. Free memory was 130.2MB in the beginning and 128.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 21:14:16,449 INFO L158 Benchmark]: RCFGBuilder took 539.85ms. Allocated memory is still 163.6MB. Free memory was 128.1MB in the beginning and 106.2MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-22 21:14:16,449 INFO L158 Benchmark]: TraceAbstraction took 24920.43ms. Allocated memory was 163.6MB in the beginning and 474.0MB in the end (delta: 310.4MB). Free memory was 105.6MB in the beginning and 242.6MB in the end (delta: -137.0MB). Peak memory consumption was 172.4MB. Max. memory is 16.1GB. [2023-11-22 21:14:16,451 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 474.0MB. Free memory is still 242.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 21:14:16,459 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 111.1MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.81ms. Allocated memory is still 163.6MB. Free memory was 94.1MB in the beginning and 132.9MB in the end (delta: -38.8MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.59ms. Allocated memory is still 163.6MB. Free memory was 132.9MB in the beginning and 130.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.23ms. Allocated memory is still 163.6MB. Free memory was 130.2MB in the beginning and 128.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 539.85ms. Allocated memory is still 163.6MB. Free memory was 128.1MB in the beginning and 106.2MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 24920.43ms. Allocated memory was 163.6MB in the beginning and 474.0MB in the end (delta: 310.4MB). Free memory was 105.6MB in the beginning and 242.6MB in the end (delta: -137.0MB). Peak memory consumption was 172.4MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 474.0MB. Free memory is still 242.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 25]: 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 116. Possible FailurePath: [L124] unsigned int a, b, r; [L126] b = __VERIFIER_nondet_uint() [L128] a = 234770789 [L130] CALL, EXPR mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, na=4, nb=4] [L69] COND TRUE b3 == (unsigned char)0 [L70] nb = nb - 1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, na=4, nb=3] [L71] COND TRUE b2 == (unsigned char)0 [L72] nb = nb - 1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, na=4, nb=2] [L73] COND TRUE b1 == (unsigned char)0 [L74] nb = nb - 1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, na=4, nb=1] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=101] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=101] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=101] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=256] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=256] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=256] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=256] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=1, i=0, na=4, nb=1, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=1, i=1, na=4, nb=1, partial_sum=0, r0=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=0] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=0] [L85] COND TRUE i == (unsigned char)1 [L85] partial_sum = partial_sum + a1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L89] COND FALSE !(i < nb) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L86] COND TRUE i == (unsigned char)2 [L86] partial_sum = partial_sum + a2 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L89] COND FALSE !(i < nb) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82, r2=254] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=254, r0=0, r1=82, r2=254] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L87] COND TRUE i == (unsigned char)3 [L87] partial_sum = partial_sum + a3 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L89] COND FALSE !(i < nb) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) | (r2 << 16U) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; [L130] RET, EXPR mp_add(a, b) [L130] r = mp_add(a, b) [L132] CALL __VERIFIER_assert(r == a + b) [L24] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L25] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.8s, OverallIterations: 24, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4156 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4156 mSDsluCounter, 12343 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9785 mSDsCounter, 302 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7201 IncrementalHoareTripleChecker+Invalid, 7503 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 302 mSolverCounterUnsat, 2558 mSDtfsCounter, 7201 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1479 GetRequests, 1113 SyntacticMatches, 10 SemanticMatches, 356 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4332 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1979occurred in iteration=23, InterpolantAutomatonStates: 288, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 8399 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 1922 NumberOfCodeBlocks, 1922 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2165 ConstructedInterpolants, 2 QuantifiedInterpolants, 15510 SizeOfPredicates, 44 NumberOfNonLiveVariables, 2225 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 41 InterpolantComputations, 18 PerfectInterpolantSequences, 1372/2161 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 [2023-11-22 21:14:16,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/bitvector/byte_add_1-1.i -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 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 21:14:18,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 21:14:18,654 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-22 21:14:18,663 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 21:14:18,663 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 21:14:18,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 21:14:18,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 21:14:18,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 21:14:18,703 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 21:14:18,703 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 21:14:18,704 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 21:14:18,704 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 21:14:18,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 21:14:18,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 21:14:18,706 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 21:14:18,706 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 21:14:18,706 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 21:14:18,709 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 21:14:18,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 21:14:18,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 21:14:18,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 21:14:18,711 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 21:14:18,711 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 21:14:18,711 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 21:14:18,711 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-22 21:14:18,712 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-22 21:14:18,712 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 21:14:18,712 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 21:14:18,712 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 21:14:18,712 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 21:14:18,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 21:14:18,714 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 21:14:18,714 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 21:14:18,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:14:18,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 21:14:18,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 21:14:18,715 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 21:14:18,715 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-22 21:14:18,715 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-22 21:14:18,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 21:14:18,715 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 21:14:18,716 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 21:14:18,716 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 21:14:18,716 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 21:14:18,716 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-22 21:14:18,716 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 -> 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-22 21:14:18,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 21:14:19,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 21:14:19,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 21:14:19,007 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 21:14:19,007 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 21:14:19,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/byte_add_1-1.i [2023-11-22 21:14:20,148 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 21:14:20,334 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 21:14:20,335 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_1-1.i [2023-11-22 21:14:20,348 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edeace107/c708c0e339414834bdc493e720165525/FLAGfa184dc69 [2023-11-22 21:14:20,360 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edeace107/c708c0e339414834bdc493e720165525 [2023-11-22 21:14:20,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 21:14:20,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 21:14:20,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 21:14:20,369 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 21:14:20,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 21:14:20,373 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:14:20" (1/1) ... [2023-11-22 21:14:20,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10cab2fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:14:20, skipping insertion in model container [2023-11-22 21:14:20,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:14:20" (1/1) ... [2023-11-22 21:14:20,403 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 21:14:20,510 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_1-1.i[1168,1181] [2023-11-22 21:14:20,555 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:14:20,571 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 21:14:20,588 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_1-1.i[1168,1181] [2023-11-22 21:14:20,613 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:14:20,631 INFO L206 MainTranslator]: Completed translation [2023-11-22 21:14:20,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:14:20 WrapperNode [2023-11-22 21:14:20,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 21:14:20,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 21:14:20,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 21:14:20,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 21:14:20,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:14:20" (1/1) ... [2023-11-22 21:14:20,653 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:14:20" (1/1) ... [2023-11-22 21:14:20,678 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2023-11-22 21:14:20,679 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 21:14:20,680 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 21:14:20,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 21:14:20,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 21:14:20,686 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:14:20" (1/1) ... [2023-11-22 21:14:20,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:14:20" (1/1) ... [2023-11-22 21:14:20,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:14:20" (1/1) ... [2023-11-22 21:14:20,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:14:20" (1/1) ... [2023-11-22 21:14:20,707 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:14:20" (1/1) ... [2023-11-22 21:14:20,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:14:20" (1/1) ... [2023-11-22 21:14:20,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:14:20" (1/1) ... [2023-11-22 21:14:20,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:14:20" (1/1) ... [2023-11-22 21:14:20,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 21:14:20,726 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 21:14:20,727 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 21:14:20,727 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 21:14:20,728 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:14:20" (1/1) ... [2023-11-22 21:14:20,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:14:20,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:14:20,770 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 21:14:20,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 21:14:20,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 21:14:20,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-22 21:14:20,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 21:14:20,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 21:14:20,870 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 21:14:20,871 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 21:14:21,147 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 21:14:21,174 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 21:14:21,177 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-22 21:14:21,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:14:21 BoogieIcfgContainer [2023-11-22 21:14:21,178 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 21:14:21,179 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 21:14:21,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 21:14:21,182 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 21:14:21,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:14:20" (1/3) ... [2023-11-22 21:14:21,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a8294ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:14:21, skipping insertion in model container [2023-11-22 21:14:21,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:14:20" (2/3) ... [2023-11-22 21:14:21,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a8294ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:14:21, skipping insertion in model container [2023-11-22 21:14:21,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:14:21" (3/3) ... [2023-11-22 21:14:21,186 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.i [2023-11-22 21:14:21,199 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 21:14:21,199 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 21:14:21,242 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 21:14:21,248 INFO L357 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, mHoare=true, 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;@3e3b1965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 21:14:21,248 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 21:14:21,252 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 37 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:21,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-22 21:14:21,256 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:14:21,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:14:21,258 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:14:21,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:14:21,262 INFO L85 PathProgramCache]: Analyzing trace with hash 459643034, now seen corresponding path program 1 times [2023-11-22 21:14:21,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:14:21,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436961223] [2023-11-22 21:14:21,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:14:21,273 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 [2023-11-22 21:14:21,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:14:21,275 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) [2023-11-22 21:14:21,301 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 [2023-11-22 21:14:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:14:21,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-22 21:14:21,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:14:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:14:21,368 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:14:21,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:14:21,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436961223] [2023-11-22 21:14:21,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436961223] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:14:21,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:14:21,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 21:14:21,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883767132] [2023-11-22 21:14:21,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:14:21,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 21:14:21,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:14:21,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 21:14:21,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 21:14:21,406 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 37 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:21,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:14:21,434 INFO L93 Difference]: Finished difference Result 50 states and 85 transitions. [2023-11-22 21:14:21,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 21:14:21,437 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-22 21:14:21,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:14:21,443 INFO L225 Difference]: With dead ends: 50 [2023-11-22 21:14:21,443 INFO L226 Difference]: Without dead ends: 36 [2023-11-22 21:14:21,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 21:14:21,450 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:14:21,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:14:21,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-22 21:14:21,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-11-22 21:14:21,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 35 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:21,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 62 transitions. [2023-11-22 21:14:21,500 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 62 transitions. Word has length 10 [2023-11-22 21:14:21,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:14:21,501 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 62 transitions. [2023-11-22 21:14:21,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:21,501 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 62 transitions. [2023-11-22 21:14:21,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-22 21:14:21,502 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:14:21,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:14:21,505 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 [2023-11-22 21:14:21,704 WARN L477 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 [2023-11-22 21:14:21,705 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:14:21,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:14:21,706 INFO L85 PathProgramCache]: Analyzing trace with hash 371044600, now seen corresponding path program 1 times [2023-11-22 21:14:21,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:14:21,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21849887] [2023-11-22 21:14:21,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:14:21,708 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 [2023-11-22 21:14:21,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:14:21,709 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) [2023-11-22 21:14:21,711 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 [2023-11-22 21:14:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:14:21,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 21:14:21,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:14:21,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:14:21,793 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:14:21,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:14:21,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21849887] [2023-11-22 21:14:21,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21849887] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:14:21,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:14:21,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 21:14:21,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783462454] [2023-11-22 21:14:21,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:14:21,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:14:21,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:14:21,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:14:21,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:14:21,796 INFO L87 Difference]: Start difference. First operand 36 states and 62 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:21,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:14:21,906 INFO L93 Difference]: Finished difference Result 109 states and 195 transitions. [2023-11-22 21:14:21,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:14:21,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-22 21:14:21,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:14:21,936 INFO L225 Difference]: With dead ends: 109 [2023-11-22 21:14:21,936 INFO L226 Difference]: Without dead ends: 82 [2023-11-22 21:14:21,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:14:21,937 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 88 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:14:21,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 122 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:14:21,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-22 21:14:21,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2023-11-22 21:14:21,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.641025641025641) internal successors, (128), 78 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:21,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 128 transitions. [2023-11-22 21:14:21,945 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 128 transitions. Word has length 10 [2023-11-22 21:14:21,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:14:21,946 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 128 transitions. [2023-11-22 21:14:21,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:21,946 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 128 transitions. [2023-11-22 21:14:21,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-22 21:14:21,946 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:14:21,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:14:21,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-22 21:14:22,149 WARN L477 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 [2023-11-22 21:14:22,150 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:14:22,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:14:22,150 INFO L85 PathProgramCache]: Analyzing trace with hash -450690481, now seen corresponding path program 1 times [2023-11-22 21:14:22,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:14:22,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169541443] [2023-11-22 21:14:22,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:14:22,151 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 [2023-11-22 21:14:22,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:14:22,153 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) [2023-11-22 21:14:22,157 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 [2023-11-22 21:14:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:14:22,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 21:14:22,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:14:22,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:14:22,236 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:14:22,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:14:22,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169541443] [2023-11-22 21:14:22,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169541443] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:14:22,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:14:22,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 21:14:22,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234620347] [2023-11-22 21:14:22,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:14:22,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:14:22,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:14:22,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:14:22,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:14:22,239 INFO L87 Difference]: Start difference. First operand 79 states and 128 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:22,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:14:22,349 INFO L93 Difference]: Finished difference Result 153 states and 262 transitions. [2023-11-22 21:14:22,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 21:14:22,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-22 21:14:22,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:14:22,351 INFO L225 Difference]: With dead ends: 153 [2023-11-22 21:14:22,351 INFO L226 Difference]: Without dead ends: 126 [2023-11-22 21:14:22,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:14:22,352 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 134 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:14:22,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 254 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:14:22,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-22 21:14:22,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 79. [2023-11-22 21:14:22,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.641025641025641) internal successors, (128), 78 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:22,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 128 transitions. [2023-11-22 21:14:22,360 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 128 transitions. Word has length 11 [2023-11-22 21:14:22,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:14:22,360 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 128 transitions. [2023-11-22 21:14:22,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:22,361 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 128 transitions. [2023-11-22 21:14:22,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-22 21:14:22,361 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:14:22,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:14:22,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-22 21:14:22,564 WARN L477 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 [2023-11-22 21:14:22,564 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:14:22,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:14:22,565 INFO L85 PathProgramCache]: Analyzing trace with hash -950257841, now seen corresponding path program 1 times [2023-11-22 21:14:22,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:14:22,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552461282] [2023-11-22 21:14:22,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:14:22,566 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 [2023-11-22 21:14:22,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:14:22,567 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) [2023-11-22 21:14:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:14:22,592 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 [2023-11-22 21:14:22,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 21:14:22,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:14:22,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:14:22,620 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:14:22,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:14:22,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552461282] [2023-11-22 21:14:22,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552461282] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:14:22,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:14:22,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:14:22,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130817455] [2023-11-22 21:14:22,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:14:22,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:14:22,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:14:22,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:14:22,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:14:22,635 INFO L87 Difference]: Start difference. First operand 79 states and 128 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:22,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:14:22,766 INFO L93 Difference]: Finished difference Result 197 states and 329 transitions. [2023-11-22 21:14:22,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 21:14:22,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-22 21:14:22,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:14:22,768 INFO L225 Difference]: With dead ends: 197 [2023-11-22 21:14:22,768 INFO L226 Difference]: Without dead ends: 170 [2023-11-22 21:14:22,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:14:22,769 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 180 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:14:22,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 479 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:14:22,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-11-22 21:14:22,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 79. [2023-11-22 21:14:22,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.641025641025641) internal successors, (128), 78 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:22,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 128 transitions. [2023-11-22 21:14:22,776 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 128 transitions. Word has length 12 [2023-11-22 21:14:22,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:14:22,776 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 128 transitions. [2023-11-22 21:14:22,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:22,776 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 128 transitions. [2023-11-22 21:14:22,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-22 21:14:22,777 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:14:22,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:14:22,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-22 21:14:22,979 WARN L477 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 [2023-11-22 21:14:22,979 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:14:22,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:14:22,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1569702093, now seen corresponding path program 1 times [2023-11-22 21:14:22,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:14:22,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197079414] [2023-11-22 21:14:22,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:14:22,981 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 [2023-11-22 21:14:22,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:14:22,993 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) [2023-11-22 21:14:23,055 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 [2023-11-22 21:14:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:14:23,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 21:14:23,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:14:23,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:14:23,107 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:14:23,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:14:23,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197079414] [2023-11-22 21:14:23,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197079414] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:14:23,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:14:23,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-22 21:14:23,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639379281] [2023-11-22 21:14:23,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:14:23,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 21:14:23,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:14:23,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 21:14:23,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-22 21:14:23,110 INFO L87 Difference]: Start difference. First operand 79 states and 128 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:23,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:14:23,249 INFO L93 Difference]: Finished difference Result 212 states and 342 transitions. [2023-11-22 21:14:23,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:14:23,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-22 21:14:23,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:14:23,251 INFO L225 Difference]: With dead ends: 212 [2023-11-22 21:14:23,251 INFO L226 Difference]: Without dead ends: 185 [2023-11-22 21:14:23,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-22 21:14:23,252 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 218 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:14:23,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 619 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:14:23,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-11-22 21:14:23,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 85. [2023-11-22 21:14:23,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.5119047619047619) internal successors, (127), 84 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:23,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2023-11-22 21:14:23,258 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 12 [2023-11-22 21:14:23,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:14:23,258 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2023-11-22 21:14:23,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:23,259 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2023-11-22 21:14:23,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-22 21:14:23,259 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:14:23,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:14:23,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-22 21:14:23,461 WARN L477 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 [2023-11-22 21:14:23,462 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:14:23,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:14:23,463 INFO L85 PathProgramCache]: Analyzing trace with hash -171126915, now seen corresponding path program 1 times [2023-11-22 21:14:23,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:14:23,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450893811] [2023-11-22 21:14:23,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:14:23,463 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 [2023-11-22 21:14:23,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:14:23,464 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) [2023-11-22 21:14:23,466 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 [2023-11-22 21:14:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:14:23,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 21:14:23,539 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:14:23,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:14:23,558 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:14:23,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:14:23,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450893811] [2023-11-22 21:14:23,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450893811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:14:23,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:14:23,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:14:23,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264116526] [2023-11-22 21:14:23,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:14:23,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:14:23,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:14:23,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:14:23,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:14:23,560 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:23,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:14:23,656 INFO L93 Difference]: Finished difference Result 236 states and 352 transitions. [2023-11-22 21:14:23,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:14:23,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-22 21:14:23,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:14:23,658 INFO L225 Difference]: With dead ends: 236 [2023-11-22 21:14:23,658 INFO L226 Difference]: Without dead ends: 167 [2023-11-22 21:14:23,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:14:23,659 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 89 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:14:23,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 137 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:14:23,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-11-22 21:14:23,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 95. [2023-11-22 21:14:23,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 94 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:23,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 140 transitions. [2023-11-22 21:14:23,671 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 140 transitions. Word has length 23 [2023-11-22 21:14:23,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:14:23,671 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 140 transitions. [2023-11-22 21:14:23,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:23,671 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 140 transitions. [2023-11-22 21:14:23,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-22 21:14:23,672 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:14:23,672 INFO L195 NwaCegarLoop]: trace 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] [2023-11-22 21:14:23,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-22 21:14:23,886 WARN L477 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 [2023-11-22 21:14:23,887 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:14:23,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:14:23,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1205485431, now seen corresponding path program 1 times [2023-11-22 21:14:23,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:14:23,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975860781] [2023-11-22 21:14:23,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:14:23,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 21:14:23,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:14:23,890 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) [2023-11-22 21:14:23,891 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 [2023-11-22 21:14:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:14:23,948 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 21:14:23,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:14:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 21:14:23,973 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:14:23,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:14:23,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975860781] [2023-11-22 21:14:23,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975860781] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:14:23,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:14:23,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 21:14:23,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688595346] [2023-11-22 21:14:23,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:14:23,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:14:23,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:14:23,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:14:23,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:14:23,975 INFO L87 Difference]: Start difference. First operand 95 states and 140 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:23,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:14:23,990 INFO L93 Difference]: Finished difference Result 166 states and 245 transitions. [2023-11-22 21:14:23,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:14:23,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-22 21:14:23,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:14:23,991 INFO L225 Difference]: With dead ends: 166 [2023-11-22 21:14:23,991 INFO L226 Difference]: Without dead ends: 83 [2023-11-22 21:14:23,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:14:23,992 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 53 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 55 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 [2023-11-22 21:14:23,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 55 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:14:23,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-22 21:14:23,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-11-22 21:14:23,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 82 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:23,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 120 transitions. [2023-11-22 21:14:23,998 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 120 transitions. Word has length 24 [2023-11-22 21:14:23,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:14:23,998 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 120 transitions. [2023-11-22 21:14:23,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:23,998 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 120 transitions. [2023-11-22 21:14:23,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-22 21:14:23,999 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:14:23,999 INFO L195 NwaCegarLoop]: trace 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] [2023-11-22 21:14:24,020 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 [2023-11-22 21:14:24,199 WARN L477 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 [2023-11-22 21:14:24,200 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:14:24,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:14:24,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1173091825, now seen corresponding path program 1 times [2023-11-22 21:14:24,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:14:24,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551853528] [2023-11-22 21:14:24,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:14:24,201 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 [2023-11-22 21:14:24,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:14:24,203 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) [2023-11-22 21:14:24,204 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 [2023-11-22 21:14:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:14:24,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 21:14:24,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:14:24,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:14:24,291 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:14:24,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:14:24,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551853528] [2023-11-22 21:14:24,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551853528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:14:24,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:14:24,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 21:14:24,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340491546] [2023-11-22 21:14:24,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:14:24,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:14:24,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:14:24,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:14:24,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:14:24,293 INFO L87 Difference]: Start difference. First operand 83 states and 120 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:24,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:14:24,408 INFO L93 Difference]: Finished difference Result 195 states and 296 transitions. [2023-11-22 21:14:24,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 21:14:24,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-22 21:14:24,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:14:24,410 INFO L225 Difference]: With dead ends: 195 [2023-11-22 21:14:24,410 INFO L226 Difference]: Without dead ends: 152 [2023-11-22 21:14:24,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:14:24,411 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 88 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:14:24,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 100 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:14:24,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-22 21:14:24,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2023-11-22 21:14:24,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.4189189189189189) internal successors, (210), 148 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:24,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 210 transitions. [2023-11-22 21:14:24,418 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 210 transitions. Word has length 27 [2023-11-22 21:14:24,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:14:24,419 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 210 transitions. [2023-11-22 21:14:24,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:24,419 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 210 transitions. [2023-11-22 21:14:24,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-22 21:14:24,420 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:14:24,420 INFO L195 NwaCegarLoop]: trace 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] [2023-11-22 21:14:24,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-22 21:14:24,622 WARN L477 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 [2023-11-22 21:14:24,622 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:14:24,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:14:24,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1213817478, now seen corresponding path program 1 times [2023-11-22 21:14:24,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:14:24,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236955103] [2023-11-22 21:14:24,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:14:24,624 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 [2023-11-22 21:14:24,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:14:24,628 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) [2023-11-22 21:14:24,668 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 [2023-11-22 21:14:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:14:24,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 21:14:24,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:14:24,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:14:24,751 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:14:24,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:14:24,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1236955103] [2023-11-22 21:14:24,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1236955103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:14:24,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:14:24,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:14:24,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637015339] [2023-11-22 21:14:24,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:14:24,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:14:24,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:14:24,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:14:24,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:14:24,753 INFO L87 Difference]: Start difference. First operand 149 states and 210 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:24,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:14:24,897 INFO L93 Difference]: Finished difference Result 262 states and 387 transitions. [2023-11-22 21:14:24,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 21:14:24,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-22 21:14:24,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:14:24,899 INFO L225 Difference]: With dead ends: 262 [2023-11-22 21:14:24,899 INFO L226 Difference]: Without dead ends: 219 [2023-11-22 21:14:24,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:14:24,899 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 134 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:14:24,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 201 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:14:24,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-11-22 21:14:24,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 149. [2023-11-22 21:14:24,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.4189189189189189) internal successors, (210), 148 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:24,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 210 transitions. [2023-11-22 21:14:24,907 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 210 transitions. Word has length 28 [2023-11-22 21:14:24,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:14:24,907 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 210 transitions. [2023-11-22 21:14:24,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:24,907 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 210 transitions. [2023-11-22 21:14:24,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-22 21:14:24,908 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:14:24,908 INFO L195 NwaCegarLoop]: trace 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] [2023-11-22 21:14:24,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-22 21:14:25,110 WARN L477 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 [2023-11-22 21:14:25,110 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:14:25,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:14:25,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1570895750, now seen corresponding path program 1 times [2023-11-22 21:14:25,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:14:25,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775237952] [2023-11-22 21:14:25,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:14:25,111 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 [2023-11-22 21:14:25,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:14:25,115 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) [2023-11-22 21:14:25,119 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 [2023-11-22 21:14:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:14:25,145 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 21:14:25,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:14:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:14:25,201 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:14:25,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:14:25,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775237952] [2023-11-22 21:14:25,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775237952] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:14:25,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:14:25,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-22 21:14:25,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440584235] [2023-11-22 21:14:25,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:14:25,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 21:14:25,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:14:25,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 21:14:25,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-22 21:14:25,203 INFO L87 Difference]: Start difference. First operand 149 states and 210 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:25,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:14:25,485 INFO L93 Difference]: Finished difference Result 295 states and 427 transitions. [2023-11-22 21:14:25,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:14:25,486 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-22 21:14:25,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:14:25,487 INFO L225 Difference]: With dead ends: 295 [2023-11-22 21:14:25,487 INFO L226 Difference]: Without dead ends: 252 [2023-11-22 21:14:25,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-22 21:14:25,487 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 158 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 21:14:25,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 416 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 21:14:25,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-11-22 21:14:25,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 115. [2023-11-22 21:14:25,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.394736842105263) internal successors, (159), 114 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:25,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 159 transitions. [2023-11-22 21:14:25,492 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 159 transitions. Word has length 29 [2023-11-22 21:14:25,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:14:25,492 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 159 transitions. [2023-11-22 21:14:25,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:25,492 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 159 transitions. [2023-11-22 21:14:25,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-22 21:14:25,493 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:14:25,493 INFO L195 NwaCegarLoop]: trace 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] [2023-11-22 21:14:25,500 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 [2023-11-22 21:14:25,693 WARN L477 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 [2023-11-22 21:14:25,694 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:14:25,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:14:25,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1436882244, now seen corresponding path program 1 times [2023-11-22 21:14:25,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:14:25,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085363647] [2023-11-22 21:14:25,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:14:25,694 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 [2023-11-22 21:14:25,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:14:25,703 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) [2023-11-22 21:14:25,704 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 [2023-11-22 21:14:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:14:25,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 21:14:25,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:14:25,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:14:25,787 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:14:25,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:14:25,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085363647] [2023-11-22 21:14:25,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085363647] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:14:25,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:14:25,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 21:14:25,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109277454] [2023-11-22 21:14:25,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:14:25,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:14:25,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:14:25,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:14:25,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:14:25,789 INFO L87 Difference]: Start difference. First operand 115 states and 159 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:25,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:14:25,879 INFO L93 Difference]: Finished difference Result 241 states and 343 transitions. [2023-11-22 21:14:25,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 21:14:25,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-22 21:14:25,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:14:25,880 INFO L225 Difference]: With dead ends: 241 [2023-11-22 21:14:25,880 INFO L226 Difference]: Without dead ends: 139 [2023-11-22 21:14:25,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:14:25,881 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 91 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:14:25,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 50 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:14:25,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-11-22 21:14:25,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 119. [2023-11-22 21:14:25,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.3389830508474576) internal successors, (158), 118 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:25,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 158 transitions. [2023-11-22 21:14:25,885 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 158 transitions. Word has length 29 [2023-11-22 21:14:25,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:14:25,885 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 158 transitions. [2023-11-22 21:14:25,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:25,885 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 158 transitions. [2023-11-22 21:14:25,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-22 21:14:25,886 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:14:25,886 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:14:25,897 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 [2023-11-22 21:14:26,087 WARN L477 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 [2023-11-22 21:14:26,088 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:14:26,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:14:26,088 INFO L85 PathProgramCache]: Analyzing trace with hash -446900071, now seen corresponding path program 1 times [2023-11-22 21:14:26,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:14:26,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919041585] [2023-11-22 21:14:26,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:14:26,089 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 [2023-11-22 21:14:26,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:14:26,090 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) [2023-11-22 21:14:26,092 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 [2023-11-22 21:14:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:14:26,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-22 21:14:26,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:14:26,193 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:14:26,193 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:14:26,258 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:14:26,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:14:26,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919041585] [2023-11-22 21:14:26,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919041585] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:14:26,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 21:14:26,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-11-22 21:14:26,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771118853] [2023-11-22 21:14:26,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 21:14:26,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-22 21:14:26,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:14:26,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-22 21:14:26,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:14:26,260 INFO L87 Difference]: Start difference. First operand 119 states and 158 transitions. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:26,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:14:26,455 INFO L93 Difference]: Finished difference Result 405 states and 555 transitions. [2023-11-22 21:14:26,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 21:14:26,456 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-11-22 21:14:26,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:14:26,457 INFO L225 Difference]: With dead ends: 405 [2023-11-22 21:14:26,457 INFO L226 Difference]: Without dead ends: 300 [2023-11-22 21:14:26,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2023-11-22 21:14:26,458 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 281 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:14:26,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 348 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:14:26,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-22 21:14:26,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 155. [2023-11-22 21:14:26,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.4090909090909092) internal successors, (217), 154 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:26,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 217 transitions. [2023-11-22 21:14:26,466 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 217 transitions. Word has length 42 [2023-11-22 21:14:26,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:14:26,466 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 217 transitions. [2023-11-22 21:14:26,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:26,467 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 217 transitions. [2023-11-22 21:14:26,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-22 21:14:26,467 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:14:26,467 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:14:26,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-11-22 21:14:26,669 WARN L477 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 [2023-11-22 21:14:26,670 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:14:26,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:14:26,670 INFO L85 PathProgramCache]: Analyzing trace with hash 254164507, now seen corresponding path program 1 times [2023-11-22 21:14:26,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:14:26,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815507222] [2023-11-22 21:14:26,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:14:26,671 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 [2023-11-22 21:14:26,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:14:26,672 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) [2023-11-22 21:14:26,673 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 [2023-11-22 21:14:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:14:26,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 21:14:26,702 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:14:26,786 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:14:26,787 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:14:26,849 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:14:26,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:14:26,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815507222] [2023-11-22 21:14:26,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815507222] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:14:26,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 21:14:26,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-11-22 21:14:26,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769503900] [2023-11-22 21:14:26,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 21:14:26,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-22 21:14:26,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:14:26,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-22 21:14:26,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:14:26,852 INFO L87 Difference]: Start difference. First operand 155 states and 217 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:27,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:14:27,088 INFO L93 Difference]: Finished difference Result 484 states and 755 transitions. [2023-11-22 21:14:27,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 21:14:27,088 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-11-22 21:14:27,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:14:27,090 INFO L225 Difference]: With dead ends: 484 [2023-11-22 21:14:27,090 INFO L226 Difference]: Without dead ends: 342 [2023-11-22 21:14:27,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2023-11-22 21:14:27,090 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 266 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 21:14:27,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 79 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 21:14:27,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2023-11-22 21:14:27,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 302. [2023-11-22 21:14:27,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:27,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 436 transitions. [2023-11-22 21:14:27,114 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 436 transitions. Word has length 42 [2023-11-22 21:14:27,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:14:27,114 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 436 transitions. [2023-11-22 21:14:27,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:27,115 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 436 transitions. [2023-11-22 21:14:27,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-22 21:14:27,116 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:14:27,116 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:14:27,120 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 [2023-11-22 21:14:27,317 WARN L477 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 [2023-11-22 21:14:27,317 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:14:27,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:14:27,317 INFO L85 PathProgramCache]: Analyzing trace with hash 12185717, now seen corresponding path program 1 times [2023-11-22 21:14:27,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:14:27,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448416293] [2023-11-22 21:14:27,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:14:27,318 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 [2023-11-22 21:14:27,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:14:27,319 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) [2023-11-22 21:14:27,320 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 [2023-11-22 21:14:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:14:27,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-22 21:14:27,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:14:27,471 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-22 21:14:27,471 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:14:27,529 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-22 21:14:27,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:14:27,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [448416293] [2023-11-22 21:14:27,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [448416293] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:14:27,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 21:14:27,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-11-22 21:14:27,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397433545] [2023-11-22 21:14:27,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 21:14:27,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 21:14:27,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:14:27,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 21:14:27,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-22 21:14:27,531 INFO L87 Difference]: Start difference. First operand 302 states and 436 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:27,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:14:27,724 INFO L93 Difference]: Finished difference Result 739 states and 1017 transitions. [2023-11-22 21:14:27,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 21:14:27,725 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2023-11-22 21:14:27,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:14:27,726 INFO L225 Difference]: With dead ends: 739 [2023-11-22 21:14:27,726 INFO L226 Difference]: Without dead ends: 451 [2023-11-22 21:14:27,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2023-11-22 21:14:27,728 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 196 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:14:27,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 299 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:14:27,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2023-11-22 21:14:27,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 278. [2023-11-22 21:14:27,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 1.3898916967509025) internal successors, (385), 277 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:27,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 385 transitions. [2023-11-22 21:14:27,744 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 385 transitions. Word has length 68 [2023-11-22 21:14:27,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:14:27,745 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 385 transitions. [2023-11-22 21:14:27,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:27,745 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 385 transitions. [2023-11-22 21:14:27,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-22 21:14:27,746 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:14:27,747 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2023-11-22 21:14:27,753 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 [2023-11-22 21:14:27,949 WARN L477 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 [2023-11-22 21:14:27,949 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:14:27,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:14:27,949 INFO L85 PathProgramCache]: Analyzing trace with hash -121827789, now seen corresponding path program 2 times [2023-11-22 21:14:27,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:14:27,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327419602] [2023-11-22 21:14:27,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 21:14:27,950 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 [2023-11-22 21:14:27,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:14:27,961 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) [2023-11-22 21:14:27,994 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 [2023-11-22 21:14:28,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 21:14:28,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 21:14:28,007 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-22 21:14:28,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:14:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:14:30,373 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:14:32,050 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:14:32,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:14:32,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327419602] [2023-11-22 21:14:32,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327419602] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:14:32,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 21:14:32,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2023-11-22 21:14:32,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245870045] [2023-11-22 21:14:32,052 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 21:14:32,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-22 21:14:32,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:14:32,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-22 21:14:32,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1585, Unknown=0, NotChecked=0, Total=1722 [2023-11-22 21:14:32,066 INFO L87 Difference]: Start difference. First operand 278 states and 385 transitions. Second operand has 42 states, 42 states have (on average 3.2142857142857144) internal successors, (135), 41 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:41,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:14:41,613 INFO L93 Difference]: Finished difference Result 1662 states and 2238 transitions. [2023-11-22 21:14:41,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-11-22 21:14:41,629 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.2142857142857144) internal successors, (135), 41 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2023-11-22 21:14:41,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:14:41,633 INFO L225 Difference]: With dead ends: 1662 [2023-11-22 21:14:41,633 INFO L226 Difference]: Without dead ends: 1548 [2023-11-22 21:14:41,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2447 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=2141, Invalid=10515, Unknown=0, NotChecked=0, Total=12656 [2023-11-22 21:14:41,638 INFO L413 NwaCegarLoop]: 385 mSDtfsCounter, 1986 mSDsluCounter, 7043 mSDsCounter, 0 mSdLazyCounter, 4161 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1986 SdHoareTripleChecker+Valid, 7428 SdHoareTripleChecker+Invalid, 4235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 4161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-22 21:14:41,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1986 Valid, 7428 Invalid, 4235 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [74 Valid, 4161 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-22 21:14:41,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2023-11-22 21:14:41,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 547. [2023-11-22 21:14:41,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 1.413919413919414) internal successors, (772), 546 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:41,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 772 transitions. [2023-11-22 21:14:41,679 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 772 transitions. Word has length 68 [2023-11-22 21:14:41,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:14:41,680 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 772 transitions. [2023-11-22 21:14:41,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.2142857142857144) internal successors, (135), 41 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:41,680 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 772 transitions. [2023-11-22 21:14:41,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-22 21:14:41,681 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:14:41,681 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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] [2023-11-22 21:14:41,704 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 (16)] Forceful destruction successful, exit code 0 [2023-11-22 21:14:41,884 WARN L477 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 [2023-11-22 21:14:41,884 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:14:41,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:14:41,884 INFO L85 PathProgramCache]: Analyzing trace with hash -757023828, now seen corresponding path program 1 times [2023-11-22 21:14:41,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:14:41,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221879194] [2023-11-22 21:14:41,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:14:41,885 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 [2023-11-22 21:14:41,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:14:41,886 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 21:14:41,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-22 21:14:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:14:41,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 21:14:41,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:14:42,022 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 63 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-22 21:14:42,022 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:14:42,086 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 48 proven. 31 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-22 21:14:42,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:14:42,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1221879194] [2023-11-22 21:14:42,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1221879194] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:14:42,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 21:14:42,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-22 21:14:42,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411889868] [2023-11-22 21:14:42,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 21:14:42,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-22 21:14:42,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:14:42,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-22 21:14:42,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:14:42,089 INFO L87 Difference]: Start difference. First operand 547 states and 772 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:42,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:14:42,583 INFO L93 Difference]: Finished difference Result 1167 states and 1665 transitions. [2023-11-22 21:14:42,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-22 21:14:42,584 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2023-11-22 21:14:42,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:14:42,587 INFO L225 Difference]: With dead ends: 1167 [2023-11-22 21:14:42,587 INFO L226 Difference]: Without dead ends: 985 [2023-11-22 21:14:42,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2023-11-22 21:14:42,588 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 267 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 21:14:42,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 143 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-22 21:14:42,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2023-11-22 21:14:42,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 852. [2023-11-22 21:14:42,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 851 states have (on average 1.4230317273795534) internal successors, (1211), 851 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:42,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1211 transitions. [2023-11-22 21:14:42,644 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1211 transitions. Word has length 70 [2023-11-22 21:14:42,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:14:42,644 INFO L495 AbstractCegarLoop]: Abstraction has 852 states and 1211 transitions. [2023-11-22 21:14:42,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:14:42,644 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1211 transitions. [2023-11-22 21:14:42,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-22 21:14:42,645 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:14:42,645 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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] [2023-11-22 21:14:42,657 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 (17)] Forceful destruction successful, exit code 0 [2023-11-22 21:14:42,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 21:14:42,848 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:14:42,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:14:42,848 INFO L85 PathProgramCache]: Analyzing trace with hash -753152637, now seen corresponding path program 1 times [2023-11-22 21:14:42,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:14:42,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391837788] [2023-11-22 21:14:42,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:14:42,849 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 [2023-11-22 21:14:42,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:14:42,850 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 21:14:42,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-22 21:14:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:14:42,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-22 21:14:42,895 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:14:44,975 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:14:44,976 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:14:47,066 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:14:47,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:14:47,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391837788] [2023-11-22 21:14:47,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391837788] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:14:47,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 21:14:47,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2023-11-22 21:14:47,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239336139] [2023-11-22 21:14:47,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 21:14:47,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-22 21:14:47,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:14:47,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-22 21:14:47,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1748, Unknown=0, NotChecked=0, Total=1892 [2023-11-22 21:14:47,068 INFO L87 Difference]: Start difference. First operand 852 states and 1211 transitions. Second operand has 44 states, 44 states have (on average 3.25) internal successors, (143), 43 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:15:22,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:15:22,884 INFO L93 Difference]: Finished difference Result 6294 states and 8491 transitions. [2023-11-22 21:15:22,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2023-11-22 21:15:22,885 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.25) internal successors, (143), 43 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2023-11-22 21:15:22,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:15:22,899 INFO L225 Difference]: With dead ends: 6294 [2023-11-22 21:15:22,899 INFO L226 Difference]: Without dead ends: 5991 [2023-11-22 21:15:22,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19814 ImplicationChecksByTransitivity, 30.0s TimeCoverageRelationStatistics Valid=7666, Invalid=53096, Unknown=0, NotChecked=0, Total=60762 [2023-11-22 21:15:22,910 INFO L413 NwaCegarLoop]: 845 mSDtfsCounter, 3428 mSDsluCounter, 14496 mSDsCounter, 0 mSdLazyCounter, 8977 mSolverCounterSat, 468 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3428 SdHoareTripleChecker+Valid, 15341 SdHoareTripleChecker+Invalid, 9445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 468 IncrementalHoareTripleChecker+Valid, 8977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2023-11-22 21:15:22,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3428 Valid, 15341 Invalid, 9445 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [468 Valid, 8977 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2023-11-22 21:15:22,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2023-11-22 21:15:23,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 3130. [2023-11-22 21:15:23,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3130 states, 3129 states have (on average 1.4429530201342282) internal successors, (4515), 3129 states have internal predecessors, (4515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:15:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 4515 transitions. [2023-11-22 21:15:23,151 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 4515 transitions. Word has length 72 [2023-11-22 21:15:23,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:15:23,151 INFO L495 AbstractCegarLoop]: Abstraction has 3130 states and 4515 transitions. [2023-11-22 21:15:23,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.25) internal successors, (143), 43 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:15:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 4515 transitions. [2023-11-22 21:15:23,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-22 21:15:23,156 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:15:23,156 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2023-11-22 21:15:23,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-11-22 21:15:23,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 21:15:23,359 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:15:23,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:15:23,360 INFO L85 PathProgramCache]: Analyzing trace with hash 782397891, now seen corresponding path program 1 times [2023-11-22 21:15:23,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:15:23,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211967855] [2023-11-22 21:15:23,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:15:23,361 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 [2023-11-22 21:15:23,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:15:23,365 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 21:15:23,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-22 21:15:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:15:23,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-22 21:15:23,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:15:25,687 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:15:25,687 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:15:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:15:27,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:15:27,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1211967855] [2023-11-22 21:15:27,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1211967855] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:15:27,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 21:15:27,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2023-11-22 21:15:27,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923456807] [2023-11-22 21:15:27,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 21:15:27,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-22 21:15:27,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:15:27,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-22 21:15:27,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1760, Unknown=0, NotChecked=0, Total=1892 [2023-11-22 21:15:27,466 INFO L87 Difference]: Start difference. First operand 3130 states and 4515 transitions. Second operand has 44 states, 44 states have (on average 3.25) internal successors, (143), 43 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:15:47,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:15:47,244 INFO L93 Difference]: Finished difference Result 9239 states and 12980 transitions. [2023-11-22 21:15:47,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2023-11-22 21:15:47,245 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.25) internal successors, (143), 43 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2023-11-22 21:15:47,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:15:47,283 INFO L225 Difference]: With dead ends: 9239 [2023-11-22 21:15:47,283 INFO L226 Difference]: Without dead ends: 6820 [2023-11-22 21:15:47,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5112 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=2493, Invalid=17813, Unknown=0, NotChecked=0, Total=20306 [2023-11-22 21:15:47,292 INFO L413 NwaCegarLoop]: 507 mSDtfsCounter, 1865 mSDsluCounter, 10730 mSDsCounter, 0 mSdLazyCounter, 6650 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1865 SdHoareTripleChecker+Valid, 11237 SdHoareTripleChecker+Invalid, 6784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 6650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:15:47,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1865 Valid, 11237 Invalid, 6784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 6650 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2023-11-22 21:15:47,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6820 states. [2023-11-22 21:15:47,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6820 to 3630. [2023-11-22 21:15:47,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3630 states, 3629 states have (on average 1.450261780104712) internal successors, (5263), 3629 states have internal predecessors, (5263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:15:47,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3630 states to 3630 states and 5263 transitions. [2023-11-22 21:15:47,587 INFO L78 Accepts]: Start accepts. Automaton has 3630 states and 5263 transitions. Word has length 72 [2023-11-22 21:15:47,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:15:47,587 INFO L495 AbstractCegarLoop]: Abstraction has 3630 states and 5263 transitions. [2023-11-22 21:15:47,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.25) internal successors, (143), 43 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:15:47,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3630 states and 5263 transitions. [2023-11-22 21:15:47,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-22 21:15:47,590 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:15:47,590 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2023-11-22 21:15:47,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-11-22 21:15:47,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 21:15:47,793 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:15:47,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:15:47,793 INFO L85 PathProgramCache]: Analyzing trace with hash -967599070, now seen corresponding path program 1 times [2023-11-22 21:15:47,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:15:47,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845210856] [2023-11-22 21:15:47,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:15:47,793 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 [2023-11-22 21:15:47,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:15:47,794 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 21:15:47,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-22 21:15:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:15:47,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 21:15:47,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:15:47,893 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 23 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:15:47,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:15:47,993 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 23 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:15:47,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:15:47,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845210856] [2023-11-22 21:15:47,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845210856] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:15:47,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 21:15:47,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-11-22 21:15:47,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756257783] [2023-11-22 21:15:47,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 21:15:47,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-22 21:15:47,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:15:47,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-22 21:15:47,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-22 21:15:47,996 INFO L87 Difference]: Start difference. First operand 3630 states and 5263 transitions. Second operand has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:15:49,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:15:49,188 INFO L93 Difference]: Finished difference Result 13598 states and 21694 transitions. [2023-11-22 21:15:49,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-22 21:15:49,188 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2023-11-22 21:15:49,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:15:49,225 INFO L225 Difference]: With dead ends: 13598 [2023-11-22 21:15:49,225 INFO L226 Difference]: Without dead ends: 6782 [2023-11-22 21:15:49,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2023-11-22 21:15:49,240 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 329 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 21:15:49,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 124 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-22 21:15:49,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6782 states. [2023-11-22 21:15:49,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6782 to 5665. [2023-11-22 21:15:49,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5665 states, 5664 states have (on average 1.2346398305084745) internal successors, (6993), 5664 states have internal predecessors, (6993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:15:49,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5665 states to 5665 states and 6993 transitions. [2023-11-22 21:15:49,709 INFO L78 Accepts]: Start accepts. Automaton has 5665 states and 6993 transitions. Word has length 74 [2023-11-22 21:15:49,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:15:49,709 INFO L495 AbstractCegarLoop]: Abstraction has 5665 states and 6993 transitions. [2023-11-22 21:15:49,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:15:49,710 INFO L276 IsEmpty]: Start isEmpty. Operand 5665 states and 6993 transitions. [2023-11-22 21:15:49,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-22 21:15:49,711 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:15:49,711 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:15:49,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-11-22 21:15:49,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 21:15:49,913 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:15:49,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:15:49,914 INFO L85 PathProgramCache]: Analyzing trace with hash -459659335, now seen corresponding path program 1 times [2023-11-22 21:15:49,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:15:49,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401570530] [2023-11-22 21:15:49,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:15:49,914 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 [2023-11-22 21:15:49,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:15:49,915 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 21:15:49,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-22 21:15:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:15:49,960 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-22 21:15:49,962 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:15:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:15:52,466 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:15:55,261 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:15:55,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:15:55,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401570530] [2023-11-22 21:15:55,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401570530] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:15:55,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 21:15:55,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2023-11-22 21:15:55,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493653340] [2023-11-22 21:15:55,262 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 21:15:55,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-22 21:15:55,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:15:55,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-22 21:15:55,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2086, Unknown=0, NotChecked=0, Total=2256 [2023-11-22 21:15:55,266 INFO L87 Difference]: Start difference. First operand 5665 states and 6993 transitions. Second operand has 48 states, 48 states have (on average 3.1041666666666665) internal successors, (149), 47 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:16:34,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:16:34,824 INFO L93 Difference]: Finished difference Result 8239 states and 10024 transitions. [2023-11-22 21:16:34,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2023-11-22 21:16:34,825 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.1041666666666665) internal successors, (149), 47 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2023-11-22 21:16:34,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:16:34,837 INFO L225 Difference]: With dead ends: 8239 [2023-11-22 21:16:34,838 INFO L226 Difference]: Without dead ends: 7988 [2023-11-22 21:16:34,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13768 ImplicationChecksByTransitivity, 35.6s TimeCoverageRelationStatistics Valid=6147, Invalid=41159, Unknown=0, NotChecked=0, Total=47306 [2023-11-22 21:16:34,841 INFO L413 NwaCegarLoop]: 432 mSDtfsCounter, 2556 mSDsluCounter, 10056 mSDsCounter, 0 mSdLazyCounter, 6011 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2556 SdHoareTripleChecker+Valid, 10488 SdHoareTripleChecker+Invalid, 6381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 6011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-11-22 21:16:34,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2556 Valid, 10488 Invalid, 6381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 6011 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2023-11-22 21:16:34,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7988 states. [2023-11-22 21:16:35,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7988 to 6764. [2023-11-22 21:16:35,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6764 states, 6763 states have (on average 1.2336241313026763) internal successors, (8343), 6763 states have internal predecessors, (8343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:16:35,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6764 states to 6764 states and 8343 transitions. [2023-11-22 21:16:35,524 INFO L78 Accepts]: Start accepts. Automaton has 6764 states and 8343 transitions. Word has length 75 [2023-11-22 21:16:35,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:16:35,524 INFO L495 AbstractCegarLoop]: Abstraction has 6764 states and 8343 transitions. [2023-11-22 21:16:35,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.1041666666666665) internal successors, (149), 47 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:16:35,525 INFO L276 IsEmpty]: Start isEmpty. Operand 6764 states and 8343 transitions. [2023-11-22 21:16:35,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-22 21:16:35,526 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:16:35,526 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:16:35,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-11-22 21:16:35,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 21:16:35,729 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:16:35,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:16:35,729 INFO L85 PathProgramCache]: Analyzing trace with hash -170026119, now seen corresponding path program 2 times [2023-11-22 21:16:35,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:16:35,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10107395] [2023-11-22 21:16:35,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 21:16:35,729 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 [2023-11-22 21:16:35,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:16:35,730 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 21:16:35,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-22 21:16:35,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 21:16:35,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 21:16:35,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-22 21:16:35,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:16:38,240 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:16:38,241 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:16:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:16:40,791 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:16:40,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10107395] [2023-11-22 21:16:40,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10107395] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:16:40,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 21:16:40,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2023-11-22 21:16:40,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117852356] [2023-11-22 21:16:40,792 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 21:16:40,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-22 21:16:40,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:16:40,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-22 21:16:40,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2079, Unknown=0, NotChecked=0, Total=2256 [2023-11-22 21:16:40,793 INFO L87 Difference]: Start difference. First operand 6764 states and 8343 transitions. Second operand has 48 states, 48 states have (on average 3.1041666666666665) internal successors, (149), 47 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:17:45,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:45,256 INFO L93 Difference]: Finished difference Result 11556 states and 14135 transitions. [2023-11-22 21:17:45,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2023-11-22 21:17:45,256 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.1041666666666665) internal successors, (149), 47 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2023-11-22 21:17:45,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:45,284 INFO L225 Difference]: With dead ends: 11556 [2023-11-22 21:17:45,284 INFO L226 Difference]: Without dead ends: 10201 [2023-11-22 21:17:45,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23281 ImplicationChecksByTransitivity, 59.3s TimeCoverageRelationStatistics Valid=7677, Invalid=61755, Unknown=0, NotChecked=0, Total=69432 [2023-11-22 21:17:45,303 INFO L413 NwaCegarLoop]: 461 mSDtfsCounter, 2884 mSDsluCounter, 10858 mSDsCounter, 0 mSdLazyCounter, 6419 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2884 SdHoareTripleChecker+Valid, 11319 SdHoareTripleChecker+Invalid, 6755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 6419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:17:45,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2884 Valid, 11319 Invalid, 6755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 6419 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2023-11-22 21:17:45,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10201 states. [2023-11-22 21:17:46,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10201 to 8247. [2023-11-22 21:17:46,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8247 states, 8246 states have (on average 1.2341741450400194) internal successors, (10177), 8246 states have internal predecessors, (10177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:17:46,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8247 states to 8247 states and 10177 transitions. [2023-11-22 21:17:46,239 INFO L78 Accepts]: Start accepts. Automaton has 8247 states and 10177 transitions. Word has length 75 [2023-11-22 21:17:46,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:46,239 INFO L495 AbstractCegarLoop]: Abstraction has 8247 states and 10177 transitions. [2023-11-22 21:17:46,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.1041666666666665) internal successors, (149), 47 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:17:46,239 INFO L276 IsEmpty]: Start isEmpty. Operand 8247 states and 10177 transitions. [2023-11-22 21:17:46,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-22 21:17:46,241 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:46,241 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:17:46,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-11-22 21:17:46,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 21:17:46,444 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:46,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:46,444 INFO L85 PathProgramCache]: Analyzing trace with hash 397716473, now seen corresponding path program 3 times [2023-11-22 21:17:46,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:17:46,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676757032] [2023-11-22 21:17:46,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-22 21:17:46,445 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 [2023-11-22 21:17:46,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:17:46,446 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 21:17:46,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-11-22 21:17:46,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-22 21:17:46,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 21:17:46,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-22 21:17:46,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:49,100 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:17:49,100 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:17:51,738 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:17:51,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:17:51,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676757032] [2023-11-22 21:17:51,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1676757032] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:17:51,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 21:17:51,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 46 [2023-11-22 21:17:51,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633259430] [2023-11-22 21:17:51,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 21:17:51,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-22 21:17:51,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:17:51,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-22 21:17:51,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2012, Unknown=0, NotChecked=0, Total=2162 [2023-11-22 21:17:51,740 INFO L87 Difference]: Start difference. First operand 8247 states and 10177 transitions. Second operand has 47 states, 47 states have (on average 3.1702127659574466) internal successors, (149), 46 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Killed by 15