/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-lit/ddlm2013.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05ce600 [2022-02-24 01:28:25,512 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-24 01:28:25,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-24 01:28:25,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-24 01:28:25,542 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-24 01:28:25,543 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-24 01:28:25,544 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-24 01:28:25,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-24 01:28:25,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-24 01:28:25,547 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-24 01:28:25,552 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-24 01:28:25,555 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-24 01:28:25,555 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-24 01:28:25,556 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-24 01:28:25,557 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-24 01:28:25,558 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-24 01:28:25,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-24 01:28:25,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-24 01:28:25,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-24 01:28:25,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-24 01:28:25,562 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-24 01:28:25,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-24 01:28:25,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-24 01:28:25,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-24 01:28:25,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-24 01:28:25,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-24 01:28:25,573 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-24 01:28:25,574 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-24 01:28:25,574 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-24 01:28:25,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-24 01:28:25,575 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-24 01:28:25,575 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-24 01:28:25,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-24 01:28:25,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-24 01:28:25,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-24 01:28:25,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-24 01:28:25,577 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-24 01:28:25,577 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-24 01:28:25,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-24 01:28:25,578 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-24 01:28:25,578 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-24 01:28:25,584 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-02-24 01:28:25,597 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-24 01:28:25,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-24 01:28:25,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-24 01:28:25,599 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-24 01:28:25,599 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-24 01:28:25,599 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-24 01:28:25,599 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-24 01:28:25,599 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-24 01:28:25,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-24 01:28:25,599 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-24 01:28:25,600 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-24 01:28:25,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-24 01:28:25,600 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-24 01:28:25,600 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-24 01:28:25,601 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-24 01:28:25,601 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-24 01:28:25,601 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-24 01:28:25,601 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-24 01:28:25,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 01:28:25,601 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-24 01:28:25,601 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-02-24 01:28:25,601 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-24 01:28:25,601 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-02-24 01:28:25,601 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-02-24 01:28:25,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-24 01:28:25,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-24 01:28:25,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-24 01:28:25,842 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-24 01:28:25,843 INFO L275 PluginConnector]: CDTParser initialized [2022-02-24 01:28:25,844 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/ddlm2013.i [2022-02-24 01:28:25,916 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2a8037b5/c86fda5a2fb847149993995303161969/FLAGa91c91b90 [2022-02-24 01:28:26,338 INFO L306 CDTParser]: Found 1 translation units. [2022-02-24 01:28:26,338 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/ddlm2013.i [2022-02-24 01:28:26,347 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2a8037b5/c86fda5a2fb847149993995303161969/FLAGa91c91b90 [2022-02-24 01:28:26,702 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2a8037b5/c86fda5a2fb847149993995303161969 [2022-02-24 01:28:26,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-24 01:28:26,705 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-24 01:28:26,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-24 01:28:26,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-24 01:28:26,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-24 01:28:26,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 01:28:26" (1/1) ... [2022-02-24 01:28:26,720 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b56545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:28:26, skipping insertion in model container [2022-02-24 01:28:26,720 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 01:28:26" (1/1) ... [2022-02-24 01:28:26,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-24 01:28:26,742 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-24 01:28:26,909 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/ddlm2013.i[895,908] [2022-02-24 01:28:26,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 01:28:26,938 INFO L203 MainTranslator]: Completed pre-run [2022-02-24 01:28:26,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/ddlm2013.i[895,908] [2022-02-24 01:28:26,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 01:28:26,962 INFO L208 MainTranslator]: Completed translation [2022-02-24 01:28:26,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:28:26 WrapperNode [2022-02-24 01:28:26,962 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-24 01:28:26,963 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-24 01:28:26,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-24 01:28:26,963 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-24 01:28:26,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:28:26" (1/1) ... [2022-02-24 01:28:26,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:28:26" (1/1) ... [2022-02-24 01:28:26,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:28:26" (1/1) ... [2022-02-24 01:28:26,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:28:26" (1/1) ... [2022-02-24 01:28:26,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:28:26" (1/1) ... [2022-02-24 01:28:26,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:28:26" (1/1) ... [2022-02-24 01:28:26,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:28:26" (1/1) ... [2022-02-24 01:28:26,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-24 01:28:26,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-24 01:28:26,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-24 01:28:26,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-24 01:28:26,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:28:26" (1/1) ... [2022-02-24 01:28:26,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 01:28:26,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-24 01:28:27,013 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) [2022-02-24 01:28:27,033 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 [2022-02-24 01:28:27,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-24 01:28:27,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-24 01:28:27,046 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-24 01:28:27,046 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-24 01:28:27,046 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-24 01:28:27,047 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-24 01:28:27,047 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-24 01:28:27,047 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-24 01:28:27,047 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-02-24 01:28:27,047 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-02-24 01:28:27,047 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-24 01:28:27,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-24 01:28:27,047 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-24 01:28:27,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-24 01:28:27,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-24 01:28:27,048 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-24 01:28:27,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-24 01:28:27,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-24 01:28:27,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-24 01:28:27,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-24 01:28:27,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-24 01:28:27,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-24 01:28:27,131 INFO L234 CfgBuilder]: Building ICFG [2022-02-24 01:28:27,133 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-24 01:28:27,272 INFO L275 CfgBuilder]: Performing block encoding [2022-02-24 01:28:27,288 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-24 01:28:27,289 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-24 01:28:27,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 01:28:27 BoogieIcfgContainer [2022-02-24 01:28:27,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-24 01:28:27,291 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-24 01:28:27,292 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-24 01:28:27,308 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-24 01:28:27,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.02 01:28:26" (1/3) ... [2022-02-24 01:28:27,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed7d3be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 01:28:27, skipping insertion in model container [2022-02-24 01:28:27,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:28:26" (2/3) ... [2022-02-24 01:28:27,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed7d3be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 01:28:27, skipping insertion in model container [2022-02-24 01:28:27,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 01:28:27" (3/3) ... [2022-02-24 01:28:27,310 INFO L111 eAbstractionObserver]: Analyzing ICFG ddlm2013.i [2022-02-24 01:28:27,322 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-02-24 01:28:27,322 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-24 01:28:27,377 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-24 01:28:27,387 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=JORDAN [2022-02-24 01:28:27,388 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-24 01:28:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-24 01:28:27,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-24 01:28:27,418 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:28:27,419 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:28:27,419 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:28:27,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:28:27,426 INFO L85 PathProgramCache]: Analyzing trace with hash -948948446, now seen corresponding path program 1 times [2022-02-24 01:28:27,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:28:27,463 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [137681172] [2022-02-24 01:28:27,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:28:27,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:28:27,561 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:28:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:28:27,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:28:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:28:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:28:27,690 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:28:27,691 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [137681172] [2022-02-24 01:28:27,692 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [137681172] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:28:27,692 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:28:27,692 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-24 01:28:27,693 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273710132] [2022-02-24 01:28:27,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:28:27,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-24 01:28:27,698 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:28:27,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-24 01:28:27,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-24 01:28:27,723 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:28:27,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:28:27,771 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-02-24 01:28:27,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-24 01:28:27,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-24 01:28:27,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:28:27,782 INFO L225 Difference]: With dead ends: 36 [2022-02-24 01:28:27,782 INFO L226 Difference]: Without dead ends: 16 [2022-02-24 01:28:27,785 INFO L932 BasicCegarLoop]: 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 [2022-02-24 01:28:27,788 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 01:28:27,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 01:28:27,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-24 01:28:27,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-24 01:28:27,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:28:27,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-02-24 01:28:27,823 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2022-02-24 01:28:27,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:28:27,823 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-02-24 01:28:27,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:28:27,824 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-02-24 01:28:27,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-24 01:28:27,825 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:28:27,825 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:28:27,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-24 01:28:27,826 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:28:27,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:28:27,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1572998999, now seen corresponding path program 1 times [2022-02-24 01:28:27,827 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:28:27,827 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1585265794] [2022-02-24 01:28:27,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:28:27,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:28:27,832 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:28:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:28:27,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:28:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:28:27,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:28:27,986 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:28:27,986 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1585265794] [2022-02-24 01:28:27,986 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1585265794] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:28:27,986 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:28:27,986 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-24 01:28:27,987 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14069040] [2022-02-24 01:28:27,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:28:27,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 01:28:27,988 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:28:27,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 01:28:27,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-24 01:28:27,988 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:28:28,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:28:28,073 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-02-24 01:28:28,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-24 01:28:28,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-24 01:28:28,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:28:28,074 INFO L225 Difference]: With dead ends: 24 [2022-02-24 01:28:28,074 INFO L226 Difference]: Without dead ends: 18 [2022-02-24 01:28:28,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-24 01:28:28,075 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 01:28:28,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 33 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 01:28:28,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-24 01:28:28,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-24 01:28:28,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:28:28,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-02-24 01:28:28,080 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2022-02-24 01:28:28,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:28:28,080 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-02-24 01:28:28,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:28:28,081 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-02-24 01:28:28,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-24 01:28:28,081 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:28:28,081 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:28:28,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-24 01:28:28,081 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:28:28,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:28:28,082 INFO L85 PathProgramCache]: Analyzing trace with hash -898740055, now seen corresponding path program 1 times [2022-02-24 01:28:28,082 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:28:28,082 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1078067882] [2022-02-24 01:28:28,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:28:28,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:28:28,084 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:28:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:28:28,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:28:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:28:28,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:28:28,290 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:28:28,290 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1078067882] [2022-02-24 01:28:28,290 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1078067882] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:28:28,291 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:28:28,291 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-24 01:28:28,291 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717804893] [2022-02-24 01:28:28,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:28:28,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-24 01:28:28,291 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:28:28,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-24 01:28:28,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-24 01:28:28,292 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:28:28,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:28:28,398 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-02-24 01:28:28,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-24 01:28:28,398 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-24 01:28:28,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:28:28,399 INFO L225 Difference]: With dead ends: 29 [2022-02-24 01:28:28,399 INFO L226 Difference]: Without dead ends: 23 [2022-02-24 01:28:28,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-02-24 01:28:28,400 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 01:28:28,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 36 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 01:28:28,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-24 01:28:28,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-02-24 01:28:28,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:28:28,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-02-24 01:28:28,405 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 17 [2022-02-24 01:28:28,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:28:28,406 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-02-24 01:28:28,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:28:28,406 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-02-24 01:28:28,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-24 01:28:28,406 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:28:28,406 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:28:28,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-24 01:28:28,406 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:28:28,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:28:28,407 INFO L85 PathProgramCache]: Analyzing trace with hash -197675477, now seen corresponding path program 1 times [2022-02-24 01:28:28,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:28:28,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1210599889] [2022-02-24 01:28:28,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:28:28,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:28:28,408 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:28:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:28:28,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:28:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:28:28,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:28:28,433 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:28:28,433 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1210599889] [2022-02-24 01:28:28,433 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1210599889] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:28:28,433 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:28:28,433 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 01:28:28,433 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387102378] [2022-02-24 01:28:28,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:28:28,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 01:28:28,434 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:28:28,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 01:28:28,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 01:28:28,434 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:28:28,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:28:28,456 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-02-24 01:28:28,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 01:28:28,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-24 01:28:28,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:28:28,457 INFO L225 Difference]: With dead ends: 32 [2022-02-24 01:28:28,457 INFO L226 Difference]: Without dead ends: 21 [2022-02-24 01:28:28,457 INFO L932 BasicCegarLoop]: 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 [2022-02-24 01:28:28,458 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 01:28:28,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 29 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 01:28:28,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-24 01:28:28,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-24 01:28:28,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:28:28,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-02-24 01:28:28,463 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2022-02-24 01:28:28,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:28:28,463 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-02-24 01:28:28,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:28:28,463 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-24 01:28:28,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-24 01:28:28,464 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:28:28,464 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:28:28,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-24 01:28:28,464 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:28:28,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:28:28,464 INFO L85 PathProgramCache]: Analyzing trace with hash 737392151, now seen corresponding path program 2 times [2022-02-24 01:28:28,465 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:28:28,465 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [587823630] [2022-02-24 01:28:28,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:28:28,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:28:28,466 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:28:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:28:28,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:28:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:28:28,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:28:28,607 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:28:28,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [587823630] [2022-02-24 01:28:28,607 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [587823630] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:28:28,608 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:28:28,608 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-24 01:28:28,608 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689212142] [2022-02-24 01:28:28,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:28:28,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-24 01:28:28,608 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:28:28,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-24 01:28:28,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-24 01:28:28,609 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:28:28,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:28:28,761 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-02-24 01:28:28,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-24 01:28:28,761 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-24 01:28:28,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:28:28,762 INFO L225 Difference]: With dead ends: 39 [2022-02-24 01:28:28,762 INFO L226 Difference]: Without dead ends: 24 [2022-02-24 01:28:28,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-02-24 01:28:28,763 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 01:28:28,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 46 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 01:28:28,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-24 01:28:28,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-24 01:28:28,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:28:28,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-02-24 01:28:28,768 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2022-02-24 01:28:28,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:28:28,768 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-02-24 01:28:28,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:28:28,768 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-02-24 01:28:28,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-24 01:28:28,769 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:28:28,769 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:28:28,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-24 01:28:28,769 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:28:28,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:28:28,769 INFO L85 PathProgramCache]: Analyzing trace with hash -831901207, now seen corresponding path program 3 times [2022-02-24 01:28:28,769 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:28:28,770 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [191998500] [2022-02-24 01:28:28,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:28:28,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:28:28,771 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:28:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:28:28,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:28:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:28:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:28:28,939 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:28:28,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [191998500] [2022-02-24 01:28:28,940 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [191998500] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:28:28,940 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:28:28,940 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-24 01:28:28,940 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789583155] [2022-02-24 01:28:28,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:28:28,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-24 01:28:28,941 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:28:28,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-24 01:28:28,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-02-24 01:28:28,942 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:28:29,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:28:29,192 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-02-24 01:28:29,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-24 01:28:29,193 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-02-24 01:28:29,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:28:29,194 INFO L225 Difference]: With dead ends: 35 [2022-02-24 01:28:29,194 INFO L226 Difference]: Without dead ends: 29 [2022-02-24 01:28:29,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2022-02-24 01:28:29,195 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 24 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 01:28:29,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 55 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 01:28:29,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-24 01:28:29,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-02-24 01:28:29,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:28:29,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-02-24 01:28:29,204 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-02-24 01:28:29,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:28:29,204 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-02-24 01:28:29,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:28:29,204 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-02-24 01:28:29,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-24 01:28:29,205 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:28:29,205 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:28:29,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-24 01:28:29,205 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:28:29,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:28:29,206 INFO L85 PathProgramCache]: Analyzing trace with hash -130836629, now seen corresponding path program 1 times [2022-02-24 01:28:29,206 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:28:29,206 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [928851654] [2022-02-24 01:28:29,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:28:29,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:28:29,208 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:28:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:28:29,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:28:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:28:29,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:28:29,265 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:28:29,265 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [928851654] [2022-02-24 01:28:29,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [928851654] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:28:29,265 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:28:29,265 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-24 01:28:29,265 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649052737] [2022-02-24 01:28:29,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:28:29,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 01:28:29,266 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:28:29,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 01:28:29,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-24 01:28:29,266 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:28:29,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:28:29,314 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-02-24 01:28:29,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-24 01:28:29,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-02-24 01:28:29,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:28:29,315 INFO L225 Difference]: With dead ends: 38 [2022-02-24 01:28:29,315 INFO L226 Difference]: Without dead ends: 27 [2022-02-24 01:28:29,315 INFO L932 BasicCegarLoop]: 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 [2022-02-24 01:28:29,316 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 01:28:29,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 33 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 01:28:29,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-24 01:28:29,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-24 01:28:29,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:28:29,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-02-24 01:28:29,322 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2022-02-24 01:28:29,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:28:29,323 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-02-24 01:28:29,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:28:29,323 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-02-24 01:28:29,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-24 01:28:29,323 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:28:29,323 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:28:29,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-24 01:28:29,324 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:28:29,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:28:29,324 INFO L85 PathProgramCache]: Analyzing trace with hash -931312425, now seen corresponding path program 4 times [2022-02-24 01:28:29,324 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:28:29,324 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [876273758] [2022-02-24 01:28:29,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:28:29,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:28:29,325 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:28:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:28:29,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:28:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:28:29,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:28:29,511 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:28:29,511 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [876273758] [2022-02-24 01:28:29,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [876273758] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:28:29,511 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:28:29,511 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-24 01:28:29,511 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018835509] [2022-02-24 01:28:29,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:28:29,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-24 01:28:29,512 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:28:29,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-24 01:28:29,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-02-24 01:28:29,512 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:28:29,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:28:29,707 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-02-24 01:28:29,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-24 01:28:29,707 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-02-24 01:28:29,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:28:29,707 INFO L225 Difference]: With dead ends: 27 [2022-02-24 01:28:29,708 INFO L226 Difference]: Without dead ends: 0 [2022-02-24 01:28:29,708 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-02-24 01:28:29,708 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 01:28:29,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 63 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 01:28:29,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-24 01:28:29,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-24 01:28:29,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-02-24 01:28:29,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-24 01:28:29,709 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-02-24 01:28:29,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:28:29,709 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-24 01:28:29,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:28:29,710 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-24 01:28:29,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-24 01:28:29,712 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-24 01:28:29,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-24 01:28:29,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-24 01:28:30,025 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-02-24 01:28:30,026 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-02-24 01:28:30,026 INFO L858 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-02-24 01:28:30,026 INFO L858 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-02-24 01:28:30,026 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-02-24 01:28:30,026 INFO L858 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-02-24 01:28:30,026 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-02-24 01:28:30,026 INFO L854 garLoopResultBuilder]: At program point L35-2(lines 24 49) the Hoare annotation is: (or (= main_~flag~0 0) (let ((.cse1 (div main_~b~0 4294967296)) (.cse0 (div main_~a~0 4294967296))) (let ((.cse3 (+ main_~b~0 (* .cse0 4294967296))) (.cse2 (* .cse1 4294967296))) (and (<= .cse0 .cse1) (<= (+ main_~a~0 .cse2) .cse3) (< .cse3 (+ main_~a~0 .cse2 1)))))) [2022-02-24 01:28:30,026 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 24 49) the Hoare annotation is: true [2022-02-24 01:28:30,026 INFO L854 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (let ((.cse1 (div main_~b~0 4294967296)) (.cse0 (div main_~a~0 4294967296))) (let ((.cse3 (+ main_~b~0 (* .cse0 4294967296))) (.cse2 (* .cse1 4294967296))) (and (<= .cse0 .cse1) (<= (+ main_~a~0 .cse2) .cse3) (< .cse3 (+ main_~a~0 .cse2 1))))) [2022-02-24 01:28:30,027 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 24 49) the Hoare annotation is: true [2022-02-24 01:28:30,027 INFO L854 garLoopResultBuilder]: At program point L30(lines 30 34) the Hoare annotation is: (and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0)) [2022-02-24 01:28:30,027 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 24 49) the Hoare annotation is: true [2022-02-24 01:28:30,027 INFO L861 garLoopResultBuilder]: At program point L45(lines 45 47) the Hoare annotation is: true [2022-02-24 01:28:30,027 INFO L854 garLoopResultBuilder]: At program point L39(lines 39 43) the Hoare annotation is: (let ((.cse5 (div main_~a~0 4294967296)) (.cse4 (div main_~b~0 4294967296))) (let ((.cse2 (<= .cse5 .cse4)) (.cse3 (<= (+ main_~a~0 (* .cse4 4294967296)) (+ main_~b~0 (* .cse5 4294967296)))) (.cse1 (+ (* main_~j~0 2) main_~b~0 2)) (.cse0 (+ main_~a~0 (* main_~i~0 2)))) (or (= main_~flag~0 0) (and (<= (+ main_~b~0 main_~j~0 1) (+ main_~i~0 main_~a~0)) (<= .cse0 .cse1) (<= main_~i~0 (* (div main_~i~0 2) 2)) .cse2 .cse3 (<= 4 main_~i~0)) (and (= main_~j~0 1) .cse2 (<= main_~i~0 2) .cse3 (<= .cse1 .cse0))))) [2022-02-24 01:28:30,027 INFO L854 garLoopResultBuilder]: At program point L39-2(lines 24 49) the Hoare annotation is: (let ((.cse5 (+ (* main_~j~0 2) main_~b~0)) (.cse4 (+ main_~a~0 2 (* main_~i~0 2))) (.cse7 (+ main_~a~0 3 (* main_~i~0 3))) (.cse6 (+ main_~b~0 (* main_~j~0 3)))) (let ((.cse0 (<= .cse7 .cse6)) (.cse1 (<= .cse5 .cse4)) (.cse2 (<= .cse6 .cse7)) (.cse3 (<= .cse4 .cse5))) (or (and (= main_~a~0 0) (= main_~j~0 1) (= main_~b~0 0) (= main_~i~0 0)) (and (<= 2 main_~i~0) .cse0 .cse1 .cse2 (<= main_~i~0 2) .cse3) (= main_~flag~0 0) (and (<= main_~i~0 (* (div main_~i~0 2) 2)) .cse0 .cse1 .cse2 (<= 4 main_~i~0) .cse3)))) [2022-02-24 01:28:30,027 INFO L854 garLoopResultBuilder]: At program point L35(lines 35 44) the Hoare annotation is: (let ((.cse5 (+ (* main_~j~0 2) main_~b~0)) (.cse4 (+ main_~a~0 2 (* main_~i~0 2))) (.cse7 (+ main_~a~0 3 (* main_~i~0 3))) (.cse6 (+ main_~b~0 (* main_~j~0 3)))) (let ((.cse0 (<= .cse7 .cse6)) (.cse1 (<= .cse5 .cse4)) (.cse2 (<= .cse6 .cse7)) (.cse3 (<= .cse4 .cse5))) (or (and (= main_~a~0 0) (= main_~j~0 1) (= main_~b~0 0) (= main_~i~0 0)) (and (<= 2 main_~i~0) .cse0 .cse1 .cse2 (<= main_~i~0 2) .cse3) (= main_~flag~0 0) (and (<= main_~i~0 (* (div main_~i~0 2) 2)) .cse0 .cse1 .cse2 (<= 4 main_~i~0) .cse3)))) [2022-02-24 01:28:30,027 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-02-24 01:28:30,027 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-02-24 01:28:30,027 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-02-24 01:28:30,027 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-02-24 01:28:30,027 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-02-24 01:28:30,027 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-02-24 01:28:30,028 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-02-24 01:28:30,028 INFO L861 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2022-02-24 01:28:30,028 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-02-24 01:28:30,028 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: true [2022-02-24 01:28:30,028 INFO L854 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-02-24 01:28:30,028 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-02-24 01:28:30,028 INFO L854 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-02-24 01:28:30,031 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2022-02-24 01:28:30,032 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-24 01:28:30,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.02 01:28:30 BoogieIcfgContainer [2022-02-24 01:28:30,037 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-24 01:28:30,038 INFO L158 Benchmark]: Toolchain (without parser) took 3333.10ms. Allocated memory was 207.6MB in the beginning and 271.6MB in the end (delta: 64.0MB). Free memory was 154.8MB in the beginning and 210.6MB in the end (delta: -55.8MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. [2022-02-24 01:28:30,038 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 207.6MB. Free memory is still 171.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-24 01:28:30,038 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.69ms. Allocated memory was 207.6MB in the beginning and 271.6MB in the end (delta: 64.0MB). Free memory was 154.6MB in the beginning and 245.5MB in the end (delta: -90.9MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. [2022-02-24 01:28:30,039 INFO L158 Benchmark]: Boogie Preprocessor took 20.48ms. Allocated memory is still 271.6MB. Free memory was 245.5MB in the beginning and 243.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-24 01:28:30,039 INFO L158 Benchmark]: RCFGBuilder took 305.98ms. Allocated memory is still 271.6MB. Free memory was 243.9MB in the beginning and 233.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-02-24 01:28:30,039 INFO L158 Benchmark]: TraceAbstraction took 2746.11ms. Allocated memory is still 271.6MB. Free memory was 232.8MB in the beginning and 210.6MB in the end (delta: 22.2MB). Peak memory consumption was 22.2MB. Max. memory is 8.0GB. [2022-02-24 01:28:30,040 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 207.6MB. Free memory is still 171.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 256.69ms. Allocated memory was 207.6MB in the beginning and 271.6MB in the end (delta: 64.0MB). Free memory was 154.6MB in the beginning and 245.5MB in the end (delta: -90.9MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.48ms. Allocated memory is still 271.6MB. Free memory was 245.5MB in the beginning and 243.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 305.98ms. Allocated memory is still 271.6MB. Free memory was 243.9MB in the beginning and 233.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2746.11ms. Allocated memory is still 271.6MB. Free memory was 232.8MB in the beginning and 210.6MB in the end (delta: 22.2MB). Peak memory consumption was 22.2MB. Max. memory is 8.0GB. * 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 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 152 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 151 mSDsluCounter, 323 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 192 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 389 IncrementalHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 131 mSDtfsCounter, 389 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=6, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 71 PreInvPairs, 118 NumberOfFragments, 488 HoareAnnotationTreeSize, 71 FomulaSimplifications, 5 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 23 FomulaSimplificationsInter, 1095 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-02-24 01:28:30,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...