/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/loops/invert_string-3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 23:01:41,764 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 23:01:41,766 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 23:01:41,785 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 23:01:41,786 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 23:01:41,786 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 23:01:41,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 23:01:41,789 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 23:01:41,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 23:01:41,791 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 23:01:41,791 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 23:01:41,792 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 23:01:41,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 23:01:41,793 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 23:01:41,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 23:01:41,795 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 23:01:41,796 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 23:01:41,796 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 23:01:41,798 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 23:01:41,799 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 23:01:41,800 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 23:01:41,801 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 23:01:41,802 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 23:01:41,803 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 23:01:41,805 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 23:01:41,805 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 23:01:41,805 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 23:01:41,806 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 23:01:41,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 23:01:41,807 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 23:01:41,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 23:01:41,808 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 23:01:41,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 23:01:41,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 23:01:41,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 23:01:41,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 23:01:41,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 23:01:41,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 23:01:41,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 23:01:41,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 23:01:41,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 23:01:41,813 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-02 23:01:41,836 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 23:01:41,836 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 23:01:41,837 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 23:01:41,837 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 23:01:41,838 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 23:01:41,838 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 23:01:41,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 23:01:41,838 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 23:01:41,838 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 23:01:41,838 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 23:01:41,838 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 23:01:41,838 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 23:01:41,838 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 23:01:41,839 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 23:01:41,839 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 23:01:41,839 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 23:01:41,839 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 23:01:41,839 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 23:01:41,839 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:01:41,839 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 23:01:41,839 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-02 23:01:41,839 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 23:01:41,840 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-02 23:01:41,840 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; [2021-05-02 23:01:42,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 23:01:42,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 23:01:42,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 23:01:42,110 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 23:01:42,111 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 23:01:42,112 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string-3.c [2021-05-02 23:01:42,172 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a15564577/a02e3832b7d947489ed22549a40ba616/FLAG015339d7a [2021-05-02 23:01:42,587 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 23:01:42,588 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c [2021-05-02 23:01:42,592 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a15564577/a02e3832b7d947489ed22549a40ba616/FLAG015339d7a [2021-05-02 23:01:42,606 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a15564577/a02e3832b7d947489ed22549a40ba616 [2021-05-02 23:01:42,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 23:01:42,609 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 23:01:42,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 23:01:42,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 23:01:42,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 23:01:42,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:01:42" (1/1) ... [2021-05-02 23:01:42,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f3d9de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:01:42, skipping insertion in model container [2021-05-02 23:01:42,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:01:42" (1/1) ... [2021-05-02 23:01:42,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 23:01:42,639 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 23:01:42,762 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c[327,340] [2021-05-02 23:01:42,779 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:01:42,784 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 23:01:42,841 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c[327,340] [2021-05-02 23:01:42,847 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:01:42,863 INFO L208 MainTranslator]: Completed translation [2021-05-02 23:01:42,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:01:42 WrapperNode [2021-05-02 23:01:42,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 23:01:42,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 23:01:42,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 23:01:42,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 23:01:42,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:01:42" (1/1) ... [2021-05-02 23:01:42,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:01:42" (1/1) ... [2021-05-02 23:01:42,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:01:42" (1/1) ... [2021-05-02 23:01:42,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:01:42" (1/1) ... [2021-05-02 23:01:42,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:01:42" (1/1) ... [2021-05-02 23:01:42,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:01:42" (1/1) ... [2021-05-02 23:01:42,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:01:42" (1/1) ... [2021-05-02 23:01:42,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 23:01:42,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 23:01:42,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 23:01:42,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 23:01:42,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:01:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:01:43,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 23:01:43,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 23:01:43,025 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 23:01:43,025 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 23:01:43,025 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 23:01:43,025 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 23:01:43,025 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 23:01:43,025 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 23:01:43,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 23:01:43,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 23:01:43,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2021-05-02 23:01:43,026 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 23:01:43,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 23:01:43,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 23:01:43,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 23:01:43,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 23:01:43,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 23:01:43,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 23:01:43,314 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 23:01:43,315 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-05-02 23:01:43,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:01:43 BoogieIcfgContainer [2021-05-02 23:01:43,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 23:01:43,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 23:01:43,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 23:01:43,319 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 23:01:43,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 11:01:42" (1/3) ... [2021-05-02 23:01:43,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0ce357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:01:43, skipping insertion in model container [2021-05-02 23:01:43,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:01:42" (2/3) ... [2021-05-02 23:01:43,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0ce357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:01:43, skipping insertion in model container [2021-05-02 23:01:43,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:01:43" (3/3) ... [2021-05-02 23:01:43,321 INFO L111 eAbstractionObserver]: Analyzing ICFG invert_string-3.c [2021-05-02 23:01:43,333 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-02 23:01:43,336 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 23:01:43,363 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 23:01:43,377 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 23:01:43,378 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 23:01:43,378 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-02 23:01:43,378 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 23:01:43,378 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 23:01:43,378 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 23:01:43,378 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 23:01:43,378 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 23:01:43,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 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) [2021-05-02 23:01:43,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-02 23:01:43,393 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:01:43,393 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:01:43,393 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:01:43,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:01:43,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1728321422, now seen corresponding path program 1 times [2021-05-02 23:01:43,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:01:43,406 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [376523112] [2021-05-02 23:01:43,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:01:43,452 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:01:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:43,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:01:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:43,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:01:43,711 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:01:43,712 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [376523112] [2021-05-02 23:01:43,713 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [376523112] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:01:43,715 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:01:43,715 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 23:01:43,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640660554] [2021-05-02 23:01:43,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 23:01:43,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:01:43,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 23:01:43,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:01:43,731 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 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 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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) [2021-05-02 23:01:43,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:01:43,897 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2021-05-02 23:01:43,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 23:01:43,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 15 [2021-05-02 23:01:43,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:01:43,902 INFO L225 Difference]: With dead ends: 47 [2021-05-02 23:01:43,903 INFO L226 Difference]: Without dead ends: 23 [2021-05-02 23:01:43,905 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 59.0ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:01:43,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-05-02 23:01:43,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-05-02 23:01:43,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:01:43,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2021-05-02 23:01:43,930 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2021-05-02 23:01:43,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:01:43,931 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2021-05-02 23:01:43,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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) [2021-05-02 23:01:43,931 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2021-05-02 23:01:43,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 23:01:43,931 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:01:43,932 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:01:43,932 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 23:01:43,932 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:01:43,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:01:43,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1238871028, now seen corresponding path program 1 times [2021-05-02 23:01:43,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:01:43,933 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [662189717] [2021-05-02 23:01:43,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:01:43,945 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:01:43,947 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:01:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:44,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:01:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:44,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:01:44,029 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:01:44,029 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [662189717] [2021-05-02 23:01:44,029 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [662189717] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:01:44,029 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:01:44,030 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 23:01:44,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304097253] [2021-05-02 23:01:44,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 23:01:44,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:01:44,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 23:01:44,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 23:01:44,031 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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) [2021-05-02 23:01:44,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:01:44,074 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2021-05-02 23:01:44,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 23:01:44,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 [2021-05-02 23:01:44,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:01:44,076 INFO L225 Difference]: With dead ends: 40 [2021-05-02 23:01:44,076 INFO L226 Difference]: Without dead ends: 25 [2021-05-02 23:01:44,077 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.3ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 23:01:44,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-05-02 23:01:44,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-05-02 23:01:44,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:01:44,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2021-05-02 23:01:44,082 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2021-05-02 23:01:44,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:01:44,082 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2021-05-02 23:01:44,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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) [2021-05-02 23:01:44,082 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2021-05-02 23:01:44,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-02 23:01:44,083 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:01:44,083 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:01:44,083 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 23:01:44,083 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:01:44,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:01:44,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1304082102, now seen corresponding path program 1 times [2021-05-02 23:01:44,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:01:44,084 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1338055747] [2021-05-02 23:01:44,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:01:44,087 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:01:44,088 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:01:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:44,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:01:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:44,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:01:44,211 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:01:44,212 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1338055747] [2021-05-02 23:01:44,212 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1338055747] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:01:44,212 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:01:44,212 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:01:44,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373038243] [2021-05-02 23:01:44,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:01:44,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:01:44,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:01:44,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:01:44,213 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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) [2021-05-02 23:01:44,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:01:44,304 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2021-05-02 23:01:44,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 23:01:44,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 19 [2021-05-02 23:01:44,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:01:44,306 INFO L225 Difference]: With dead ends: 42 [2021-05-02 23:01:44,306 INFO L226 Difference]: Without dead ends: 27 [2021-05-02 23:01:44,307 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 61.8ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:01:44,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-05-02 23:01:44,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2021-05-02 23:01:44,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:01:44,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2021-05-02 23:01:44,318 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2021-05-02 23:01:44,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:01:44,319 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2021-05-02 23:01:44,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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) [2021-05-02 23:01:44,319 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2021-05-02 23:01:44,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-02 23:01:44,320 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:01:44,320 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:01:44,320 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 23:01:44,320 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:01:44,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:01:44,320 INFO L82 PathProgramCache]: Analyzing trace with hash 452585224, now seen corresponding path program 2 times [2021-05-02 23:01:44,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:01:44,321 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [838161843] [2021-05-02 23:01:44,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:01:44,328 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:01:44,330 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:01:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:44,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:01:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:44,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:01:44,486 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:01:44,486 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [838161843] [2021-05-02 23:01:44,486 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [838161843] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:01:44,486 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:01:44,486 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 23:01:44,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689900049] [2021-05-02 23:01:44,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 23:01:44,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:01:44,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 23:01:44,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:01:44,489 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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) [2021-05-02 23:01:44,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:01:44,571 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2021-05-02 23:01:44,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 23:01:44,572 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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 21 [2021-05-02 23:01:44,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:01:44,573 INFO L225 Difference]: With dead ends: 44 [2021-05-02 23:01:44,573 INFO L226 Difference]: Without dead ends: 29 [2021-05-02 23:01:44,574 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 59.7ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:01:44,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-05-02 23:01:44,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-05-02 23:01:44,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:01:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2021-05-02 23:01:44,592 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 21 [2021-05-02 23:01:44,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:01:44,593 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2021-05-02 23:01:44,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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) [2021-05-02 23:01:44,593 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2021-05-02 23:01:44,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-02 23:01:44,594 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:01:44,594 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:01:44,594 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 23:01:44,594 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:01:44,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:01:44,595 INFO L82 PathProgramCache]: Analyzing trace with hash 687738182, now seen corresponding path program 3 times [2021-05-02 23:01:44,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:01:44,597 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [274845515] [2021-05-02 23:01:44,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:01:44,605 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:01:44,607 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:01:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:44,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:01:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:44,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:01:44,745 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:01:44,745 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [274845515] [2021-05-02 23:01:44,745 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [274845515] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:01:44,745 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:01:44,746 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-02 23:01:44,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892349537] [2021-05-02 23:01:44,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 23:01:44,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:01:44,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 23:01:44,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-05-02 23:01:44,748 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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) [2021-05-02 23:01:44,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:01:44,818 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2021-05-02 23:01:44,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:01:44,818 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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 [2021-05-02 23:01:44,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:01:44,819 INFO L225 Difference]: With dead ends: 46 [2021-05-02 23:01:44,819 INFO L226 Difference]: Without dead ends: 31 [2021-05-02 23:01:44,820 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 70.5ms TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-05-02 23:01:44,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-05-02 23:01:44,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2021-05-02 23:01:44,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:01:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2021-05-02 23:01:44,829 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2021-05-02 23:01:44,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:01:44,829 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-05-02 23:01:44,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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) [2021-05-02 23:01:44,829 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2021-05-02 23:01:44,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-05-02 23:01:44,830 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:01:44,831 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:01:44,831 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 23:01:44,831 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:01:44,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:01:44,831 INFO L82 PathProgramCache]: Analyzing trace with hash -963535868, now seen corresponding path program 4 times [2021-05-02 23:01:44,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:01:44,832 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2071407598] [2021-05-02 23:01:44,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:01:44,841 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:01:44,842 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:01:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:44,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:01:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:44,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:01:44,990 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:01:44,991 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2071407598] [2021-05-02 23:01:44,991 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2071407598] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:01:44,991 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:01:44,991 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 23:01:44,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083797870] [2021-05-02 23:01:44,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 23:01:44,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:01:44,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 23:01:44,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:01:44,995 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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) [2021-05-02 23:01:45,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:01:45,136 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2021-05-02 23:01:45,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 23:01:45,136 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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 25 [2021-05-02 23:01:45,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:01:45,137 INFO L225 Difference]: With dead ends: 48 [2021-05-02 23:01:45,138 INFO L226 Difference]: Without dead ends: 33 [2021-05-02 23:01:45,138 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 122.3ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-05-02 23:01:45,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-05-02 23:01:45,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2021-05-02 23:01:45,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:01:45,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2021-05-02 23:01:45,145 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 25 [2021-05-02 23:01:45,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:01:45,145 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2021-05-02 23:01:45,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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) [2021-05-02 23:01:45,146 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2021-05-02 23:01:45,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-02 23:01:45,146 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:01:45,146 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:01:45,146 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-02 23:01:45,146 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:01:45,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:01:45,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1300001602, now seen corresponding path program 5 times [2021-05-02 23:01:45,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:01:45,147 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1566124204] [2021-05-02 23:01:45,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:01:45,159 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:01:45,160 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:01:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:45,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:01:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:45,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:01:45,240 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:01:45,240 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1566124204] [2021-05-02 23:01:45,240 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1566124204] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:01:45,241 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:01:45,241 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:01:45,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568435242] [2021-05-02 23:01:45,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:01:45,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:01:45,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:01:45,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:01:45,241 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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) [2021-05-02 23:01:45,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:01:45,329 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2021-05-02 23:01:45,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 23:01:45,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 27 [2021-05-02 23:01:45,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:01:45,330 INFO L225 Difference]: With dead ends: 46 [2021-05-02 23:01:45,330 INFO L226 Difference]: Without dead ends: 35 [2021-05-02 23:01:45,331 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 71.3ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-05-02 23:01:45,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-05-02 23:01:45,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2021-05-02 23:01:45,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:01:45,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2021-05-02 23:01:45,338 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 27 [2021-05-02 23:01:45,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:01:45,338 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2021-05-02 23:01:45,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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) [2021-05-02 23:01:45,339 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2021-05-02 23:01:45,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-02 23:01:45,339 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:01:45,340 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:01:45,340 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 23:01:45,340 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:01:45,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:01:45,340 INFO L82 PathProgramCache]: Analyzing trace with hash -537357632, now seen corresponding path program 6 times [2021-05-02 23:01:45,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:01:45,340 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [196250486] [2021-05-02 23:01:45,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:01:45,345 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:01:45,346 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:01:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:45,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:01:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:45,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:01:45,468 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:01:45,468 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [196250486] [2021-05-02 23:01:45,468 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [196250486] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:01:45,468 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:01:45,468 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-02 23:01:45,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831246038] [2021-05-02 23:01:45,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 23:01:45,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:01:45,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 23:01:45,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-05-02 23:01:45,470 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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) [2021-05-02 23:01:45,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:01:45,589 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2021-05-02 23:01:45,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 23:01:45,589 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 29 [2021-05-02 23:01:45,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:01:45,590 INFO L225 Difference]: With dead ends: 48 [2021-05-02 23:01:45,590 INFO L226 Difference]: Without dead ends: 37 [2021-05-02 23:01:45,592 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 102.8ms TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-05-02 23:01:45,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-05-02 23:01:45,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2021-05-02 23:01:45,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:01:45,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2021-05-02 23:01:45,600 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 29 [2021-05-02 23:01:45,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:01:45,601 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2021-05-02 23:01:45,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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) [2021-05-02 23:01:45,601 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2021-05-02 23:01:45,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-02 23:01:45,603 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:01:45,603 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:01:45,604 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-02 23:01:45,605 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:01:45,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:01:45,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1008022850, now seen corresponding path program 7 times [2021-05-02 23:01:45,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:01:45,606 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1228317352] [2021-05-02 23:01:45,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:01:45,611 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:01:45,612 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:01:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:45,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:01:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:45,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:01:45,767 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:01:45,767 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1228317352] [2021-05-02 23:01:45,767 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1228317352] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:01:45,767 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:01:45,767 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 23:01:45,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337010038] [2021-05-02 23:01:45,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 23:01:45,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:01:45,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 23:01:45,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:01:45,768 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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) [2021-05-02 23:01:45,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:01:45,922 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2021-05-02 23:01:45,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:01:45,923 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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 31 [2021-05-02 23:01:45,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:01:45,923 INFO L225 Difference]: With dead ends: 50 [2021-05-02 23:01:45,923 INFO L226 Difference]: Without dead ends: 39 [2021-05-02 23:01:45,924 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 146.9ms TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-05-02 23:01:45,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-05-02 23:01:45,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2021-05-02 23:01:45,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:01:45,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2021-05-02 23:01:45,929 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 31 [2021-05-02 23:01:45,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:01:45,929 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2021-05-02 23:01:45,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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) [2021-05-02 23:01:45,929 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2021-05-02 23:01:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-05-02 23:01:45,930 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:01:45,930 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:01:45,930 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-02 23:01:45,930 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:01:45,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:01:45,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1949236028, now seen corresponding path program 8 times [2021-05-02 23:01:45,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:01:45,930 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [887589567] [2021-05-02 23:01:45,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:01:45,943 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:01:45,952 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:01:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:46,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:01:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:46,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:01:46,088 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:01:46,088 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [887589567] [2021-05-02 23:01:46,088 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [887589567] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:01:46,088 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:01:46,088 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-02 23:01:46,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730835310] [2021-05-02 23:01:46,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 23:01:46,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:01:46,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 23:01:46,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:01:46,089 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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) [2021-05-02 23:01:46,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:01:46,350 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2021-05-02 23:01:46,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 23:01:46,350 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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 33 [2021-05-02 23:01:46,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:01:46,352 INFO L225 Difference]: With dead ends: 67 [2021-05-02 23:01:46,352 INFO L226 Difference]: Without dead ends: 56 [2021-05-02 23:01:46,352 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 188.5ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-05-02 23:01:46,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-05-02 23:01:46,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2021-05-02 23:01:46,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:01:46,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2021-05-02 23:01:46,359 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 33 [2021-05-02 23:01:46,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:01:46,360 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2021-05-02 23:01:46,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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) [2021-05-02 23:01:46,360 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2021-05-02 23:01:46,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-02 23:01:46,360 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:01:46,360 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:01:46,360 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-02 23:01:46,360 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:01:46,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:01:46,361 INFO L82 PathProgramCache]: Analyzing trace with hash 606667834, now seen corresponding path program 9 times [2021-05-02 23:01:46,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:01:46,361 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [596984914] [2021-05-02 23:01:46,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:01:46,365 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:01:46,366 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:01:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:46,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:01:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:46,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:01:46,968 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:01:46,968 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [596984914] [2021-05-02 23:01:46,968 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [596984914] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:01:46,968 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:01:46,968 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-02 23:01:46,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916104228] [2021-05-02 23:01:46,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-02 23:01:46,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:01:46,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-02 23:01:46,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-05-02 23:01:46,969 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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) [2021-05-02 23:01:48,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:01:48,111 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2021-05-02 23:01:48,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-02 23:01:48,112 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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 35 [2021-05-02 23:01:48,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:01:48,113 INFO L225 Difference]: With dead ends: 70 [2021-05-02 23:01:48,113 INFO L226 Difference]: Without dead ends: 68 [2021-05-02 23:01:48,113 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1233.6ms TimeCoverageRelationStatistics Valid=234, Invalid=1098, Unknown=0, NotChecked=0, Total=1332 [2021-05-02 23:01:48,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-05-02 23:01:48,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2021-05-02 23:01:48,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 23:01:48,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2021-05-02 23:01:48,121 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 35 [2021-05-02 23:01:48,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:01:48,122 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2021-05-02 23:01:48,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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) [2021-05-02 23:01:48,122 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2021-05-02 23:01:48,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-02 23:01:48,122 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:01:48,122 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:01:48,123 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-02 23:01:48,123 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:01:48,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:01:48,123 INFO L82 PathProgramCache]: Analyzing trace with hash 758259348, now seen corresponding path program 1 times [2021-05-02 23:01:48,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:01:48,123 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1511021448] [2021-05-02 23:01:48,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:01:48,127 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:01:48,128 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:01:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:48,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:01:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:48,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-05-02 23:01:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:48,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:01:48,807 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:01:48,807 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1511021448] [2021-05-02 23:01:48,807 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1511021448] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:01:48,807 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:01:48,807 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-02 23:01:48,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517043999] [2021-05-02 23:01:48,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-02 23:01:48,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:01:48,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-02 23:01:48,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2021-05-02 23:01:48,808 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 20 states have internal predecessors, (34), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:01:49,364 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2021-05-02 23:01:50,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:01:50,312 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2021-05-02 23:01:50,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-02 23:01:50,312 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 20 states have internal predecessors, (34), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2021-05-02 23:01:50,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:01:50,313 INFO L225 Difference]: With dead ends: 66 [2021-05-02 23:01:50,313 INFO L226 Difference]: Without dead ends: 64 [2021-05-02 23:01:50,314 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1606.0ms TimeCoverageRelationStatistics Valid=240, Invalid=1320, Unknown=0, NotChecked=0, Total=1560 [2021-05-02 23:01:50,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-05-02 23:01:50,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2021-05-02 23:01:50,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 45 states have internal predecessors, (47), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-02 23:01:50,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2021-05-02 23:01:50,323 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 43 [2021-05-02 23:01:50,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:01:50,323 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2021-05-02 23:01:50,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 20 states have internal predecessors, (34), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:01:50,323 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2021-05-02 23:01:50,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-05-02 23:01:50,324 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:01:50,324 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:01:50,324 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-02 23:01:50,324 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:01:50,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:01:50,324 INFO L82 PathProgramCache]: Analyzing trace with hash 814759662, now seen corresponding path program 2 times [2021-05-02 23:01:50,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:01:50,325 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [298118809] [2021-05-02 23:01:50,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:01:50,329 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:01:50,330 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:01:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:51,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:01:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:51,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-05-02 23:01:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:51,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-05-02 23:01:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:51,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:01:51,385 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:01:51,385 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [298118809] [2021-05-02 23:01:51,385 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [298118809] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:01:51,385 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:01:51,385 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-02 23:01:51,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236539243] [2021-05-02 23:01:51,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-02 23:01:51,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:01:51,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-02 23:01:51,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2021-05-02 23:01:51,387 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 25 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 23 states have internal predecessors, (34), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 23:01:53,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:01:53,094 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2021-05-02 23:01:53,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-02 23:01:53,095 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 23 states have internal predecessors, (34), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2021-05-02 23:01:53,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:01:53,096 INFO L225 Difference]: With dead ends: 84 [2021-05-02 23:01:53,096 INFO L226 Difference]: Without dead ends: 82 [2021-05-02 23:01:53,097 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 1992.5ms TimeCoverageRelationStatistics Valid=357, Invalid=1805, Unknown=0, NotChecked=0, Total=2162 [2021-05-02 23:01:53,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-05-02 23:01:53,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2021-05-02 23:01:53,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 59 states have internal predecessors, (61), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2021-05-02 23:01:53,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2021-05-02 23:01:53,111 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 51 [2021-05-02 23:01:53,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:01:53,111 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2021-05-02 23:01:53,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 23 states have internal predecessors, (34), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 23:01:53,111 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2021-05-02 23:01:53,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-05-02 23:01:53,112 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:01:53,112 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:01:53,113 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-02 23:01:53,113 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:01:53,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:01:53,113 INFO L82 PathProgramCache]: Analyzing trace with hash -131775380, now seen corresponding path program 3 times [2021-05-02 23:01:53,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:01:53,113 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1956380113] [2021-05-02 23:01:53,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:01:53,117 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:01:53,118 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:01:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:53,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:01:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:53,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-05-02 23:01:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:53,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-02 23:01:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:53,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:01:53,259 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:01:53,259 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1956380113] [2021-05-02 23:01:53,259 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1956380113] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:01:53,260 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:01:53,260 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-02 23:01:53,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770677887] [2021-05-02 23:01:53,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 23:01:53,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:01:53,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 23:01:53,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:01:53,260 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:01:53,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:01:53,433 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2021-05-02 23:01:53,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 23:01:53,433 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2021-05-02 23:01:53,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:01:53,434 INFO L225 Difference]: With dead ends: 100 [2021-05-02 23:01:53,434 INFO L226 Difference]: Without dead ends: 73 [2021-05-02 23:01:53,434 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 139.6ms TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2021-05-02 23:01:53,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-05-02 23:01:53,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 62. [2021-05-02 23:01:53,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.04) internal successors, (52), 51 states have internal predecessors, (52), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-02 23:01:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2021-05-02 23:01:53,445 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 53 [2021-05-02 23:01:53,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:01:53,446 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2021-05-02 23:01:53,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:01:53,446 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2021-05-02 23:01:53,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-05-02 23:01:53,447 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:01:53,448 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:01:53,448 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-02 23:01:53,448 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:01:53,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:01:53,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1545771704, now seen corresponding path program 4 times [2021-05-02 23:01:53,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:01:53,449 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1990662736] [2021-05-02 23:01:53,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:01:53,452 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:01:53,453 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:01:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:54,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:01:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:54,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-05-02 23:01:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:54,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-05-02 23:01:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:54,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-05-02 23:01:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:54,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:01:54,837 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:01:54,837 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1990662736] [2021-05-02 23:01:54,837 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1990662736] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:01:54,837 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:01:54,837 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-02 23:01:54,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062970511] [2021-05-02 23:01:54,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-02 23:01:54,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:01:54,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-02 23:01:54,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2021-05-02 23:01:54,838 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 30 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 28 states have internal predecessors, (43), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-02 23:01:56,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:01:56,597 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2021-05-02 23:01:56,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-02 23:01:56,599 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 28 states have internal predecessors, (43), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 59 [2021-05-02 23:01:56,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:01:56,600 INFO L225 Difference]: With dead ends: 74 [2021-05-02 23:01:56,600 INFO L226 Difference]: Without dead ends: 72 [2021-05-02 23:01:56,601 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 2414.3ms TimeCoverageRelationStatistics Valid=298, Invalid=2782, Unknown=0, NotChecked=0, Total=3080 [2021-05-02 23:01:56,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-05-02 23:01:56,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2021-05-02 23:01:56,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-05-02 23:01:56,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2021-05-02 23:01:56,630 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 59 [2021-05-02 23:01:56,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:01:56,630 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2021-05-02 23:01:56,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 28 states have internal predecessors, (43), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-02 23:01:56,630 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2021-05-02 23:01:56,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-02 23:01:56,631 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:01:56,631 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:01:56,631 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-02 23:01:56,631 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:01:56,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:01:56,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1028419166, now seen corresponding path program 5 times [2021-05-02 23:01:56,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:01:56,632 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1304934992] [2021-05-02 23:01:56,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:01:56,636 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:01:56,636 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:01:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:58,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:01:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:58,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-05-02 23:01:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:58,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-05-02 23:01:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:58,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-05-02 23:01:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:58,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-05-02 23:01:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:01:58,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:01:58,491 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:01:58,491 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1304934992] [2021-05-02 23:01:58,491 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1304934992] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:01:58,491 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:01:58,491 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-02 23:01:58,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560747008] [2021-05-02 23:01:58,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-02 23:01:58,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:01:58,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-02 23:01:58,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2021-05-02 23:01:58,493 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 33 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-02 23:02:01,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:01,370 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2021-05-02 23:02:01,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-02 23:02:01,371 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 67 [2021-05-02 23:02:01,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:01,373 INFO L225 Difference]: With dead ends: 83 [2021-05-02 23:02:01,373 INFO L226 Difference]: Without dead ends: 81 [2021-05-02 23:02:01,374 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 3592.5ms TimeCoverageRelationStatistics Valid=357, Invalid=3549, Unknown=0, NotChecked=0, Total=3906 [2021-05-02 23:02:01,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-05-02 23:02:01,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2021-05-02 23:02:01,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.032258064516129) internal successors, (64), 63 states have internal predecessors, (64), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-05-02 23:02:01,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2021-05-02 23:02:01,394 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 67 [2021-05-02 23:02:01,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:01,394 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2021-05-02 23:02:01,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-02 23:02:01,395 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2021-05-02 23:02:01,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-05-02 23:02:01,395 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:01,395 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:01,395 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-02 23:02:01,395 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:01,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:01,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1901280260, now seen corresponding path program 6 times [2021-05-02 23:02:01,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:01,398 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [314292400] [2021-05-02 23:02:01,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:01,402 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:01,403 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:01,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:01,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-05-02 23:02:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:01,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-05-02 23:02:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:01,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-05-02 23:02:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:01,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-05-02 23:02:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:01,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-05-02 23:02:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:01,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:01,591 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:01,591 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [314292400] [2021-05-02 23:02:01,591 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [314292400] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:01,591 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:01,591 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-02 23:02:01,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985884449] [2021-05-02 23:02:01,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 23:02:01,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:01,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 23:02:01,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:02:01,592 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-05-02 23:02:01,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:01,801 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2021-05-02 23:02:01,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 23:02:01,801 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 75 [2021-05-02 23:02:01,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:01,801 INFO L225 Difference]: With dead ends: 134 [2021-05-02 23:02:01,801 INFO L226 Difference]: Without dead ends: 0 [2021-05-02 23:02:01,802 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 106.3ms TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:02:01,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-02 23:02:01,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-02 23:02:01,802 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) [2021-05-02 23:02:01,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-02 23:02:01,803 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2021-05-02 23:02:01,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:01,803 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-02 23:02:01,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-05-02 23:02:01,803 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-02 23:02:01,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-02 23:02:01,803 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-02 23:02:01,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-02 23:02:02,013 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 230 [2021-05-02 23:02:02,651 WARN L205 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 42 [2021-05-02 23:02:02,906 WARN L205 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 21 [2021-05-02 23:02:04,289 WARN L205 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 231 DAG size of output: 152 [2021-05-02 23:02:05,194 WARN L205 SmtUtils]: Spent 816.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 113 [2021-05-02 23:02:06,080 WARN L205 SmtUtils]: Spent 872.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 112 [2021-05-02 23:02:06,838 WARN L205 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 101 [2021-05-02 23:02:07,665 WARN L205 SmtUtils]: Spent 799.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 114 [2021-05-02 23:02:08,263 WARN L205 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 102 [2021-05-02 23:02:08,265 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2021-05-02 23:02:08,265 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2021-05-02 23:02:08,265 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2021-05-02 23:02:08,265 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-02 23:02:08,265 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2021-05-02 23:02:08,265 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-02 23:02:08,265 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-02 23:02:08,266 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-02 23:02:08,266 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-02 23:02:08,266 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-02 23:02:08,266 INFO L194 CegarLoopUtils]: At program point L33(line 33) the Hoare annotation is: (let ((.cse8 (select |#memory_int| |main_~#str1~0.base|)) (.cse22 (+ |main_~#str1~0.offset| main_~i~0))) (let ((.cse27 (+ main_~max~0 4294967295)) (.cse24 (select |#memory_int| |main_~#str2~0.base|)) (.cse16 (+ main_~j~0 |main_~#str2~0.offset|)) (.cse28 (select .cse8 .cse22))) (let ((.cse23 (select .cse8 2)) (.cse21 (store .cse24 .cse16 .cse28)) (.cse31 (div .cse27 4294967296))) (let ((.cse20 (select .cse8 (+ |main_~#str1~0.offset| 3))) (.cse7 (+ main_~i~0 (* 4294967296 .cse31))) (.cse25 (select .cse8 1)) (.cse9 (select .cse24 0)) (.cse29 (select .cse8 (+ |main_~#str1~0.offset| 4))) (.cse26 (* .cse31 4294967296)) (.cse30 (* .cse31 (- 4294967296))) (.cse15 (= .cse23 (select .cse21 2)))) (let ((.cse2 (or .cse15 (<= 1 .cse22))) (.cse0 (= (select .cse8 0) (select .cse24 (+ |main_~#str1~0.offset| main_~max~0 .cse30 4294967295)))) (.cse4 (or (not (= .cse22 0)) (= (+ main_~i~0 main_~j~0 |main_~#str2~0.offset| .cse26) (+ |main_~#str1~0.offset| main_~max~0 4294967295)))) (.cse19 (= .cse9 .cse29)) (.cse5 (= (select .cse24 (+ |main_~#str1~0.offset| main_~max~0 .cse30 4294967294)) .cse25)) (.cse1 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse3 (<= main_~max~0 5)) (.cse6 (<= 5 main_~max~0)) (.cse17 (= (select .cse21 0) .cse29)) (.cse18 (= (select .cse24 .cse16) .cse28)) (.cse10 (= |main_#t~mem14| |main_#t~mem13|)) (.cse11 (<= 4294967296 .cse7)) (.cse12 (= |main_~#str2~0.offset| 0)) (.cse13 (= |main_~#str1~0.offset| 0)) (.cse14 (= .cse20 (select .cse24 1)))) (or (and .cse0 (<= main_~j~0 1) .cse1 .cse2 .cse3 .cse4 (<= 1 main_~j~0) .cse5 .cse6 (<= .cse7 (+ main_~max~0 4294967294)) (= (select .cse8 (+ |main_~#str1~0.offset| main_~i~0 1)) .cse9) .cse10 .cse11 .cse12 (<= 3 main_~i~0) .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse3 (<= main_~j~0 3) (<= .cse7 4294967297) .cse4 .cse6 (<= 3 .cse16) .cse17 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= main_~i~0 4) .cse19 .cse5 .cse6 .cse18 .cse10 .cse11 .cse12 .cse13 (<= main_~max~0 (+ main_~i~0 1)) .cse14) (and .cse0 (= .cse20 (select .cse21 1)) .cse1 .cse3 .cse4 (<= main_~j~0 2) .cse19 .cse5 .cse6 (<= 2 .cse16) (<= 2 .cse22) .cse18 .cse10 .cse11 .cse12 .cse13 (<= .cse7 (+ main_~max~0 4294967293))) (and (= .cse23 (select .cse24 2)) .cse1 .cse3 (= (select .cse24 (+ |main_~#str1~0.offset| main_~j~0 (- 1))) .cse25) (= (+ main_~i~0 main_~j~0 .cse26) .cse27) .cse6 (<= 4 main_~j~0) .cse17 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14))))))) [2021-05-02 23:02:08,267 INFO L194 CegarLoopUtils]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse44 (+ main_~max~0 4294967295))) (let ((.cse42 (div .cse44 4294967296))) (let ((.cse8 (select |#memory_int| |main_~#str1~0.base|)) (.cse18 (+ |main_~#str1~0.offset| main_~i~0)) (.cse43 (* 4294967296 .cse42)) (.cse46 (+ main_~max~0 2147483648))) (let ((.cse33 (< .cse43 .cse46)) (.cse34 (<= .cse46 .cse43)) (.cse41 (* .cse42 4294967296)) (.cse21 (select |#memory_int| |main_~#str2~0.base|)) (.cse13 (+ main_~j~0 |main_~#str2~0.offset|)) (.cse45 (select .cse8 .cse18))) (let ((.cse35 (select .cse8 2)) (.cse17 (store .cse21 .cse13 .cse45)) (.cse10 (<= 3 main_~i~0)) (.cse11 (<= main_~i~0 3)) (.cse0 (<= main_~i~0 4)) (.cse28 (= (select .cse21 .cse13) .cse45)) (.cse29 (= |main_#t~mem14| |main_#t~mem13|)) (.cse23 (or (and .cse33 (= (+ main_~i~0 main_~j~0 .cse41 1) main_~max~0)) (and .cse34 (= (+ main_~i~0 main_~j~0 .cse41) .cse44)))) (.cse30 (<= main_~i~0 1)) (.cse31 (<= 2 main_~i~0)) (.cse32 (<= main_~i~0 2)) (.cse15 (+ main_~i~0 .cse43)) (.cse26 (* .cse42 (- 4294967296)))) (let ((.cse16 (select .cse8 (+ |main_~#str1~0.offset| 3))) (.cse20 (let ((.cse36 (= (select .cse8 0) (select .cse21 (+ |main_~#str1~0.offset| main_~max~0 .cse26 4294967295)))) (.cse37 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse38 (<= 5 main_~max~0)) (.cse39 (<= main_~max~0 5)) (.cse40 (<= 4294967296 .cse15))) (or (and .cse36 .cse37 .cse38 .cse39 .cse40 .cse10 .cse11) (and .cse0 .cse36 .cse37 .cse38 (<= 4 main_~i~0) .cse39 .cse40) (and .cse37 (= main_~i~0 0) .cse38 .cse28 .cse39 .cse29 .cse40 .cse23) (and .cse36 .cse37 .cse38 .cse39 .cse40 (or (not (= .cse18 0)) (= (+ main_~i~0 main_~j~0 |main_~#str2~0.offset| .cse41) (+ |main_~#str1~0.offset| main_~max~0 4294967295)))) (and .cse36 .cse37 (<= 1 main_~i~0) .cse38 .cse39 .cse40 .cse30) (and .cse36 .cse31 .cse37 .cse38 .cse32 .cse39 .cse40)))) (.cse22 (select .cse8 1)) (.cse12 (= .cse35 (select .cse17 2))) (.cse9 (select .cse21 0)) (.cse24 (select .cse8 (+ |main_~#str1~0.offset| 4))) (.cse19 (= .cse35 (select .cse21 2))) (.cse27 (<= 1 .cse18))) (let ((.cse1 (or .cse19 .cse27)) (.cse2 (= .cse9 .cse24)) (.cse3 (or .cse12 .cse27)) (.cse5 (let ((.cse25 (or (and .cse33 (= (select .cse21 (+ |main_~#str1~0.offset| main_~max~0 .cse26 (- 2))) .cse22)) (and .cse34 (= (select .cse21 (+ |main_~#str1~0.offset| main_~max~0 .cse26 4294967294)) .cse22))))) (or (and .cse20 .cse25 (or (= (select .cse17 (+ |main_~#str1~0.offset| (* main_~i~0 (- 1)) main_~max~0 .cse26 4294967294)) .cse22) .cse27)) (and .cse20 .cse25 .cse28 .cse29 .cse30) (and .cse31 .cse20 .cse25 .cse32) (and .cse20 .cse25 .cse10 .cse11)))) (.cse14 (= (select .cse17 0) .cse24)) (.cse4 (= |main_~#str2~0.offset| 0)) (.cse6 (= |main_~#str1~0.offset| 0)) (.cse7 (= .cse16 (select .cse21 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= main_~max~0 (+ main_~i~0 1)) .cse6 .cse7) (and (<= 1 main_~j~0) .cse1 (<= main_~j~0 1) (= (select .cse8 (+ |main_~#str1~0.offset| main_~i~0 1)) .cse9) .cse3 .cse4 .cse5 .cse10 .cse6 .cse7 .cse11) (and .cse12 (<= 3 .cse13) .cse14 (<= main_~j~0 3) .cse5 .cse4 .cse6 .cse7 (<= .cse15 4294967297)) (and .cse1 (<= main_~j~0 2) (= .cse16 (select .cse17 1)) .cse2 (<= 2 .cse13) (<= 2 .cse18) .cse3 .cse5 .cse4 .cse6 (<= .cse15 (+ main_~max~0 4294967293))) (and .cse19 (<= 4 main_~j~0) .cse20 .cse14 (= (select .cse21 (+ |main_~#str1~0.offset| main_~j~0 (- 1))) .cse22) .cse4 .cse23 .cse6 .cse7))))))))) [2021-05-02 23:02:08,267 INFO L194 CegarLoopUtils]: At program point mainEXIT(lines 13 36) the Hoare annotation is: (and (<= 0 main_~i~0) (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= main_~max~0 5)) [2021-05-02 23:02:08,267 INFO L194 CegarLoopUtils]: At program point mainFINAL(lines 13 36) the Hoare annotation is: (and (<= 0 main_~i~0) (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= main_~max~0 5)) [2021-05-02 23:02:08,267 INFO L194 CegarLoopUtils]: At program point L32-2(lines 32 35) the Hoare annotation is: (let ((.cse27 (div (+ main_~max~0 4294967295) 4294967296)) (.cse2 (+ |main_~#str1~0.offset| main_~i~0)) (.cse16 (select |#memory_int| |main_~#str1~0.base|))) (let ((.cse19 (+ main_~j~0 |main_~#str2~0.offset|)) (.cse15 (select .cse16 1)) (.cse20 (select .cse16 .cse2)) (.cse14 (= main_~i~0 0)) (.cse5 (+ main_~i~0 (* 4294967296 .cse27))) (.cse21 (* .cse27 (- 4294967296))) (.cse10 (select .cse16 2)) (.cse17 (select |#memory_int| |main_~#str2~0.base|))) (let ((.cse13 (= .cse10 (select .cse17 2))) (.cse7 (let ((.cse23 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse22 (select .cse17 (+ |main_~#str1~0.offset| main_~max~0 .cse21 4294967295))) (.cse24 (<= 5 main_~max~0)) (.cse25 (<= main_~max~0 5)) (.cse26 (<= 4294967296 .cse5))) (or (and (= (select .cse16 0) .cse22) .cse23 .cse24 .cse25 .cse26) (and .cse23 (= .cse22 .cse20) .cse14 .cse24 .cse25 .cse26)))) (.cse8 (= (select .cse17 (+ |main_~#str1~0.offset| main_~max~0 .cse21 4294967294)) .cse15)) (.cse18 (select .cse16 (+ |main_~#str1~0.offset| 4))) (.cse11 (select .cse17 .cse19))) (let ((.cse6 (= (select .cse16 (+ |main_~#str1~0.offset| main_~i~0 1)) .cse11)) (.cse9 (= (select (store .cse17 .cse19 .cse20) 0) .cse18)) (.cse0 (or (and .cse13 .cse7 .cse8) (and .cse7 .cse8 (<= 1 .cse2)))) (.cse1 (= (select .cse17 0) .cse18)) (.cse3 (= |main_~#str2~0.offset| 0)) (.cse4 (= |main_~#str1~0.offset| 0)) (.cse12 (= (select .cse16 (+ |main_~#str1~0.offset| 3)) (select .cse17 1)))) (or (and (<= 1 main_~j~0) .cse0 (<= main_~j~0 1) .cse1 (<= 2 .cse2) .cse3 .cse4 (<= .cse5 (+ main_~max~0 4294967293)) .cse6) (and (<= main_~j~0 2) .cse7 .cse8 .cse9 (= .cse10 .cse11) (<= 2 main_~j~0) .cse3 .cse4 .cse12 (<= .cse5 4294967297) (<= (+ main_~max~0 4294967292) .cse5)) (and .cse0 .cse1 .cse3 (<= 3 main_~i~0) .cse4 .cse12 (<= main_~i~0 3) .cse6) (and (<= 3 main_~j~0) .cse13 .cse7 .cse14 .cse9 (<= main_~j~0 3) .cse3 .cse4 .cse12 (= .cse15 .cse11)) (and (<= main_~i~0 4) .cse0 .cse1 .cse3 .cse4 .cse12 (<= main_~max~0 (+ main_~i~0 1)))))))) [2021-05-02 23:02:08,267 INFO L194 CegarLoopUtils]: At program point mainENTRY(lines 13 36) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-05-02 23:02:08,267 INFO L194 CegarLoopUtils]: At program point L32-3(lines 32 35) the Hoare annotation is: (let ((.cse22 (select |#memory_int| |main_~#str1~0.base|)) (.cse26 (+ |main_~#str1~0.offset| main_~i~0))) (let ((.cse21 (+ main_~max~0 4294967295)) (.cse18 (select |#memory_int| |main_~#str2~0.base|)) (.cse7 (+ main_~j~0 |main_~#str2~0.offset|)) (.cse27 (select .cse22 .cse26))) (let ((.cse17 (select .cse22 2)) (.cse25 (store .cse18 .cse7 .cse27)) (.cse30 (div .cse21 4294967296))) (let ((.cse24 (select .cse22 (+ |main_~#str1~0.offset| 3))) (.cse4 (+ main_~i~0 (* 4294967296 .cse30))) (.cse19 (select .cse22 1)) (.cse23 (select .cse18 0)) (.cse20 (* .cse30 4294967296)) (.cse1 (= .cse17 (select .cse25 2))) (.cse28 (* .cse30 (- 4294967296))) (.cse29 (select .cse22 (+ |main_~#str1~0.offset| 4)))) (let ((.cse8 (= (select .cse25 0) .cse29)) (.cse0 (= (select .cse22 0) (select .cse18 (+ |main_~#str1~0.offset| main_~max~0 .cse28 4294967295)))) (.cse2 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse14 (or .cse1 (<= 1 .cse26))) (.cse3 (<= main_~max~0 5)) (.cse5 (or (not (= .cse26 0)) (= (+ main_~i~0 main_~j~0 |main_~#str2~0.offset| .cse20) (+ |main_~#str1~0.offset| main_~max~0 4294967295)))) (.cse15 (= .cse23 .cse29)) (.cse16 (= (select .cse18 (+ |main_~#str1~0.offset| main_~max~0 .cse28 4294967294)) .cse19)) (.cse6 (<= 5 main_~max~0)) (.cse9 (= (select .cse18 .cse7) .cse27)) (.cse10 (<= 4294967296 .cse4)) (.cse11 (= |main_~#str2~0.offset| 0)) (.cse12 (= |main_~#str1~0.offset| 0)) (.cse13 (= .cse24 (select .cse18 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= main_~j~0 3) (<= .cse4 4294967297) .cse5 .cse6 (<= 3 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 (<= main_~max~0 main_~i~0) .cse2 .cse14 .cse3 .cse5 (<= (div main_~i~0 4294967296) 0) .cse15 .cse16 .cse6 .cse10 .cse11 .cse12 .cse13) (and (= .cse17 (select .cse18 2)) .cse2 .cse3 (= (select .cse18 (+ |main_~#str1~0.offset| main_~j~0 (- 1))) .cse19) (= (+ main_~i~0 main_~j~0 .cse20) .cse21) .cse6 (<= 4 main_~j~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 (<= main_~j~0 1) .cse2 .cse14 .cse3 .cse5 (<= 1 main_~j~0) .cse16 .cse6 (<= .cse4 (+ main_~max~0 4294967294)) (= (select .cse22 (+ |main_~#str1~0.offset| main_~i~0 1)) .cse23) .cse10 .cse11 (<= 3 main_~i~0) .cse12 .cse13) (and .cse0 (= .cse24 (select .cse25 1)) .cse2 .cse3 .cse5 (<= main_~j~0 2) .cse15 .cse16 .cse6 (<= 2 .cse7) (<= 2 .cse26) .cse9 .cse10 .cse11 .cse12 (<= .cse4 (+ main_~max~0 4294967293))) (and .cse0 .cse2 .cse14 .cse3 .cse5 (<= main_~i~0 4) .cse15 .cse16 .cse6 .cse9 .cse10 .cse11 .cse12 (<= main_~max~0 (+ main_~i~0 1)) .cse13))))))) [2021-05-02 23:02:08,267 INFO L194 CegarLoopUtils]: At program point L32-4(lines 32 35) the Hoare annotation is: (and (<= 0 main_~i~0) (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= main_~max~0 5)) [2021-05-02 23:02:08,268 INFO L194 CegarLoopUtils]: At program point L26-2(lines 26 29) the Hoare annotation is: (let ((.cse21 (div (+ main_~max~0 4294967295) 4294967296)) (.cse6 (select |#memory_int| |main_~#str2~0.base|)) (.cse19 (select |#memory_int| |main_~#str1~0.base|))) (let ((.cse4 (select .cse19 (+ |main_~#str1~0.offset| 3))) (.cse15 (select .cse6 1)) (.cse20 (* 4294967296 .cse21)) (.cse16 (select .cse6 0))) (let ((.cse10 (<= main_~max~0 5)) (.cse14 (+ main_~j~0 |main_~#str2~0.offset|)) (.cse0 (select .cse19 2)) (.cse17 (select .cse6 2)) (.cse2 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse3 (= .cse16 (select .cse19 (+ |main_~#str1~0.offset| 4)))) (.cse8 (select .cse19 (+ |main_~#str1~0.offset| main_~i~0))) (.cse5 (let ((.cse22 (+ main_~max~0 2147483648)) (.cse23 (+ main_~i~0 main_~j~0 (* .cse21 4294967296)))) (or (and (< .cse20 .cse22) (= .cse23 main_~max~0)) (and (<= .cse22 .cse20) (= .cse23 (+ main_~max~0 4294967296)))))) (.cse7 (* .cse21 (- 4294967296))) (.cse9 (<= 5 main_~max~0)) (.cse11 (= |main_~#str2~0.offset| 0)) (.cse12 (= |main_~#str1~0.offset| 0)) (.cse18 (= .cse4 .cse15)) (.cse13 (+ main_~i~0 .cse20))) (or (let ((.cse1 (store .cse6 .cse14 .cse8))) (and (= .cse0 (select .cse1 2)) .cse2 .cse3 (= .cse4 (select .cse1 1)) .cse5 (= (select .cse6 (+ |main_~#str1~0.offset| (* main_~i~0 (- 1)) main_~max~0 .cse7 4294967295)) .cse8) .cse9 .cse10 .cse11 .cse12 (<= main_~i~0 1) (<= (+ main_~max~0 4294967292) .cse13))) (and .cse2 .cse3 .cse5 .cse9 (= .cse15 .cse8) (<= .cse13 (+ main_~max~0 4294967294)) .cse10 .cse11 (<= main_~max~0 (+ main_~i~0 2)) .cse12) (and .cse2 (= .cse16 .cse8) .cse5 .cse10 .cse11 .cse12 (< 0 .cse14) (<= 4294967300 .cse13)) (and (= .cse17 .cse8) .cse2 .cse3 .cse5 .cse9 (<= main_~i~0 2) .cse11 (<= main_~max~0 (+ main_~i~0 3)) .cse18 .cse12) (and (<= (+ main_~max~0 4294967291) .cse13) (= .cse0 .cse17) .cse2 .cse3 (= (select .cse6 (+ |main_~#str1~0.offset| main_~max~0 .cse7 4294967295)) .cse8) .cse5 (= (select .cse6 (+ |main_~#str1~0.offset| main_~max~0 .cse7 4294967294)) (select .cse19 1)) .cse9 .cse11 .cse12 .cse18 (<= .cse13 4294967296)))))) [2021-05-02 23:02:08,268 INFO L194 CegarLoopUtils]: At program point L26-3(lines 26 29) the Hoare annotation is: (let ((.cse19 (+ main_~max~0 4294967295))) (let ((.cse17 (select |#memory_int| |main_~#str2~0.base|)) (.cse5 (+ main_~j~0 |main_~#str2~0.offset|)) (.cse16 (select |#memory_int| |main_~#str1~0.base|)) (.cse23 (div .cse19 4294967296))) (let ((.cse20 (* 4294967296 .cse23)) (.cse24 (select .cse16 (+ |main_~#str1~0.offset| 3))) (.cse25 (select .cse16 (+ |main_~#str1~0.offset| 4))) (.cse18 (select .cse16 2)) (.cse11 (store .cse17 .cse5 (select .cse16 (+ |main_~#str1~0.offset| main_~i~0))))) (let ((.cse0 (= .cse18 (select .cse11 2))) (.cse4 (= (select .cse11 0) .cse25)) (.cse6 (<= main_~max~0 5)) (.cse2 (= .cse24 (select .cse11 1))) (.cse15 (= (select .cse17 0) .cse25)) (.cse12 (* .cse23 (- 4294967296))) (.cse13 (select .cse16 1)) (.cse3 (<= 5 main_~max~0)) (.cse14 (= .cse24 (select .cse17 1))) (.cse8 (let ((.cse21 (+ main_~max~0 2147483648)) (.cse22 (* .cse23 4294967296))) (or (and (< .cse20 .cse21) (= (+ main_~i~0 main_~j~0 .cse22 1) main_~max~0)) (and (<= .cse21 .cse20) (= (+ main_~i~0 main_~j~0 .cse22) .cse19))))) (.cse1 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse7 (= |main_~#str2~0.offset| 0)) (.cse9 (= |main_~#str1~0.offset| 0)) (.cse10 (+ main_~i~0 .cse20))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 3 .cse5) .cse6 .cse7 .cse8 .cse9 (<= (+ main_~max~0 4294967292) .cse10)) (and (<= (+ main_~max~0 4294967291) .cse10) .cse0 .cse1 .cse3 .cse4 (= (select .cse11 (+ |main_~#str1~0.offset| (* main_~i~0 (- 1)) main_~max~0 .cse12 4294967294)) .cse13) .cse7 .cse8 .cse9 .cse14 (<= .cse10 4294967296)) (and .cse1 .cse3 .cse4 (<= .cse10 (+ main_~max~0 4294967294)) .cse6 .cse7 (<= main_~max~0 (+ main_~i~0 2)) .cse8 .cse9) (and .cse1 .cse2 .cse15 (<= 2 .cse5) .cse3 (<= .cse5 2) (<= main_~i~0 2) (<= main_~max~0 (+ main_~i~0 3)) .cse8 .cse9) (and (= (select .cse16 0) (select .cse17 (+ |main_~#str1~0.offset| main_~max~0 .cse12 4294967295))) (= .cse18 (select .cse17 2)) .cse1 .cse15 (= (select .cse17 (+ |main_~#str1~0.offset| main_~max~0 .cse12 4294967294)) .cse13) .cse3 (<= .cse10 4294967295) (<= (+ main_~max~0 4294967290) .cse10) .cse7 .cse14 .cse8 .cse9) (and (<= .cse10 4294967300) .cse1 (= main_~j~0 0) .cse7 (<= .cse10 .cse19) .cse9 (<= main_~max~0 (+ main_~i~0 1)) (<= 4294967300 .cse10))))))) [2021-05-02 23:02:08,268 INFO L194 CegarLoopUtils]: At program point L26-4(lines 26 29) the Hoare annotation is: (let ((.cse4 (+ main_~max~0 4294967295))) (let ((.cse3 (div .cse4 4294967296))) (let ((.cse2 (* .cse3 (- 4294967296))) (.cse5 (+ main_~i~0 (* 4294967296 .cse3))) (.cse0 (select |#memory_int| |main_~#str1~0.base|)) (.cse1 (select |#memory_int| |main_~#str2~0.base|))) (and (= (select .cse0 0) (select .cse1 (+ |main_~#str1~0.offset| main_~max~0 .cse2 4294967295))) (= (select .cse0 2) (select .cse1 2)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select .cse1 0) (select .cse0 (+ |main_~#str1~0.offset| 4))) (= (select .cse1 (+ |main_~#str1~0.offset| main_~max~0 .cse2 4294967294)) (select .cse0 1)) (= (+ main_~i~0 main_~j~0 (* .cse3 4294967296)) .cse4) (<= 5 main_~max~0) (<= .cse5 4294967295) (<= (+ main_~max~0 4294967290) .cse5) (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (= (select .cse0 (+ |main_~#str1~0.offset| 3)) (select .cse1 1)))))) [2021-05-02 23:02:08,268 INFO L194 CegarLoopUtils]: At program point L18-2(lines 18 20) the Hoare annotation is: (and (<= main_~i~0 4) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 5 main_~max~0) (<= 0 main_~i~0) (<= main_~max~0 5) (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0)) [2021-05-02 23:02:08,268 INFO L194 CegarLoopUtils]: At program point L18-3(lines 18 20) the Hoare annotation is: (let ((.cse0 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse1 (<= 5 main_~max~0)) (.cse2 (<= main_~max~0 5)) (.cse3 (= |main_~#str2~0.offset| 0)) (.cse4 (= |main_~#str1~0.offset| 0)) (.cse5 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 4294967300 .cse5) (<= (div main_~i~0 4294967296) 0)) (let ((.cse6 (+ main_~i~0 2))) (and .cse0 (<= .cse6 main_~max~0) (<= main_~max~0 .cse6) .cse3 (<= 3 main_~i~0) .cse4 (<= main_~i~0 3))) (and .cse0 .cse1 (<= main_~i~0 2) (<= main_~max~0 (+ main_~i~0 3)) .cse3 .cse4) (and .cse0 .cse1 (<= 0 main_~i~0) .cse2 .cse3 .cse4 (<= .cse5 4294967297)))) [2021-05-02 23:02:08,268 INFO L194 CegarLoopUtils]: At program point L18-4(lines 18 20) the Hoare annotation is: (and (<= main_~max~0 main_~i~0) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 5 main_~max~0) (<= main_~max~0 5) (= |main_~#str2~0.offset| 0) (= |main_~#str1~0.offset| 0) (<= (div main_~i~0 4294967296) 0)) [2021-05-02 23:02:08,268 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2021-05-02 23:02:08,268 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-05-02 23:02:08,269 INFO L194 CegarLoopUtils]: At program point L7(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-02 23:02:08,269 INFO L194 CegarLoopUtils]: At program point L6(lines 6 8) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-05-02 23:02:08,269 INFO L194 CegarLoopUtils]: At program point L6-2(lines 5 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-05-02 23:02:08,269 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-02 23:02:08,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 11:02:08 BoogieIcfgContainer [2021-05-02 23:02:08,297 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 23:02:08,297 INFO L168 Benchmark]: Toolchain (without parser) took 25688.62 ms. Allocated memory was 183.5 MB in the beginning and 471.9 MB in the end (delta: 288.4 MB). Free memory was 148.7 MB in the beginning and 181.3 MB in the end (delta: -32.6 MB). Peak memory consumption was 267.6 MB. Max. memory is 8.0 GB. [2021-05-02 23:02:08,297 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 183.5 MB. Free memory is still 165.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 23:02:08,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.67 ms. Allocated memory is still 183.5 MB. Free memory was 148.5 MB in the beginning and 166.8 MB in the end (delta: -18.4 MB). Peak memory consumption was 12.7 MB. Max. memory is 8.0 GB. [2021-05-02 23:02:08,297 INFO L168 Benchmark]: Boogie Preprocessor took 44.39 ms. Allocated memory is still 183.5 MB. Free memory was 166.5 MB in the beginning and 165.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-02 23:02:08,297 INFO L168 Benchmark]: RCFGBuilder took 406.43 ms. Allocated memory is still 183.5 MB. Free memory was 165.1 MB in the beginning and 149.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2021-05-02 23:02:08,298 INFO L168 Benchmark]: TraceAbstraction took 24979.82 ms. Allocated memory was 183.5 MB in the beginning and 471.9 MB in the end (delta: 288.4 MB). Free memory was 148.7 MB in the beginning and 181.3 MB in the end (delta: -32.6 MB). Peak memory consumption was 267.5 MB. Max. memory is 8.0 GB. [2021-05-02 23:02:08,298 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.11 ms. Allocated memory is still 183.5 MB. Free memory is still 165.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 251.67 ms. Allocated memory is still 183.5 MB. Free memory was 148.5 MB in the beginning and 166.8 MB in the end (delta: -18.4 MB). Peak memory consumption was 12.7 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 44.39 ms. Allocated memory is still 183.5 MB. Free memory was 166.5 MB in the beginning and 165.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 406.43 ms. Allocated memory is still 183.5 MB. Free memory was 165.1 MB in the beginning and 149.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 24979.82 ms. Allocated memory was 183.5 MB in the beginning and 471.9 MB in the end (delta: 288.4 MB). Free memory was 148.7 MB in the beginning and 181.3 MB in the end (delta: -32.6 MB). Peak memory consumption was 267.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: 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 5 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 18427.6ms, OverallIterations: 17, TraceHistogramMax: 6, EmptinessCheckTime: 18.6ms, AutomataDifference: 10650.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 6461.3ms, InitialAbstractionConstructionTime: 6.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 326 SDtfs, 508 SDslu, 785 SDs, 0 SdLazy, 5090 SolverSat, 738 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2957.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 431 GetRequests, 98 SyntacticMatches, 4 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2380 ImplicationChecksByTransitivity, 11997.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=16, InterpolantAutomatonStates: 243, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 184.0ms AutomataMinimizationTime, 17 MinimizatonAttempts, 83 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 27 LocationsWithAnnotation, 165 PreInvPairs, 225 NumberOfFragments, 12867 HoareAnnotationTreeSize, 165 FomulaSimplifications, 72158 FormulaSimplificationTreeSizeReduction, 488.2ms HoareSimplificationTime, 27 FomulaSimplificationsInter, 1901730 FormulaSimplificationTreeSizeReductionInter, 5956.6ms 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 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((((((((((((((unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][2] && !(str1 == str2)) && unknown-#memory_int-unknown[str1][str1 + 3] == unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][1]) && 5 <= max) && unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][0] == unknown-#memory_int-unknown[str1][str1 + 4]) && 3 <= j + str2) && max <= 5) && str2 == 0) && ((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && i + j + (max + 4294967295) / 4294967296 * 4294967296 + 1 == max) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && i + j + (max + 4294967295) / 4294967296 * 4294967296 == max + 4294967295))) && str1 == 0) && max + 4294967292 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) || ((((((((((max + 4294967291 <= i + 4294967296 * ((max + 4294967295) / 4294967296) && unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][2]) && !(str1 == str2)) && 5 <= max) && unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][0] == unknown-#memory_int-unknown[str1][str1 + 4]) && unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][str1 + i * -1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967294] == unknown-#memory_int-unknown[str1][1]) && str2 == 0) && ((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && i + j + (max + 4294967295) / 4294967296 * 4294967296 + 1 == max) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && i + j + (max + 4294967295) / 4294967296 * 4294967296 == max + 4294967295))) && str1 == 0) && unknown-#memory_int-unknown[str1][str1 + 3] == unknown-#memory_int-unknown[str2][1]) && i + 4294967296 * ((max + 4294967295) / 4294967296) <= 4294967296)) || ((((((((!(str1 == str2) && 5 <= max) && unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][0] == unknown-#memory_int-unknown[str1][str1 + 4]) && i + 4294967296 * ((max + 4294967295) / 4294967296) <= max + 4294967294) && max <= 5) && str2 == 0) && max <= i + 2) && ((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && i + j + (max + 4294967295) / 4294967296 * 4294967296 + 1 == max) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && i + j + (max + 4294967295) / 4294967296 * 4294967296 == max + 4294967295))) && str1 == 0)) || (((((((((!(str1 == str2) && unknown-#memory_int-unknown[str1][str1 + 3] == unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][1]) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4]) && 2 <= j + str2) && 5 <= max) && j + str2 <= 2) && i <= 2) && max <= i + 3) && ((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && i + j + (max + 4294967295) / 4294967296 * 4294967296 + 1 == max) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && i + j + (max + 4294967295) / 4294967296 * 4294967296 == max + 4294967295))) && str1 == 0)) || (((((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][2]) && !(str1 == str2)) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4]) && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967294] == unknown-#memory_int-unknown[str1][1]) && 5 <= max) && i + 4294967296 * ((max + 4294967295) / 4294967296) <= 4294967295) && max + 4294967290 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && str2 == 0) && unknown-#memory_int-unknown[str1][str1 + 3] == unknown-#memory_int-unknown[str2][1]) && ((4294967296 * ((max + 4294967295) / 4294967296) < max + 2147483648 && i + j + (max + 4294967295) / 4294967296 * 4294967296 + 1 == max) || (max + 2147483648 <= 4294967296 * ((max + 4294967295) / 4294967296) && i + j + (max + 4294967295) / 4294967296 * 4294967296 == max + 4294967295))) && str1 == 0)) || (((((((i + 4294967296 * ((max + 4294967295) / 4294967296) <= 4294967300 && !(str1 == str2)) && j == 0) && str2 == 0) && i + 4294967296 * ((max + 4294967295) / 4294967296) <= max + 4294967295) && str1 == 0) && max <= i + 1) && 4294967300 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((((((((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][2]) && !(str1 == str2)) && max <= 5) && j <= 3) && i + 4294967296 * ((max + 4294967295) / 4294967296) <= 4294967297) && (!(str1 + i == 0) || i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 == str1 + max + 4294967295)) && 5 <= max) && 3 <= j + str2) && unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][0] == unknown-#memory_int-unknown[str1][str1 + 4]) && unknown-#memory_int-unknown[str2][j + str2] == unknown-#memory_int-unknown[str1][str1 + i]) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && str2 == 0) && str1 == 0) && unknown-#memory_int-unknown[str1][str1 + 3] == unknown-#memory_int-unknown[str2][1]) || (((((((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && max <= i) && !(str1 == str2)) && (unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][2] || 1 <= str1 + i)) && max <= 5) && (!(str1 + i == 0) || i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 == str1 + max + 4294967295)) && i / 4294967296 <= 0) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4]) && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967294] == unknown-#memory_int-unknown[str1][1]) && 5 <= max) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && str2 == 0) && str1 == 0) && unknown-#memory_int-unknown[str1][str1 + 3] == unknown-#memory_int-unknown[str2][1])) || ((((((((((((unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][2] && !(str1 == str2)) && max <= 5) && unknown-#memory_int-unknown[str2][str1 + j + -1] == unknown-#memory_int-unknown[str1][1]) && i + j + (max + 4294967295) / 4294967296 * 4294967296 == max + 4294967295) && 5 <= max) && 4 <= j) && unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][0] == unknown-#memory_int-unknown[str1][str1 + 4]) && unknown-#memory_int-unknown[str2][j + str2] == unknown-#memory_int-unknown[str1][str1 + i]) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && str2 == 0) && str1 == 0) && unknown-#memory_int-unknown[str1][str1 + 3] == unknown-#memory_int-unknown[str2][1])) || (((((((((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && j <= 1) && !(str1 == str2)) && (unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][2] || 1 <= str1 + i)) && max <= 5) && (!(str1 + i == 0) || i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 == str1 + max + 4294967295)) && 1 <= j) && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967294] == unknown-#memory_int-unknown[str1][1]) && 5 <= max) && i + 4294967296 * ((max + 4294967295) / 4294967296) <= max + 4294967294) && unknown-#memory_int-unknown[str1][str1 + i + 1] == unknown-#memory_int-unknown[str2][0]) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && str2 == 0) && 3 <= i) && str1 == 0) && unknown-#memory_int-unknown[str1][str1 + 3] == unknown-#memory_int-unknown[str2][1])) || (((((((((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && unknown-#memory_int-unknown[str1][str1 + 3] == unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][1]) && !(str1 == str2)) && max <= 5) && (!(str1 + i == 0) || i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 == str1 + max + 4294967295)) && j <= 2) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4]) && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967294] == unknown-#memory_int-unknown[str1][1]) && 5 <= max) && 2 <= j + str2) && 2 <= str1 + i) && unknown-#memory_int-unknown[str2][j + str2] == unknown-#memory_int-unknown[str1][str1 + i]) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && str2 == 0) && str1 == 0) && i + 4294967296 * ((max + 4294967295) / 4294967296) <= max + 4294967293)) || ((((((((((((((unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967295] && !(str1 == str2)) && (unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][j + str2 := unknown-#memory_int-unknown[str1][str1 + i]][2] || 1 <= str1 + i)) && max <= 5) && (!(str1 + i == 0) || i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296 == str1 + max + 4294967295)) && i <= 4) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4]) && unknown-#memory_int-unknown[str2][str1 + max + (max + 4294967295) / 4294967296 * -4294967296 + 4294967294] == unknown-#memory_int-unknown[str1][1]) && 5 <= max) && unknown-#memory_int-unknown[str2][j + str2] == unknown-#memory_int-unknown[str1][str1 + i]) && 4294967296 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && str2 == 0) && str1 == 0) && max <= i + 1) && unknown-#memory_int-unknown[str1][str1 + 3] == unknown-#memory_int-unknown[str2][1]) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((((((((!(str1 == str2) && 5 <= max) && max <= 5) && str2 == 0) && str1 == 0) && 4294967300 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && i / 4294967296 <= 0) || ((((((!(str1 == str2) && i + 2 <= max) && max <= i + 2) && str2 == 0) && 3 <= i) && str1 == 0) && i <= 3)) || (((((!(str1 == str2) && 5 <= max) && i <= 2) && max <= i + 3) && str2 == 0) && str1 == 0)) || ((((((!(str1 == str2) && 5 <= max) && 0 <= i) && max <= 5) && str2 == 0) && str1 == 0) && i + 4294967296 * ((max + 4294967295) / 4294967296) <= 4294967297) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: (0 <= i && 0 < (max + 4294967295) / 4294967296) && max <= 5 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! Received shutdown request...