java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label44.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 21:59:37,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 21:59:37,813 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 21:59:37,826 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 21:59:37,826 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 21:59:37,828 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 21:59:37,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 21:59:37,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 21:59:37,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 21:59:37,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 21:59:37,834 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 21:59:37,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 21:59:37,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 21:59:37,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 21:59:37,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 21:59:37,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 21:59:37,840 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 21:59:37,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 21:59:37,843 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 21:59:37,845 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 21:59:37,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 21:59:37,850 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 21:59:37,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 21:59:37,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 21:59:37,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 21:59:37,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 21:59:37,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 21:59:37,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 21:59:37,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 21:59:37,863 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 21:59:37,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 21:59:37,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 21:59:37,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 21:59:37,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 21:59:37,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 21:59:37,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 21:59:37,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 21:59:37,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 21:59:37,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 21:59:37,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 21:59:37,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 21:59:37,871 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 21:59:37,885 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 21:59:37,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 21:59:37,887 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 21:59:37,887 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 21:59:37,887 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 21:59:37,887 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 21:59:37,888 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 21:59:37,888 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 21:59:37,888 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 21:59:37,888 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 21:59:37,888 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 21:59:37,889 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 21:59:37,889 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 21:59:37,889 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 21:59:37,889 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 21:59:37,889 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 21:59:37,890 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 21:59:37,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 21:59:37,890 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 21:59:37,890 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 21:59:37,890 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 21:59:37,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 21:59:37,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 21:59:37,891 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 21:59:37,891 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 21:59:37,891 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 21:59:37,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 21:59:37,892 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 21:59:37,892 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 21:59:38,168 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 21:59:38,188 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 21:59:38,192 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 21:59:38,193 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 21:59:38,194 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 21:59:38,195 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label44.c [2019-10-14 21:59:38,276 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8f24b79a/3ed232f3e8b143069a5f131ffa54aca7/FLAG1742d1b16 [2019-10-14 21:59:38,917 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 21:59:38,919 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label44.c [2019-10-14 21:59:38,937 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8f24b79a/3ed232f3e8b143069a5f131ffa54aca7/FLAG1742d1b16 [2019-10-14 21:59:39,165 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8f24b79a/3ed232f3e8b143069a5f131ffa54aca7 [2019-10-14 21:59:39,176 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 21:59:39,177 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 21:59:39,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 21:59:39,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 21:59:39,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 21:59:39,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:59:39" (1/1) ... [2019-10-14 21:59:39,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6af509e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:59:39, skipping insertion in model container [2019-10-14 21:59:39,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:59:39" (1/1) ... [2019-10-14 21:59:39,194 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 21:59:39,257 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 21:59:40,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:59:40,057 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 21:59:40,268 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:59:40,290 INFO L192 MainTranslator]: Completed translation [2019-10-14 21:59:40,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:59:40 WrapperNode [2019-10-14 21:59:40,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 21:59:40,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 21:59:40,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 21:59:40,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 21:59:40,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:59:40" (1/1) ... [2019-10-14 21:59:40,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:59:40" (1/1) ... [2019-10-14 21:59:40,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:59:40" (1/1) ... [2019-10-14 21:59:40,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:59:40" (1/1) ... [2019-10-14 21:59:40,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:59:40" (1/1) ... [2019-10-14 21:59:40,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:59:40" (1/1) ... [2019-10-14 21:59:40,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:59:40" (1/1) ... [2019-10-14 21:59:40,464 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 21:59:40,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 21:59:40,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 21:59:40,465 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 21:59:40,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:59:40" (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 [2019-10-14 21:59:40,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 21:59:40,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 21:59:40,532 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-14 21:59:40,532 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 21:59:40,532 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-14 21:59:40,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 21:59:40,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 21:59:40,533 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 21:59:40,533 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 21:59:40,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 21:59:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 21:59:42,401 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 21:59:42,401 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 21:59:42,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:59:42 BoogieIcfgContainer [2019-10-14 21:59:42,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 21:59:42,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 21:59:42,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 21:59:42,411 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 21:59:42,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:59:39" (1/3) ... [2019-10-14 21:59:42,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ad55d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:59:42, skipping insertion in model container [2019-10-14 21:59:42,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:59:40" (2/3) ... [2019-10-14 21:59:42,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ad55d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:59:42, skipping insertion in model container [2019-10-14 21:59:42,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:59:42" (3/3) ... [2019-10-14 21:59:42,429 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label44.c [2019-10-14 21:59:42,445 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 21:59:42,456 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 21:59:42,471 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 21:59:42,522 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 21:59:42,523 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 21:59:42,525 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 21:59:42,525 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 21:59:42,526 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 21:59:42,526 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 21:59:42,526 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 21:59:42,526 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 21:59:42,574 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2019-10-14 21:59:42,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 21:59:42,583 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:59:42,584 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:59:42,586 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:59:42,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:59:42,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1276641867, now seen corresponding path program 1 times [2019-10-14 21:59:42,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:59:42,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559061206] [2019-10-14 21:59:42,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:59:42,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:59:42,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:59:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:59:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:59:43,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:59:43,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559061206] [2019-10-14 21:59:43,043 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:59:43,044 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:59:43,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885923815] [2019-10-14 21:59:43,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:59:43,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:59:43,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:59:43,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:59:43,074 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 5 states. [2019-10-14 21:59:46,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:59:46,760 INFO L93 Difference]: Finished difference Result 987 states and 1769 transitions. [2019-10-14 21:59:46,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 21:59:46,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-14 21:59:46,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:59:46,787 INFO L225 Difference]: With dead ends: 987 [2019-10-14 21:59:46,787 INFO L226 Difference]: Without dead ends: 626 [2019-10-14 21:59:46,798 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-14 21:59:46,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-14 21:59:46,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 426. [2019-10-14 21:59:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-10-14 21:59:46,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 611 transitions. [2019-10-14 21:59:46,916 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 611 transitions. Word has length 32 [2019-10-14 21:59:46,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:59:46,917 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 611 transitions. [2019-10-14 21:59:46,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:59:46,917 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 611 transitions. [2019-10-14 21:59:46,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-14 21:59:46,922 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:59:46,922 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:59:46,923 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:59:46,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:59:46,923 INFO L82 PathProgramCache]: Analyzing trace with hash 201462154, now seen corresponding path program 1 times [2019-10-14 21:59:46,924 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:59:46,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779476336] [2019-10-14 21:59:46,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:59:46,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:59:46,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:59:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:59:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:59:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:59:47,269 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:59:47,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779476336] [2019-10-14 21:59:47,270 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:59:47,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 21:59:47,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254495461] [2019-10-14 21:59:47,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 21:59:47,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:59:47,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 21:59:47,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-14 21:59:47,274 INFO L87 Difference]: Start difference. First operand 426 states and 611 transitions. Second operand 9 states. [2019-10-14 21:59:50,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:59:50,616 INFO L93 Difference]: Finished difference Result 1652 states and 2455 transitions. [2019-10-14 21:59:50,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 21:59:50,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-10-14 21:59:50,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:59:50,637 INFO L225 Difference]: With dead ends: 1652 [2019-10-14 21:59:50,637 INFO L226 Difference]: Without dead ends: 1232 [2019-10-14 21:59:50,641 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-10-14 21:59:50,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-10-14 21:59:50,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1203. [2019-10-14 21:59:50,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-10-14 21:59:50,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1684 transitions. [2019-10-14 21:59:50,730 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1684 transitions. Word has length 104 [2019-10-14 21:59:50,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:59:50,731 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 1684 transitions. [2019-10-14 21:59:50,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 21:59:50,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1684 transitions. [2019-10-14 21:59:50,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 21:59:50,739 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:59:50,739 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:59:50,739 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:59:50,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:59:50,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1596761827, now seen corresponding path program 1 times [2019-10-14 21:59:50,740 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:59:50,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706560505] [2019-10-14 21:59:50,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:59:50,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:59:50,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:59:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:59:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:59:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:59:51,170 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:59:51,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706560505] [2019-10-14 21:59:51,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895892448] [2019-10-14 21:59:51,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:59:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:59:51,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-14 21:59:51,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:59:51,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 21:59:51,412 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:59:51,413 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 21:59:51,413 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2019-10-14 21:59:51,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729476364] [2019-10-14 21:59:51,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:59:51,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:59:51,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:59:51,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-14 21:59:51,415 INFO L87 Difference]: Start difference. First operand 1203 states and 1684 transitions. Second operand 5 states. [2019-10-14 21:59:53,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:59:53,116 INFO L93 Difference]: Finished difference Result 3024 states and 4222 transitions. [2019-10-14 21:59:53,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 21:59:53,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-14 21:59:53,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:59:53,134 INFO L225 Difference]: With dead ends: 3024 [2019-10-14 21:59:53,134 INFO L226 Difference]: Without dead ends: 1827 [2019-10-14 21:59:53,138 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-10-14 21:59:53,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2019-10-14 21:59:53,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1797. [2019-10-14 21:59:53,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2019-10-14 21:59:53,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2349 transitions. [2019-10-14 21:59:53,216 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2349 transitions. Word has length 105 [2019-10-14 21:59:53,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:59:53,216 INFO L462 AbstractCegarLoop]: Abstraction has 1797 states and 2349 transitions. [2019-10-14 21:59:53,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:59:53,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2349 transitions. [2019-10-14 21:59:53,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-14 21:59:53,219 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:59:53,219 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:59:53,431 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:59:53,431 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:59:53,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:59:53,432 INFO L82 PathProgramCache]: Analyzing trace with hash -741406572, now seen corresponding path program 1 times [2019-10-14 21:59:53,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:59:53,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411920195] [2019-10-14 21:59:53,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:59:53,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:59:53,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:59:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:59:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:59:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:59:53,768 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:59:53,768 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411920195] [2019-10-14 21:59:53,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434233944] [2019-10-14 21:59:53,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:59:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:59:53,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 21:59:53,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:59:53,908 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:59:53,908 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 21:59:53,908 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-10-14 21:59:53,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313742649] [2019-10-14 21:59:53,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 21:59:53,911 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:59:53,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 21:59:53,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-14 21:59:53,912 INFO L87 Difference]: Start difference. First operand 1797 states and 2349 transitions. Second operand 3 states. [2019-10-14 21:59:54,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:59:54,960 INFO L93 Difference]: Finished difference Result 3984 states and 5326 transitions. [2019-10-14 21:59:54,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 21:59:54,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-10-14 21:59:54,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:59:54,972 INFO L225 Difference]: With dead ends: 3984 [2019-10-14 21:59:54,972 INFO L226 Difference]: Without dead ends: 2381 [2019-10-14 21:59:54,977 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-14 21:59:54,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states. [2019-10-14 21:59:55,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 2180. [2019-10-14 21:59:55,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2180 states. [2019-10-14 21:59:55,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 2818 transitions. [2019-10-14 21:59:55,037 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 2818 transitions. Word has length 163 [2019-10-14 21:59:55,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:59:55,038 INFO L462 AbstractCegarLoop]: Abstraction has 2180 states and 2818 transitions. [2019-10-14 21:59:55,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 21:59:55,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 2818 transitions. [2019-10-14 21:59:55,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-14 21:59:55,042 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:59:55,042 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:59:55,246 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:59:55,246 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:59:55,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:59:55,247 INFO L82 PathProgramCache]: Analyzing trace with hash 478710564, now seen corresponding path program 1 times [2019-10-14 21:59:55,247 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:59:55,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710269098] [2019-10-14 21:59:55,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:59:55,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:59:55,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:59:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:59:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:59:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:59:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:59:55,676 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 93 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 21:59:55,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710269098] [2019-10-14 21:59:55,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242943407] [2019-10-14 21:59:55,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:59:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:59:55,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-14 21:59:55,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:59:55,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:59:55,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:59:55,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:59:55,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:59:55,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:59:55,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:59:55,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:59:55,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:59:55,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:59:55,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:59:55,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:59:55,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:59:55,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:59:55,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:59:55,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:59:55,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:59:55,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:59:55,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:59:55,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:59:55,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:59:55,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:59:55,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:59:55,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:59:55,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:59:55,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:59:55,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:59:57,981 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a23~0_479 Int)) (let ((.cse1 (div (* v_~a23~0_479 9) 10))) (let ((.cse0 (mod (+ .cse1 29) 90))) (and (not (= .cse0 0)) (< (+ .cse1 58980) 0) (<= 0 (* 9 v_~a23~0_479)) (<= |c_old(~a23~0)| v_~a23~0_479) (<= (+ c_~a23~0 42) .cse0) (not (= (mod (+ .cse1 30) 90) 0)) (< (+ .cse1 58979) 0))))) (exists ((v_~a23~0_479 Int)) (let ((.cse3 (* v_~a23~0_479 9))) (let ((.cse2 (div .cse3 10))) (let ((.cse4 (mod (+ .cse2 30) 90))) (and (< (+ .cse2 58980) 0) (not (= 0 (mod .cse3 10))) (<= |c_old(~a23~0)| v_~a23~0_479) (<= (+ c_~a23~0 42) .cse4) (< (* 9 v_~a23~0_479) 0) (not (= .cse4 0)) (= (mod (+ .cse2 29) 90) 0)))))) (exists ((v_~a23~0_479 Int)) (let ((.cse7 (* v_~a23~0_479 9))) (let ((.cse6 (div .cse7 10))) (let ((.cse5 (mod (+ .cse6 29) 90))) (and (<= c_~a23~0 (+ .cse5 48)) (<= 0 (+ .cse6 58980)) (<= |c_old(~a23~0)| v_~a23~0_479) (= .cse5 0) (= 0 (mod .cse7 10))))))) (exists ((v_~a23~0_479 Int)) (let ((.cse9 (* v_~a23~0_479 9))) (let ((.cse8 (div .cse9 10))) (let ((.cse10 (mod (+ .cse8 30) 90))) (and (not (= (mod (+ .cse8 29) 90) 0)) (< (+ .cse8 58980) 0) (not (= 0 (mod .cse9 10))) (<= |c_old(~a23~0)| v_~a23~0_479) (<= (+ c_~a23~0 42) .cse10) (< (* 9 v_~a23~0_479) 0) (not (= .cse10 0)) (< (+ .cse8 58979) 0)))))) (exists ((v_~a23~0_479 Int)) (let ((.cse12 (div (* v_~a23~0_479 9) 10))) (let ((.cse11 (mod (+ .cse12 29) 90))) (and (<= c_~a23~0 (+ .cse11 48)) (<= 0 (* 9 v_~a23~0_479)) (<= 0 (+ .cse12 58980)) (<= |c_old(~a23~0)| v_~a23~0_479) (= .cse11 0))))) (exists ((v_~a23~0_479 Int)) (let ((.cse14 (* v_~a23~0_479 9))) (let ((.cse13 (div .cse14 10))) (and (<= c_~a23~0 (+ (mod (+ .cse13 29) 90) 48)) (<= 0 (+ .cse13 58979)) (= (mod (+ .cse13 30) 90) 0) (<= |c_old(~a23~0)| v_~a23~0_479) (= 0 (mod .cse14 10)))))) (exists ((v_~a23~0_479 Int)) (let ((.cse17 (* v_~a23~0_479 9))) (let ((.cse16 (div .cse17 10))) (let ((.cse15 (mod (+ .cse16 29) 90))) (and (not (= .cse15 0)) (= (mod (+ .cse16 30) 90) 0) (<= |c_old(~a23~0)| v_~a23~0_479) (<= (+ c_~a23~0 42) .cse15) (< (+ .cse16 58979) 0) (= 0 (mod .cse17 10))))))) (exists ((v_~a23~0_479 Int)) (let ((.cse20 (* v_~a23~0_479 9))) (let ((.cse19 (div .cse20 10))) (let ((.cse18 (mod (+ .cse19 29) 90))) (and (<= c_~a23~0 (+ .cse18 48)) (< (+ .cse19 58980) 0) (<= |c_old(~a23~0)| v_~a23~0_479) (not (= (mod (+ .cse19 30) 90) 0)) (= .cse18 0) (= 0 (mod .cse20 10))))))) (exists ((v_~a23~0_479 Int)) (let ((.cse22 (* v_~a23~0_479 9))) (let ((.cse23 (div .cse22 10))) (let ((.cse21 (mod (+ .cse23 30) 90))) (and (= .cse21 0) (not (= 0 (mod .cse22 10))) (<= |c_old(~a23~0)| v_~a23~0_479) (< (* 9 v_~a23~0_479) 0) (= (mod (+ .cse23 29) 90) 0) (<= c_~a23~0 (+ .cse21 48))))))) (exists ((v_~a23~0_479 Int)) (let ((.cse25 (div (* v_~a23~0_479 9) 10))) (let ((.cse24 (mod (+ .cse25 29) 90))) (and (not (= .cse24 0)) (= (mod (+ .cse25 30) 90) 0) (<= 0 (* 9 v_~a23~0_479)) (<= |c_old(~a23~0)| v_~a23~0_479) (<= (+ c_~a23~0 42) .cse24) (< (+ .cse25 58979) 0))))) (exists ((v_~a23~0_479 Int)) (let ((.cse27 (div (* v_~a23~0_479 9) 10))) (let ((.cse26 (mod (+ .cse27 29) 90))) (and (<= c_~a23~0 (+ .cse26 48)) (< (+ .cse27 58980) 0) (<= 0 (* 9 v_~a23~0_479)) (<= |c_old(~a23~0)| v_~a23~0_479) (not (= (mod (+ .cse27 30) 90) 0)) (= .cse26 0))))) (exists ((v_~a23~0_479 Int)) (let ((.cse30 (* v_~a23~0_479 9))) (let ((.cse29 (div .cse30 10))) (let ((.cse28 (mod (+ .cse29 29) 90))) (and (not (= .cse28 0)) (<= 0 (+ .cse29 58980)) (<= |c_old(~a23~0)| v_~a23~0_479) (<= (+ c_~a23~0 42) .cse28) (< (+ .cse29 58979) 0) (= 0 (mod .cse30 10))))))) (exists ((v_~a23~0_479 Int)) (let ((.cse33 (* v_~a23~0_479 9))) (let ((.cse32 (div .cse33 10))) (let ((.cse31 (mod (+ .cse32 29) 90))) (and (<= c_~a23~0 (+ .cse31 48)) (= (mod (+ .cse32 30) 90) 0) (<= |c_old(~a23~0)| v_~a23~0_479) (= .cse31 0) (= 0 (mod .cse33 10))))))) (exists ((v_~a23~0_479 Int)) (let ((.cse35 (* v_~a23~0_479 9))) (let ((.cse34 (div .cse35 10))) (and (<= c_~a23~0 (+ (mod (+ .cse34 29) 90) 48)) (<= 0 (+ .cse34 58979)) (< (+ .cse34 58980) 0) (<= |c_old(~a23~0)| v_~a23~0_479) (not (= (mod (+ .cse34 30) 90) 0)) (= 0 (mod .cse35 10)))))) (exists ((v_~a23~0_479 Int)) (let ((.cse36 (div (* v_~a23~0_479 9) 10))) (and (<= c_~a23~0 (+ (mod (+ .cse36 29) 90) 48)) (<= 0 (+ .cse36 58979)) (<= 0 (* 9 v_~a23~0_479)) (<= 0 (+ .cse36 58980)) (<= |c_old(~a23~0)| v_~a23~0_479)))) (exists ((v_~a23~0_479 Int)) (let ((.cse38 (* v_~a23~0_479 9))) (let ((.cse37 (div .cse38 10))) (let ((.cse39 (mod (+ .cse37 30) 90))) (and (<= 0 (+ .cse37 58979)) (< (+ .cse37 58980) 0) (not (= 0 (mod .cse38 10))) (<= |c_old(~a23~0)| v_~a23~0_479) (<= (+ c_~a23~0 42) .cse39) (< (* 9 v_~a23~0_479) 0) (not (= .cse39 0))))))) (exists ((v_~a23~0_479 Int)) (let ((.cse42 (* v_~a23~0_479 9))) (let ((.cse41 (div .cse42 10))) (let ((.cse40 (mod (+ .cse41 29) 90))) (and (not (= .cse40 0)) (< (+ .cse41 58980) 0) (<= |c_old(~a23~0)| v_~a23~0_479) (<= (+ c_~a23~0 42) .cse40) (not (= (mod (+ .cse41 30) 90) 0)) (< (+ .cse41 58979) 0) (= 0 (mod .cse42 10))))))) (exists ((v_~a23~0_479 Int)) (let ((.cse43 (div (* v_~a23~0_479 9) 10))) (and (<= c_~a23~0 (+ (mod (+ .cse43 29) 90) 48)) (<= 0 (+ .cse43 58979)) (< (+ .cse43 58980) 0) (<= 0 (* 9 v_~a23~0_479)) (<= |c_old(~a23~0)| v_~a23~0_479) (not (= (mod (+ .cse43 30) 90) 0))))) (exists ((v_~a23~0_479 Int)) (let ((.cse46 (* v_~a23~0_479 9))) (let ((.cse44 (div .cse46 10))) (let ((.cse45 (mod (+ .cse44 30) 90))) (and (not (= (mod (+ .cse44 29) 90) 0)) (= .cse45 0) (not (= 0 (mod .cse46 10))) (<= |c_old(~a23~0)| v_~a23~0_479) (< (* 9 v_~a23~0_479) 0) (< (+ .cse44 58979) 0) (<= c_~a23~0 (+ .cse45 48))))))) (exists ((v_~a23~0_479 Int)) (let ((.cse48 (div (* v_~a23~0_479 9) 10))) (let ((.cse47 (mod (+ .cse48 29) 90))) (and (<= c_~a23~0 (+ .cse47 48)) (= (mod (+ .cse48 30) 90) 0) (<= 0 (* 9 v_~a23~0_479)) (<= |c_old(~a23~0)| v_~a23~0_479) (= .cse47 0))))) (exists ((v_~a23~0_479 Int)) (let ((.cse49 (* v_~a23~0_479 9))) (let ((.cse50 (div .cse49 10))) (and (not (= 0 (mod .cse49 10))) (<= 0 (+ .cse50 58980)) (<= |c_old(~a23~0)| v_~a23~0_479) (< (* 9 v_~a23~0_479) 0) (= (mod (+ .cse50 29) 90) 0) (<= c_~a23~0 (+ (mod (+ .cse50 30) 90) 48)))))) (exists ((v_~a23~0_479 Int)) (let ((.cse52 (* v_~a23~0_479 9))) (let ((.cse51 (div .cse52 10))) (and (<= 0 (+ .cse51 58979)) (not (= 0 (mod .cse52 10))) (<= 0 (+ .cse51 58980)) (<= |c_old(~a23~0)| v_~a23~0_479) (< (* 9 v_~a23~0_479) 0) (<= c_~a23~0 (+ (mod (+ .cse51 30) 90) 48)))))) (exists ((v_~a23~0_479 Int)) (let ((.cse53 (div (* v_~a23~0_479 9) 10))) (and (<= c_~a23~0 (+ (mod (+ .cse53 29) 90) 48)) (<= 0 (+ .cse53 58979)) (= (mod (+ .cse53 30) 90) 0) (<= 0 (* 9 v_~a23~0_479)) (<= |c_old(~a23~0)| v_~a23~0_479)))) (exists ((v_~a23~0_479 Int)) (let ((.cse56 (* v_~a23~0_479 9))) (let ((.cse54 (div .cse56 10))) (let ((.cse55 (mod (+ .cse54 30) 90))) (and (<= 0 (+ .cse54 58979)) (= .cse55 0) (not (= 0 (mod .cse56 10))) (<= |c_old(~a23~0)| v_~a23~0_479) (< (* 9 v_~a23~0_479) 0) (<= c_~a23~0 (+ .cse55 48))))))) (exists ((v_~a23~0_479 Int)) (let ((.cse58 (* v_~a23~0_479 9))) (let ((.cse57 (div .cse58 10))) (and (<= c_~a23~0 (+ (mod (+ .cse57 29) 90) 48)) (<= 0 (+ .cse57 58979)) (<= 0 (+ .cse57 58980)) (<= |c_old(~a23~0)| v_~a23~0_479) (= 0 (mod .cse58 10)))))) (exists ((v_~a23~0_479 Int)) (let ((.cse60 (* v_~a23~0_479 9))) (let ((.cse59 (div .cse60 10))) (and (not (= (mod (+ .cse59 29) 90) 0)) (not (= 0 (mod .cse60 10))) (<= 0 (+ .cse59 58980)) (<= |c_old(~a23~0)| v_~a23~0_479) (< (* 9 v_~a23~0_479) 0) (< (+ .cse59 58979) 0) (<= c_~a23~0 (+ (mod (+ .cse59 30) 90) 48)))))) (exists ((v_~a23~0_479 Int)) (let ((.cse62 (div (* v_~a23~0_479 9) 10))) (let ((.cse61 (mod (+ .cse62 29) 90))) (and (not (= .cse61 0)) (<= 0 (* 9 v_~a23~0_479)) (<= 0 (+ .cse62 58980)) (<= |c_old(~a23~0)| v_~a23~0_479) (<= (+ c_~a23~0 42) .cse61) (< (+ .cse62 58979) 0)))))) is different from true [2019-10-14 22:00:00,054 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a23~0_479 Int)) (let ((.cse1 (div (* v_~a23~0_479 9) 10))) (let ((.cse0 (mod (+ .cse1 29) 90))) (and (not (= .cse0 0)) (< (+ .cse1 58980) 0) (<= 0 (* 9 v_~a23~0_479)) (<= |c_old(~a23~0)| v_~a23~0_479) (<= (+ c_~a23~0 42) .cse0) (not (= (mod (+ .cse1 30) 90) 0)) (< (+ .cse1 58979) 0))))) (exists ((v_prenex_16 Int)) (let ((.cse4 (* v_prenex_16 9))) (let ((.cse2 (div .cse4 10))) (let ((.cse3 (mod (+ .cse2 29) 90))) (and (not (= (mod (+ .cse2 30) 90) 0)) (<= |c_old(~a23~0)| v_prenex_16) (< (+ .cse2 58980) 0) (<= (+ c_~a23~0 42) .cse3) (not (= .cse3 0)) (< (+ .cse2 58979) 0) (= 0 (mod .cse4 10))))))) (exists ((v_prenex_24 Int)) (let ((.cse5 (* v_prenex_24 9))) (let ((.cse6 (div .cse5 10))) (and (= 0 (mod .cse5 10)) (<= |c_old(~a23~0)| v_prenex_24) (<= 0 (+ .cse6 58980)) (<= c_~a23~0 (+ (mod (+ .cse6 29) 90) 48)) (<= 0 (+ .cse6 58979)))))) (exists ((v_prenex_23 Int)) (let ((.cse9 (* v_prenex_23 9))) (let ((.cse7 (div .cse9 10))) (let ((.cse8 (mod (+ .cse7 30) 90))) (and (<= 0 (+ .cse7 58979)) (<= |c_old(~a23~0)| v_prenex_23) (<= c_~a23~0 (+ .cse8 48)) (not (= 0 (mod .cse9 10))) (< (* 9 v_prenex_23) 0) (= .cse8 0)))))) (exists ((v_prenex_18 Int)) (let ((.cse12 (* v_prenex_18 9))) (let ((.cse10 (div .cse12 10))) (let ((.cse11 (mod (+ .cse10 30) 90))) (and (not (= (mod (+ .cse10 29) 90) 0)) (= .cse11 0) (< (* 9 v_prenex_18) 0) (<= c_~a23~0 (+ .cse11 48)) (<= |c_old(~a23~0)| v_prenex_18) (not (= 0 (mod .cse12 10))) (< (+ .cse10 58979) 0)))))) (exists ((v_prenex_22 Int)) (let ((.cse13 (div (* v_prenex_22 9) 10))) (and (<= 0 (+ .cse13 58979)) (= (mod (+ .cse13 30) 90) 0) (<= |c_old(~a23~0)| v_prenex_22) (<= c_~a23~0 (+ (mod (+ .cse13 29) 90) 48)) (<= 0 (* 9 v_prenex_22))))) (exists ((v_prenex_2 Int)) (let ((.cse14 (* v_prenex_2 9))) (let ((.cse16 (div .cse14 10))) (let ((.cse15 (mod (+ .cse16 29) 90))) (and (= 0 (mod .cse14 10)) (<= |c_old(~a23~0)| v_prenex_2) (= .cse15 0) (<= 0 (+ .cse16 58980)) (<= c_~a23~0 (+ .cse15 48))))))) (exists ((v_prenex_10 Int)) (let ((.cse17 (div (* v_prenex_10 9) 10))) (let ((.cse18 (mod (+ .cse17 29) 90))) (and (< (+ .cse17 58980) 0) (<= 0 (* 9 v_prenex_10)) (= .cse18 0) (<= |c_old(~a23~0)| v_prenex_10) (not (= (mod (+ .cse17 30) 90) 0)) (<= c_~a23~0 (+ .cse18 48)))))) (exists ((v_prenex_12 Int)) (let ((.cse21 (* v_prenex_12 9))) (let ((.cse20 (div .cse21 10))) (let ((.cse19 (mod (+ .cse20 29) 90))) (and (<= c_~a23~0 (+ .cse19 48)) (<= |c_old(~a23~0)| v_prenex_12) (= (mod (+ .cse20 30) 90) 0) (= .cse19 0) (= 0 (mod .cse21 10))))))) (exists ((v_prenex_8 Int)) (let ((.cse22 (* v_prenex_8 9))) (let ((.cse23 (div .cse22 10))) (let ((.cse24 (mod (+ .cse23 30) 90))) (and (not (= 0 (mod .cse22 10))) (< (* 9 v_prenex_8) 0) (= (mod (+ .cse23 29) 90) 0) (<= c_~a23~0 (+ .cse24 48)) (<= |c_old(~a23~0)| v_prenex_8) (= .cse24 0)))))) (exists ((v_prenex_25 Int)) (let ((.cse25 (* v_prenex_25 9))) (let ((.cse26 (div .cse25 10))) (and (not (= 0 (mod .cse25 10))) (< (+ .cse26 58979) 0) (<= 0 (+ .cse26 58980)) (<= c_~a23~0 (+ (mod (+ .cse26 30) 90) 48)) (<= |c_old(~a23~0)| v_prenex_25) (not (= (mod (+ .cse26 29) 90) 0)) (< (* 9 v_prenex_25) 0))))) (exists ((v_prenex_13 Int)) (let ((.cse28 (* v_prenex_13 9))) (let ((.cse27 (div .cse28 10))) (and (<= 0 (+ .cse27 58979)) (<= |c_old(~a23~0)| v_prenex_13) (< (+ .cse27 58980) 0) (<= c_~a23~0 (+ (mod (+ .cse27 29) 90) 48)) (= 0 (mod .cse28 10)) (not (= (mod (+ .cse27 30) 90) 0)))))) (exists ((v_prenex_7 Int)) (let ((.cse29 (* v_prenex_7 9))) (let ((.cse31 (div .cse29 10))) (let ((.cse30 (mod (+ .cse31 29) 90))) (and (= 0 (mod .cse29 10)) (<= c_~a23~0 (+ .cse30 48)) (not (= (mod (+ .cse31 30) 90) 0)) (<= |c_old(~a23~0)| v_prenex_7) (= .cse30 0) (< (+ .cse31 58980) 0)))))) (exists ((v_prenex_6 Int)) (let ((.cse34 (* v_prenex_6 9))) (let ((.cse32 (div .cse34 10))) (let ((.cse33 (mod (+ .cse32 29) 90))) (and (< (+ .cse32 58979) 0) (<= (+ c_~a23~0 42) .cse33) (= 0 (mod .cse34 10)) (not (= .cse33 0)) (<= |c_old(~a23~0)| v_prenex_6) (= (mod (+ .cse32 30) 90) 0)))))) (exists ((v_prenex_9 Int)) (let ((.cse35 (div (* v_prenex_9 9) 10))) (let ((.cse36 (mod (+ .cse35 29) 90))) (and (<= 0 (* 9 v_prenex_9)) (<= |c_old(~a23~0)| v_prenex_9) (= (mod (+ .cse35 30) 90) 0) (not (= .cse36 0)) (<= (+ c_~a23~0 42) .cse36) (< (+ .cse35 58979) 0))))) (exists ((v_prenex_15 Int)) (let ((.cse38 (* v_prenex_15 9))) (let ((.cse39 (div .cse38 10))) (let ((.cse37 (mod (+ .cse39 30) 90))) (and (<= |c_old(~a23~0)| v_prenex_15) (not (= .cse37 0)) (not (= 0 (mod .cse38 10))) (< (+ .cse39 58980) 0) (<= 0 (+ .cse39 58979)) (<= (+ c_~a23~0 42) .cse37) (< (* 9 v_prenex_15) 0)))))) (exists ((v_prenex_19 Int)) (let ((.cse40 (div (* v_prenex_19 9) 10))) (let ((.cse41 (mod (+ .cse40 29) 90))) (and (= (mod (+ .cse40 30) 90) 0) (= .cse41 0) (<= 0 (* 9 v_prenex_19)) (<= c_~a23~0 (+ .cse41 48)) (<= |c_old(~a23~0)| v_prenex_19))))) (exists ((v_prenex_11 Int)) (let ((.cse44 (* v_prenex_11 9))) (let ((.cse43 (div .cse44 10))) (let ((.cse42 (mod (+ .cse43 29) 90))) (and (not (= .cse42 0)) (<= (+ c_~a23~0 42) .cse42) (<= |c_old(~a23~0)| v_prenex_11) (<= 0 (+ .cse43 58980)) (= 0 (mod .cse44 10)) (< (+ .cse43 58979) 0)))))) (exists ((v_prenex_26 Int)) (let ((.cse45 (div (* v_prenex_26 9) 10))) (let ((.cse46 (mod (+ .cse45 29) 90))) (and (<= |c_old(~a23~0)| v_prenex_26) (<= 0 (+ .cse45 58980)) (< (+ .cse45 58979) 0) (not (= .cse46 0)) (<= (+ c_~a23~0 42) .cse46) (<= 0 (* 9 v_prenex_26)))))) (exists ((v_prenex_17 Int)) (let ((.cse47 (div (* v_prenex_17 9) 10))) (and (<= c_~a23~0 (+ (mod (+ .cse47 29) 90) 48)) (< (+ .cse47 58980) 0) (<= 0 (+ .cse47 58979)) (<= |c_old(~a23~0)| v_prenex_17) (<= 0 (* 9 v_prenex_17)) (not (= (mod (+ .cse47 30) 90) 0))))) (exists ((v_prenex_20 Int)) (let ((.cse49 (* v_prenex_20 9))) (let ((.cse48 (div .cse49 10))) (and (<= c_~a23~0 (+ (mod (+ .cse48 30) 90) 48)) (<= |c_old(~a23~0)| v_prenex_20) (= (mod (+ .cse48 29) 90) 0) (< (* 9 v_prenex_20) 0) (not (= 0 (mod .cse49 10))) (<= 0 (+ .cse48 58980)))))) (exists ((v_prenex_1 Int)) (let ((.cse50 (* v_prenex_1 9))) (let ((.cse52 (div .cse50 10))) (let ((.cse51 (mod (+ .cse52 30) 90))) (and (not (= 0 (mod .cse50 10))) (<= (+ c_~a23~0 42) .cse51) (< (+ .cse52 58980) 0) (not (= .cse51 0)) (= (mod (+ .cse52 29) 90) 0) (< (* 9 v_prenex_1) 0) (<= |c_old(~a23~0)| v_prenex_1)))))) (exists ((v_prenex_4 Int)) (let ((.cse53 (div (* v_prenex_4 9) 10))) (let ((.cse54 (mod (+ .cse53 29) 90))) (and (<= 0 (* 9 v_prenex_4)) (<= 0 (+ .cse53 58980)) (= .cse54 0) (<= |c_old(~a23~0)| v_prenex_4) (<= c_~a23~0 (+ .cse54 48)))))) (exists ((v_prenex_3 Int)) (let ((.cse57 (* v_prenex_3 9))) (let ((.cse56 (div .cse57 10))) (let ((.cse55 (mod (+ .cse56 30) 90))) (and (not (= .cse55 0)) (< (* 9 v_prenex_3) 0) (< (+ .cse56 58980) 0) (<= |c_old(~a23~0)| v_prenex_3) (not (= (mod (+ .cse56 29) 90) 0)) (< (+ .cse56 58979) 0) (not (= 0 (mod .cse57 10))) (<= (+ c_~a23~0 42) .cse55)))))) (exists ((v_prenex_5 Int)) (let ((.cse59 (* v_prenex_5 9))) (let ((.cse58 (div .cse59 10))) (and (= (mod (+ .cse58 30) 90) 0) (<= 0 (+ .cse58 58979)) (<= |c_old(~a23~0)| v_prenex_5) (<= c_~a23~0 (+ (mod (+ .cse58 29) 90) 48)) (= 0 (mod .cse59 10)))))) (exists ((v_prenex_21 Int)) (let ((.cse61 (* v_prenex_21 9))) (let ((.cse60 (div .cse61 10))) (and (<= |c_old(~a23~0)| v_prenex_21) (<= 0 (+ .cse60 58980)) (not (= 0 (mod .cse61 10))) (< (* 9 v_prenex_21) 0) (<= 0 (+ .cse60 58979)) (<= c_~a23~0 (+ (mod (+ .cse60 30) 90) 48)))))) (exists ((v_prenex_14 Int)) (let ((.cse62 (div (* v_prenex_14 9) 10))) (and (<= |c_old(~a23~0)| v_prenex_14) (<= 0 (+ .cse62 58980)) (<= 0 (+ .cse62 58979)) (<= c_~a23~0 (+ (mod (+ .cse62 29) 90) 48)) (<= 0 (* 9 v_prenex_14)))))) is different from true [2019-10-14 22:00:00,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 27 terms [2019-10-14 22:00:00,763 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 518 DAG size of output: 27 [2019-10-14 22:00:00,959 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 70 trivial. 2 not checked. [2019-10-14 22:00:00,960 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:00:00,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-10-14 22:00:00,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285865231] [2019-10-14 22:00:00,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 22:00:00,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:00:00,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 22:00:00,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=106, Unknown=2, NotChecked=42, Total=182 [2019-10-14 22:00:00,962 INFO L87 Difference]: Start difference. First operand 2180 states and 2818 transitions. Second operand 14 states.