java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem17_label24_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 03:17:55,751 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 03:17:55,753 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 03:17:55,769 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 03:17:55,769 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 03:17:55,770 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 03:17:55,774 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 03:17:55,777 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 03:17:55,778 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 03:17:55,781 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 03:17:55,782 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 03:17:55,782 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 03:17:55,784 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 03:17:55,785 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 03:17:55,789 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 03:17:55,789 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 03:17:55,790 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 03:17:55,792 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 03:17:55,801 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 03:17:55,805 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 03:17:55,806 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 03:17:55,807 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 03:17:55,810 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 03:17:55,810 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 03:17:55,810 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 03:17:55,811 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 03:17:55,812 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 03:17:55,813 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 03:17:55,814 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 03:17:55,816 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 03:17:55,817 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 03:17:55,819 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 03:17:55,819 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 03:17:55,819 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 03:17:55,821 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 03:17:55,822 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 03:17:55,822 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-07-24 03:17:55,853 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 03:17:55,854 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 03:17:55,855 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 03:17:55,855 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-24 03:17:55,855 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-24 03:17:55,856 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-24 03:17:55,856 INFO L133 SettingsManager]: * Use SBE=true [2018-07-24 03:17:55,856 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 03:17:55,856 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 03:17:55,856 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 03:17:55,857 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 03:17:55,857 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 03:17:55,857 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 03:17:55,857 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 03:17:55,858 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 03:17:55,859 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 03:17:55,859 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 03:17:55,859 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 03:17:55,859 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 03:17:55,859 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 03:17:55,860 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 03:17:55,860 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 03:17:55,860 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 03:17:55,860 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-24 03:17:55,862 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 03:17:55,862 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 03:17:55,862 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 03:17:55,862 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 03:17:55,916 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 03:17:55,931 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 03:17:55,938 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 03:17:55,940 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 03:17:55,940 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 03:17:55,941 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label24_true-unreach-call.c [2018-07-24 03:17:56,314 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f3e2b426/0bba64e239224dd08144a5eb634e7708/FLAG2f5e84e0b [2018-07-24 03:17:56,738 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 03:17:56,739 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label24_true-unreach-call.c [2018-07-24 03:17:56,762 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f3e2b426/0bba64e239224dd08144a5eb634e7708/FLAG2f5e84e0b [2018-07-24 03:17:56,779 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f3e2b426/0bba64e239224dd08144a5eb634e7708 [2018-07-24 03:17:56,792 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 03:17:56,794 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 03:17:56,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 03:17:56,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 03:17:56,803 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 03:17:56,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 03:17:56" (1/1) ... [2018-07-24 03:17:56,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47d9fee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:17:56, skipping insertion in model container [2018-07-24 03:17:56,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 03:17:56" (1/1) ... [2018-07-24 03:17:57,126 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 03:17:57,836 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 03:17:57,855 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 03:17:58,291 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 03:17:58,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:17:58 WrapperNode [2018-07-24 03:17:58,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 03:17:58,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 03:17:58,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 03:17:58,514 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 03:17:58,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:17:58" (1/1) ... [2018-07-24 03:17:58,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:17:58" (1/1) ... [2018-07-24 03:17:58,873 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 03:17:58,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 03:17:58,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 03:17:58,874 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 03:17:59,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:17:58" (1/1) ... [2018-07-24 03:17:59,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:17:58" (1/1) ... [2018-07-24 03:17:59,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:17:58" (1/1) ... [2018-07-24 03:17:59,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:17:58" (1/1) ... [2018-07-24 03:17:59,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:17:58" (1/1) ... [2018-07-24 03:17:59,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:17:58" (1/1) ... [2018-07-24 03:17:59,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:17:58" (1/1) ... [2018-07-24 03:17:59,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 03:17:59,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 03:17:59,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 03:17:59,771 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 03:17:59,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:17:58" (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 [2018-07-24 03:17:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-07-24 03:17:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 03:17:59,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 03:18:11,884 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 03:18:11,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 03:18:11 BoogieIcfgContainer [2018-07-24 03:18:11,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 03:18:11,888 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 03:18:11,888 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 03:18:11,892 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 03:18:11,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 03:17:56" (1/3) ... [2018-07-24 03:18:11,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728ee5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 03:18:11, skipping insertion in model container [2018-07-24 03:18:11,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:17:58" (2/3) ... [2018-07-24 03:18:11,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728ee5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 03:18:11, skipping insertion in model container [2018-07-24 03:18:11,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 03:18:11" (3/3) ... [2018-07-24 03:18:11,896 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label24_true-unreach-call.c [2018-07-24 03:18:11,904 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 03:18:11,913 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 03:18:11,972 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 03:18:11,973 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 03:18:11,973 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 03:18:11,974 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 03:18:11,974 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 03:18:11,974 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 03:18:11,974 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 03:18:11,974 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 03:18:11,975 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 03:18:12,018 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states. [2018-07-24 03:18:12,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-07-24 03:18:12,030 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:18:12,031 INFO L353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 03:18:12,031 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:18:12,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1059493314, now seen corresponding path program 1 times [2018-07-24 03:18:12,039 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:18:12,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:18:12,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:18:12,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:18:12,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:18:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:18:12,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:18:12,536 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 03:18:12,536 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 03:18:12,541 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 03:18:12,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 03:18:12,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 03:18:12,560 INFO L87 Difference]: Start difference. First operand 591 states. Second operand 4 states. [2018-07-24 03:18:24,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:18:24,526 INFO L93 Difference]: Finished difference Result 2085 states and 3898 transitions. [2018-07-24 03:18:24,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 03:18:24,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-07-24 03:18:24,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:18:24,561 INFO L225 Difference]: With dead ends: 2085 [2018-07-24 03:18:24,561 INFO L226 Difference]: Without dead ends: 1487 [2018-07-24 03:18:24,569 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 03:18:24,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2018-07-24 03:18:24,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1023. [2018-07-24 03:18:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2018-07-24 03:18:24,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1623 transitions. [2018-07-24 03:18:24,677 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1623 transitions. Word has length 61 [2018-07-24 03:18:24,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:18:24,678 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1623 transitions. [2018-07-24 03:18:24,678 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 03:18:24,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1623 transitions. [2018-07-24 03:18:24,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-07-24 03:18:24,685 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:18:24,685 INFO L353 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, 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] [2018-07-24 03:18:24,686 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:18:24,686 INFO L82 PathProgramCache]: Analyzing trace with hash -771761591, now seen corresponding path program 1 times [2018-07-24 03:18:24,686 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:18:24,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:18:24,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:18:24,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:18:24,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:18:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:18:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:18:24,975 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 03:18:24,975 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 03:18:24,977 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 03:18:24,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 03:18:24,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 03:18:24,978 INFO L87 Difference]: Start difference. First operand 1023 states and 1623 transitions. Second operand 4 states. [2018-07-24 03:18:35,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:18:35,506 INFO L93 Difference]: Finished difference Result 3803 states and 6126 transitions. [2018-07-24 03:18:35,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 03:18:35,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-07-24 03:18:35,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:18:35,523 INFO L225 Difference]: With dead ends: 3803 [2018-07-24 03:18:35,524 INFO L226 Difference]: Without dead ends: 2782 [2018-07-24 03:18:35,532 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 03:18:35,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2782 states. [2018-07-24 03:18:35,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2782 to 2780. [2018-07-24 03:18:35,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2780 states. [2018-07-24 03:18:35,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2780 states to 2780 states and 3903 transitions. [2018-07-24 03:18:35,606 INFO L78 Accepts]: Start accepts. Automaton has 2780 states and 3903 transitions. Word has length 129 [2018-07-24 03:18:35,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:18:35,607 INFO L471 AbstractCegarLoop]: Abstraction has 2780 states and 3903 transitions. [2018-07-24 03:18:35,607 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 03:18:35,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2780 states and 3903 transitions. [2018-07-24 03:18:35,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-24 03:18:35,616 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:18:35,616 INFO L353 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, 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] [2018-07-24 03:18:35,616 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:18:35,617 INFO L82 PathProgramCache]: Analyzing trace with hash -520895210, now seen corresponding path program 1 times [2018-07-24 03:18:35,617 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:18:35,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:18:35,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:18:35,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:18:35,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:18:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:18:35,933 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:18:35,933 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:18:35,933 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:18:35,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:18:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:18:36,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:18:36,455 WARN L169 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 14 [2018-07-24 03:18:36,621 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:18:36,654 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 03:18:36,654 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-07-24 03:18:36,655 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-24 03:18:36,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-24 03:18:36,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-07-24 03:18:36,656 INFO L87 Difference]: Start difference. First operand 2780 states and 3903 transitions. Second operand 7 states. [2018-07-24 03:18:55,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:18:55,807 INFO L93 Difference]: Finished difference Result 12542 states and 18408 transitions. [2018-07-24 03:18:55,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 03:18:55,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2018-07-24 03:18:55,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:18:55,854 INFO L225 Difference]: With dead ends: 12542 [2018-07-24 03:18:55,855 INFO L226 Difference]: Without dead ends: 9764 [2018-07-24 03:18:55,861 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-07-24 03:18:55,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9764 states. [2018-07-24 03:18:56,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9764 to 8406. [2018-07-24 03:18:56,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8406 states. [2018-07-24 03:18:56,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8406 states to 8406 states and 11416 transitions. [2018-07-24 03:18:56,026 INFO L78 Accepts]: Start accepts. Automaton has 8406 states and 11416 transitions. Word has length 132 [2018-07-24 03:18:56,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:18:56,026 INFO L471 AbstractCegarLoop]: Abstraction has 8406 states and 11416 transitions. [2018-07-24 03:18:56,027 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-24 03:18:56,027 INFO L276 IsEmpty]: Start isEmpty. Operand 8406 states and 11416 transitions. [2018-07-24 03:18:56,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-07-24 03:18:56,032 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:18:56,033 INFO L353 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 03:18:56,033 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:18:56,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1516655138, now seen corresponding path program 1 times [2018-07-24 03:18:56,034 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:18:56,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:18:56,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:18:56,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:18:56,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:18:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:18:56,461 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 117 proven. 65 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-07-24 03:18:56,462 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:18:56,462 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:18:56,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:18:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:18:56,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:18:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-07-24 03:18:56,682 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 03:18:56,682 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2018-07-24 03:18:56,683 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 03:18:56,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 03:18:56,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-24 03:18:56,684 INFO L87 Difference]: Start difference. First operand 8406 states and 11416 transitions. Second operand 5 states. [2018-07-24 03:19:04,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:19:04,638 INFO L93 Difference]: Finished difference Result 29163 states and 40616 transitions. [2018-07-24 03:19:04,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 03:19:04,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 202 [2018-07-24 03:19:04,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:19:04,701 INFO L225 Difference]: With dead ends: 29163 [2018-07-24 03:19:04,702 INFO L226 Difference]: Without dead ends: 18543 [2018-07-24 03:19:04,718 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 03:19:04,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18543 states. [2018-07-24 03:19:04,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18543 to 18115. [2018-07-24 03:19:04,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18115 states. [2018-07-24 03:19:05,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18115 states to 18115 states and 20697 transitions. [2018-07-24 03:19:05,012 INFO L78 Accepts]: Start accepts. Automaton has 18115 states and 20697 transitions. Word has length 202 [2018-07-24 03:19:05,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:19:05,013 INFO L471 AbstractCegarLoop]: Abstraction has 18115 states and 20697 transitions. [2018-07-24 03:19:05,013 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 03:19:05,013 INFO L276 IsEmpty]: Start isEmpty. Operand 18115 states and 20697 transitions. [2018-07-24 03:19:05,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-07-24 03:19:05,020 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:19:05,021 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 03:19:05,021 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:19:05,021 INFO L82 PathProgramCache]: Analyzing trace with hash -780872234, now seen corresponding path program 1 times [2018-07-24 03:19:05,022 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:19:05,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:19:05,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:19:05,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:19:05,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:19:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:19:05,410 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 342 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-07-24 03:19:05,410 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 03:19:05,410 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 03:19:05,411 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 03:19:05,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 03:19:05,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 03:19:05,412 INFO L87 Difference]: Start difference. First operand 18115 states and 20697 transitions. Second operand 3 states. [2018-07-24 03:19:09,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:19:09,593 INFO L93 Difference]: Finished difference Result 47737 states and 54854 transitions. [2018-07-24 03:19:09,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 03:19:09,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2018-07-24 03:19:09,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:19:09,642 INFO L225 Difference]: With dead ends: 47737 [2018-07-24 03:19:09,642 INFO L226 Difference]: Without dead ends: 27904 [2018-07-24 03:19:09,663 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 03:19:09,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27904 states. [2018-07-24 03:19:09,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27904 to 26622. [2018-07-24 03:19:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26622 states. [2018-07-24 03:19:09,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26622 states to 26622 states and 29791 transitions. [2018-07-24 03:19:09,997 INFO L78 Accepts]: Start accepts. Automaton has 26622 states and 29791 transitions. Word has length 313 [2018-07-24 03:19:09,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:19:09,998 INFO L471 AbstractCegarLoop]: Abstraction has 26622 states and 29791 transitions. [2018-07-24 03:19:09,998 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 03:19:09,998 INFO L276 IsEmpty]: Start isEmpty. Operand 26622 states and 29791 transitions. [2018-07-24 03:19:10,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-07-24 03:19:10,008 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:19:10,009 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 03:19:10,009 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:19:10,009 INFO L82 PathProgramCache]: Analyzing trace with hash -783927649, now seen corresponding path program 1 times [2018-07-24 03:19:10,010 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:19:10,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:19:10,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:19:10,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:19:10,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:19:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:19:10,494 WARN L169 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2018-07-24 03:19:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-07-24 03:19:10,560 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 03:19:10,561 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 03:19:10,561 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 03:19:10,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 03:19:10,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 03:19:10,562 INFO L87 Difference]: Start difference. First operand 26622 states and 29791 transitions. Second operand 4 states. [2018-07-24 03:19:15,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:19:15,813 INFO L93 Difference]: Finished difference Result 59220 states and 66452 transitions. [2018-07-24 03:19:15,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 03:19:15,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2018-07-24 03:19:15,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:19:15,846 INFO L225 Difference]: With dead ends: 59220 [2018-07-24 03:19:15,846 INFO L226 Difference]: Without dead ends: 31740 [2018-07-24 03:19:15,863 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 03:19:15,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31740 states. [2018-07-24 03:19:16,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31740 to 26618. [2018-07-24 03:19:16,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26618 states. [2018-07-24 03:19:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26618 states to 26618 states and 29625 transitions. [2018-07-24 03:19:16,171 INFO L78 Accepts]: Start accepts. Automaton has 26618 states and 29625 transitions. Word has length 324 [2018-07-24 03:19:16,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:19:16,171 INFO L471 AbstractCegarLoop]: Abstraction has 26618 states and 29625 transitions. [2018-07-24 03:19:16,171 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 03:19:16,172 INFO L276 IsEmpty]: Start isEmpty. Operand 26618 states and 29625 transitions. [2018-07-24 03:19:16,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-07-24 03:19:16,181 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:19:16,181 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 03:19:16,181 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:19:16,182 INFO L82 PathProgramCache]: Analyzing trace with hash -919029372, now seen corresponding path program 1 times [2018-07-24 03:19:16,182 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:19:16,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:19:16,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:19:16,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:19:16,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:19:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:19:16,457 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2018-07-24 03:19:16,457 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 03:19:16,458 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 03:19:16,458 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 03:19:16,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 03:19:16,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 03:19:16,459 INFO L87 Difference]: Start difference. First operand 26618 states and 29625 transitions. Second operand 3 states. [2018-07-24 03:19:22,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:19:22,353 INFO L93 Difference]: Finished difference Result 57496 states and 63910 transitions. [2018-07-24 03:19:22,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 03:19:22,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2018-07-24 03:19:22,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:19:22,390 INFO L225 Difference]: With dead ends: 57496 [2018-07-24 03:19:22,390 INFO L226 Difference]: Without dead ends: 30880 [2018-07-24 03:19:22,410 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 03:19:22,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30880 states. [2018-07-24 03:19:22,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30880 to 28745. [2018-07-24 03:19:22,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28745 states. [2018-07-24 03:19:22,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28745 states to 28745 states and 31807 transitions. [2018-07-24 03:19:22,731 INFO L78 Accepts]: Start accepts. Automaton has 28745 states and 31807 transitions. Word has length 336 [2018-07-24 03:19:22,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:19:22,732 INFO L471 AbstractCegarLoop]: Abstraction has 28745 states and 31807 transitions. [2018-07-24 03:19:22,732 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 03:19:22,732 INFO L276 IsEmpty]: Start isEmpty. Operand 28745 states and 31807 transitions. [2018-07-24 03:19:22,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-07-24 03:19:22,745 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:19:22,745 INFO L353 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 03:19:22,746 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:19:22,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1134457030, now seen corresponding path program 1 times [2018-07-24 03:19:22,746 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:19:22,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:19:22,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:19:22,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:19:22,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:19:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:19:23,172 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 117 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:19:23,172 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:19:23,172 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:19:23,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:19:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:19:23,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:19:23,916 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 59 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:19:23,947 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:19:23,947 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-07-24 03:19:23,948 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 03:19:23,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 03:19:23,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 03:19:23,949 INFO L87 Difference]: Start difference. First operand 28745 states and 31807 transitions. Second operand 6 states. [2018-07-24 03:19:33,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:19:33,793 INFO L93 Difference]: Finished difference Result 71983 states and 79596 transitions. [2018-07-24 03:19:33,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 03:19:33,804 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 352 [2018-07-24 03:19:33,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:19:33,850 INFO L225 Difference]: With dead ends: 71983 [2018-07-24 03:19:33,851 INFO L226 Difference]: Without dead ends: 41087 [2018-07-24 03:19:33,876 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 349 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 03:19:33,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41087 states. [2018-07-24 03:19:34,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41087 to 32546. [2018-07-24 03:19:34,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32546 states. [2018-07-24 03:19:34,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32546 states to 32546 states and 35732 transitions. [2018-07-24 03:19:34,260 INFO L78 Accepts]: Start accepts. Automaton has 32546 states and 35732 transitions. Word has length 352 [2018-07-24 03:19:34,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:19:34,261 INFO L471 AbstractCegarLoop]: Abstraction has 32546 states and 35732 transitions. [2018-07-24 03:19:34,261 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 03:19:34,261 INFO L276 IsEmpty]: Start isEmpty. Operand 32546 states and 35732 transitions. [2018-07-24 03:19:34,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-07-24 03:19:34,271 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:19:34,271 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 03:19:34,271 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:19:34,272 INFO L82 PathProgramCache]: Analyzing trace with hash -38267715, now seen corresponding path program 1 times [2018-07-24 03:19:34,272 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:19:34,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:19:34,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:19:34,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:19:34,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:19:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:19:34,719 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-07-24 03:19:34,719 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 03:19:34,719 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 03:19:34,720 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 03:19:34,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 03:19:34,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 03:19:34,721 INFO L87 Difference]: Start difference. First operand 32546 states and 35732 transitions. Second operand 4 states. [2018-07-24 03:19:49,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:19:49,334 INFO L93 Difference]: Finished difference Result 91546 states and 100250 transitions. [2018-07-24 03:19:49,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 03:19:49,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 376 [2018-07-24 03:19:49,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:19:49,403 INFO L225 Difference]: With dead ends: 91546 [2018-07-24 03:19:49,403 INFO L226 Difference]: Without dead ends: 58566 [2018-07-24 03:19:49,433 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 03:19:49,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58566 states. [2018-07-24 03:19:50,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58566 to 55976. [2018-07-24 03:19:50,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55976 states. [2018-07-24 03:19:50,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55976 states to 55976 states and 60253 transitions. [2018-07-24 03:19:50,094 INFO L78 Accepts]: Start accepts. Automaton has 55976 states and 60253 transitions. Word has length 376 [2018-07-24 03:19:50,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:19:50,095 INFO L471 AbstractCegarLoop]: Abstraction has 55976 states and 60253 transitions. [2018-07-24 03:19:50,095 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 03:19:50,095 INFO L276 IsEmpty]: Start isEmpty. Operand 55976 states and 60253 transitions. [2018-07-24 03:19:50,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-07-24 03:19:50,108 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:19:50,108 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 03:19:50,109 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:19:50,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1909245855, now seen corresponding path program 1 times [2018-07-24 03:19:50,109 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:19:50,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:19:50,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:19:50,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:19:50,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:19:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:19:50,458 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2018-07-24 03:19:50,458 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 03:19:50,459 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 03:19:50,459 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 03:19:50,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 03:19:50,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 03:19:50,460 INFO L87 Difference]: Start difference. First operand 55976 states and 60253 transitions. Second operand 3 states. [2018-07-24 03:19:54,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:19:54,802 INFO L93 Difference]: Finished difference Result 122191 states and 131401 transitions. [2018-07-24 03:19:54,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 03:19:54,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 471 [2018-07-24 03:19:54,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:19:54,867 INFO L225 Difference]: With dead ends: 122191 [2018-07-24 03:19:54,868 INFO L226 Difference]: Without dead ends: 63655 [2018-07-24 03:19:54,905 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 03:19:54,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63655 states. [2018-07-24 03:19:55,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63655 to 61938. [2018-07-24 03:19:55,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61938 states. [2018-07-24 03:19:55,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61938 states to 61938 states and 66270 transitions. [2018-07-24 03:19:55,524 INFO L78 Accepts]: Start accepts. Automaton has 61938 states and 66270 transitions. Word has length 471 [2018-07-24 03:19:55,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:19:55,525 INFO L471 AbstractCegarLoop]: Abstraction has 61938 states and 66270 transitions. [2018-07-24 03:19:55,525 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 03:19:55,525 INFO L276 IsEmpty]: Start isEmpty. Operand 61938 states and 66270 transitions. [2018-07-24 03:19:55,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 892 [2018-07-24 03:19:55,604 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:19:55,605 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 03:19:55,605 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:19:55,606 INFO L82 PathProgramCache]: Analyzing trace with hash 2116881534, now seen corresponding path program 1 times [2018-07-24 03:19:55,606 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:19:55,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:19:55,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:19:55,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:19:55,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:19:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:19:57,158 INFO L134 CoverageAnalysis]: Checked inductivity of 995 backedges. 581 proven. 83 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2018-07-24 03:19:57,158 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:19:57,158 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:19:57,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:19:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:19:57,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:19:59,598 WARN L1010 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_56 Int)) (let ((.cse1 (* 9 v_prenex_56))) (let ((.cse0 (mod (div .cse1 10) 48))) (let ((.cse2 (* 10 .cse0))) (let ((.cse3 (+ .cse2 440))) (and (not (= (mod (+ .cse0 8) 9) 0)) (= (mod .cse1 10) 0) (< .cse2 40) (< .cse3 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (+ (div .cse3 9) 1)) (not (= (mod (+ .cse0 5) 9) 0)) (= 0 .cse0))))))) (exists ((v_prenex_78 Int)) (let ((.cse4 (* 9 v_prenex_78))) (let ((.cse6 (mod (div .cse4 10) 48))) (let ((.cse5 (+ (* 10 .cse6) 440))) (and (<= 0 .cse4) (<= 0 .cse5) (= (mod (+ .cse6 5) 9) 0) (= 0 .cse6) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div .cse5 9))))))) (exists ((v_prenex_83 Int)) (let ((.cse9 (* 9 v_prenex_83))) (let ((.cse8 (+ (div .cse9 10) 1))) (let ((.cse7 (mod .cse8 48))) (and (not (= 0 .cse7)) (< .cse8 0) (= 0 (mod (+ .cse7 8) 9)) (not (= (mod .cse9 10) 0)) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ (* 10 .cse7) (- 40)) 9)) (< .cse9 0) (= (mod (+ .cse7 5) 9) 0)))))) (exists ((v_prenex_50 Int)) (let ((.cse11 (* 9 v_prenex_50))) (let ((.cse12 (mod (+ (div .cse11 10) 1) 48))) (let ((.cse10 (* 10 .cse12))) (and (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ .cse10 440) 9)) (< .cse11 0) (= 0 (mod (+ .cse12 8) 9)) (<= 40 .cse10) (= 0 .cse12) (not (= (mod .cse11 10) 0))))))) (exists ((v_prenex_21 Int)) (let ((.cse15 (* 9 v_prenex_21))) (let ((.cse13 (div .cse15 10))) (let ((.cse16 (mod .cse13 48))) (let ((.cse14 (* 10 .cse16))) (and (<= 0 .cse13) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ .cse14 440) 9)) (= (mod .cse15 10) 0) (< .cse14 40) (not (= (mod (+ .cse16 5) 9) 0)) (= (mod (+ .cse16 8) 9) 0))))))) (exists ((v_prenex_38 Int)) (let ((.cse19 (* 9 v_prenex_38))) (let ((.cse17 (mod (+ (div .cse19 10) 1) 48))) (let ((.cse18 (* 10 .cse17))) (let ((.cse20 (+ .cse18 440))) (and (= 0 .cse17) (< .cse18 40) (not (= (mod (+ .cse17 5) 9) 0)) (not (= (mod .cse19 10) 0)) (< .cse20 0) (not (= 0 (mod (+ .cse17 8) 9))) (< .cse19 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (+ (div .cse20 9) 1)))))))) (exists ((v_prenex_28 Int)) (let ((.cse24 (* 9 v_prenex_28))) (let ((.cse22 (mod (div .cse24 10) 48))) (let ((.cse23 (* 10 .cse22))) (let ((.cse21 (+ .cse23 440))) (and (< .cse21 0) (not (= (mod (+ .cse22 8) 9) 0)) (<= 40 .cse23) (<= 0 .cse24) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (+ (div .cse21 9) 1)) (= 0 .cse22))))))) (exists ((v_prenex_64 Int)) (let ((.cse25 (* 9 v_prenex_64))) (let ((.cse26 (+ (div .cse25 10) 1))) (let ((.cse28 (* 10 (mod .cse26 48)))) (let ((.cse27 (+ .cse28 440))) (and (< .cse25 0) (<= 0 .cse26) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div .cse27 9)) (<= 0 .cse27) (not (= (mod .cse25 10) 0)) (<= 40 .cse28))))))) (exists ((v_prenex_75 Int)) (let ((.cse29 (* 9 v_prenex_75))) (let ((.cse33 (div .cse29 10))) (let ((.cse30 (mod .cse33 48))) (let ((.cse32 (* 10 .cse30))) (let ((.cse31 (+ .cse32 440))) (and (= (mod .cse29 10) 0) (not (= (mod (+ .cse30 5) 9) 0)) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (+ (div .cse31 9) 1)) (< .cse32 40) (< .cse31 0) (not (= (mod (+ .cse30 8) 9) 0)) (<= 0 .cse33)))))))) (exists ((v_prenex_59 Int)) (let ((.cse35 (* 9 v_prenex_59))) (let ((.cse36 (div .cse35 10))) (let ((.cse34 (mod .cse36 48))) (let ((.cse37 (* 10 .cse34))) (and (not (= 0 .cse34)) (not (= (mod (+ .cse34 5) 9) 0)) (= (mod .cse35 10) 0) (= (mod (+ .cse34 8) 9) 0) (< .cse36 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (+ (div (+ .cse37 (- 40)) 9) 1)) (< .cse37 40))))))) (exists ((v_prenex_51 Int)) (let ((.cse39 (* 9 v_prenex_51))) (let ((.cse40 (+ (div .cse39 10) 1))) (let ((.cse38 (mod .cse40 48))) (and (= (mod (+ .cse38 5) 9) 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ (* 10 .cse38) 440) 9)) (not (= (mod .cse39 10) 0)) (= 0 (mod (+ .cse38 8) 9)) (< .cse39 0) (<= 0 .cse40)))))) (exists ((v_prenex_79 Int)) (let ((.cse43 (* 9 v_prenex_79))) (let ((.cse42 (div .cse43 10))) (let ((.cse41 (mod .cse42 48))) (let ((.cse45 (* 10 .cse41))) (let ((.cse44 (+ .cse45 440))) (and (not (= (mod (+ .cse41 8) 9) 0)) (not (= (mod (+ .cse41 5) 9) 0)) (<= 0 .cse42) (<= 0 .cse43) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (+ (div .cse44 9) 1)) (< .cse45 40) (< .cse44 0)))))))) (exists ((v_prenex_74 Int)) (let ((.cse47 (* 9 v_prenex_74))) (let ((.cse46 (mod (div .cse47 10) 48))) (and (= 0 .cse46) (= (mod .cse47 10) 0) (= (mod (+ .cse46 5) 9) 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ (* 10 .cse46) 440) 9)) (= (mod (+ .cse46 8) 9) 0))))) (exists ((v_prenex_25 Int)) (let ((.cse50 (* 9 v_prenex_25))) (let ((.cse49 (mod (div .cse50 10) 48))) (let ((.cse48 (* 10 .cse49))) (let ((.cse51 (+ .cse48 440))) (and (< .cse48 40) (= 0 .cse49) (= (mod .cse50 10) 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div .cse51 9)) (<= 0 .cse51) (not (= (mod (+ .cse49 5) 9) 0)))))))) (exists ((v_prenex_60 Int)) (let ((.cse55 (* 9 v_prenex_60))) (let ((.cse54 (div .cse55 10))) (let ((.cse53 (mod .cse54 48))) (let ((.cse52 (* 10 .cse53))) (and (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ .cse52 (- 40)) 9)) (not (= 0 .cse53)) (< .cse54 0) (<= 0 .cse55) (<= 0 (+ .cse52 440)) (= (mod (+ .cse53 5) 9) 0))))))) (exists ((v_prenex_8 Int)) (let ((.cse56 (* 9 v_prenex_8))) (let ((.cse59 (+ (div .cse56 10) 1))) (let ((.cse58 (mod .cse59 48))) (let ((.cse57 (* 10 .cse58))) (and (not (= (mod .cse56 10) 0)) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ .cse57 440) 9)) (<= 40 .cse57) (< .cse56 0) (= 0 (mod (+ .cse58 8) 9)) (<= 0 .cse59))))))) (exists ((v_prenex_5 Int)) (let ((.cse63 (* 9 v_prenex_5))) (let ((.cse60 (div .cse63 10))) (let ((.cse61 (mod .cse60 48))) (let ((.cse62 (* 10 .cse61))) (and (< .cse60 0) (not (= (mod (+ .cse61 5) 9) 0)) (< .cse62 40) (not (= 0 .cse61)) (<= 0 (+ .cse62 440)) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (+ (div (+ .cse62 (- 40)) 9) 1)) (<= 0 .cse63))))))) (exists ((v_prenex_17 Int)) (let ((.cse65 (* 9 v_prenex_17))) (let ((.cse67 (div .cse65 10))) (let ((.cse66 (mod .cse67 48))) (let ((.cse64 (+ (* 10 .cse66) 440))) (and (<= 0 .cse64) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div .cse64 9)) (<= 0 .cse65) (= (mod (+ .cse66 5) 9) 0) (<= 0 .cse67))))))) (exists ((v_prenex_11 Int)) (let ((.cse68 (* 9 v_prenex_11))) (let ((.cse70 (div .cse68 10))) (let ((.cse69 (mod .cse70 48))) (let ((.cse71 (+ (* 10 .cse69) 440))) (and (<= 0 .cse68) (not (= (mod (+ .cse69 8) 9) 0)) (<= 0 .cse70) (< .cse71 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (+ (div .cse71 9) 1)) (= (mod (+ .cse69 5) 9) 0))))))) (exists ((v_prenex_66 Int)) (let ((.cse73 (* 9 v_prenex_66))) (let ((.cse75 (+ (div .cse73 10) 1))) (let ((.cse74 (mod .cse75 48))) (let ((.cse72 (* 10 .cse74))) (and (< (+ .cse72 440) 0) (not (= (mod .cse73 10) 0)) (not (= 0 .cse74)) (< .cse73 0) (<= 40 .cse72) (< .cse75 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ .cse72 (- 40)) 9)) (not (= 0 (mod (+ .cse74 8) 9))))))))) (exists ((v_prenex_29 Int)) (let ((.cse79 (* 9 v_prenex_29))) (let ((.cse78 (+ (div .cse79 10) 1))) (let ((.cse77 (mod .cse78 48))) (let ((.cse76 (+ (* 10 .cse77) 440))) (and (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div .cse76 9)) (= (mod (+ .cse77 5) 9) 0) (<= 0 .cse78) (<= 0 .cse76) (< .cse79 0) (not (= (mod .cse79 10) 0)))))))) (exists ((v_prenex_33 Int)) (let ((.cse80 (* 9 v_prenex_33))) (let ((.cse81 (+ (div .cse80 10) 1))) (let ((.cse82 (mod .cse81 48))) (let ((.cse83 (* 10 .cse82))) (and (not (= (mod .cse80 10) 0)) (< .cse81 0) (= (mod (+ .cse82 5) 9) 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ .cse83 (- 40)) 9)) (< (+ .cse83 440) 0) (< .cse80 0) (not (= 0 (mod (+ .cse82 8) 9))) (not (= 0 .cse82)))))))) (exists ((v_prenex_16 Int)) (let ((.cse85 (* 9 v_prenex_16))) (let ((.cse87 (mod (div .cse85 10) 48))) (let ((.cse86 (* 10 .cse87))) (let ((.cse84 (+ .cse86 440))) (and (<= 0 .cse84) (= (mod .cse85 10) 0) (<= 40 .cse86) (= 0 .cse87) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div .cse84 9)))))))) (exists ((v_prenex_31 Int)) (let ((.cse89 (* 9 v_prenex_31))) (let ((.cse88 (mod (+ (div .cse89 10) 1) 48))) (and (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ (* 10 .cse88) 440) 9)) (= (mod (+ .cse88 5) 9) 0) (< .cse89 0) (not (= (mod .cse89 10) 0)) (= 0 .cse88) (= 0 (mod (+ .cse88 8) 9)))))) (exists ((v_prenex_30 Int)) (let ((.cse92 (* 9 v_prenex_30))) (let ((.cse93 (div .cse92 10))) (let ((.cse91 (mod .cse93 48))) (let ((.cse90 (* 10 .cse91))) (and (<= 40 .cse90) (not (= 0 .cse91)) (<= 0 (+ .cse90 440)) (<= 0 .cse92) (< .cse93 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ .cse90 (- 40)) 9)))))))) (exists ((v_prenex_37 Int)) (let ((.cse96 (* 9 v_prenex_37))) (let ((.cse95 (div .cse96 10))) (let ((.cse94 (mod .cse95 48))) (let ((.cse97 (* 10 .cse94))) (and (not (= (mod (+ .cse94 5) 9) 0)) (<= 0 .cse95) (<= 0 .cse96) (< .cse97 40) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ .cse97 440) 9)) (= (mod (+ .cse94 8) 9) 0))))))) (exists ((v_prenex_62 Int)) (let ((.cse102 (* 9 v_prenex_62))) (let ((.cse101 (+ (div .cse102 10) 1))) (let ((.cse98 (mod .cse101 48))) (let ((.cse99 (* 10 .cse98))) (let ((.cse100 (+ .cse99 440))) (and (not (= (mod (+ .cse98 5) 9) 0)) (< .cse99 40) (< .cse100 0) (<= 0 .cse101) (< .cse102 0) (not (= 0 (mod (+ .cse98 8) 9))) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (+ (div .cse100 9) 1)) (not (= (mod .cse102 10) 0))))))))) (exists ((v_prenex_19 Int)) (let ((.cse105 (* 9 v_prenex_19))) (let ((.cse106 (div .cse105 10))) (let ((.cse104 (mod .cse106 48))) (let ((.cse103 (* 10 .cse104))) (and (< .cse103 40) (not (= (mod (+ .cse104 8) 9) 0)) (< (+ .cse103 440) 0) (<= 0 .cse105) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (+ (div (+ .cse103 (- 40)) 9) 1)) (not (= (mod (+ .cse104 5) 9) 0)) (< .cse106 0) (not (= 0 .cse104)))))))) (exists ((v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0_1300 Int)) (let ((.cse110 (* 9 v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0_1300))) (let ((.cse108 (div .cse110 10))) (let ((.cse109 (mod .cse108 48))) (let ((.cse107 (* 10 .cse109))) (and (<= 0 (+ .cse107 440)) (<= 40 .cse107) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ .cse107 (- 40)) 9)) (< .cse108 0) (not (= 0 .cse109)) (= (mod .cse110 10) 0))))))) (exists ((v_prenex_36 Int)) (let ((.cse114 (* 9 v_prenex_36))) (let ((.cse111 (div .cse114 10))) (let ((.cse113 (* 10 (mod .cse111 48)))) (let ((.cse112 (+ .cse113 440))) (and (<= 0 .cse111) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div .cse112 9)) (<= 0 .cse112) (<= 40 .cse113) (<= 0 .cse114))))))) (exists ((v_prenex_20 Int)) (let ((.cse119 (* 9 v_prenex_20))) (let ((.cse116 (div .cse119 10))) (let ((.cse117 (mod .cse116 48))) (let ((.cse118 (* 10 .cse117))) (let ((.cse115 (+ .cse118 440))) (and (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (+ (div .cse115 9) 1)) (<= 0 .cse116) (not (= (mod (+ .cse117 8) 9) 0)) (< .cse115 0) (<= 40 .cse118) (= (mod .cse119 10) 0)))))))) (exists ((v_prenex_41 Int)) (let ((.cse123 (* 9 v_prenex_41))) (let ((.cse122 (div .cse123 10))) (let ((.cse120 (* 10 (mod .cse122 48)))) (let ((.cse121 (+ .cse120 440))) (and (<= 40 .cse120) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div .cse121 9)) (<= 0 .cse122) (<= 0 .cse121) (= (mod .cse123 10) 0))))))) (exists ((v_prenex_76 Int)) (let ((.cse127 (* 9 v_prenex_76))) (let ((.cse126 (mod (div .cse127 10) 48))) (let ((.cse125 (* 10 .cse126))) (let ((.cse124 (+ .cse125 440))) (and (< .cse124 0) (<= 40 .cse125) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (+ (div .cse124 9) 1)) (not (= (mod (+ .cse126 8) 9) 0)) (= (mod .cse127 10) 0) (= 0 .cse126))))))) (exists ((v_prenex_58 Int)) (let ((.cse130 (* 9 v_prenex_58))) (let ((.cse128 (mod (+ (div .cse130 10) 1) 48))) (let ((.cse129 (+ (* 10 .cse128) 440))) (and (= (mod (+ .cse128 5) 9) 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div .cse129 9)) (< .cse130 0) (<= 0 .cse129) (= 0 .cse128) (not (= (mod .cse130 10) 0))))))) (exists ((v_prenex_63 Int)) (let ((.cse133 (* 9 v_prenex_63))) (let ((.cse134 (+ (div .cse133 10) 1))) (let ((.cse135 (mod .cse134 48))) (let ((.cse132 (* 10 .cse135))) (let ((.cse131 (+ .cse132 440))) (and (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (+ (div .cse131 9) 1)) (<= 40 .cse132) (< .cse131 0) (< .cse133 0) (<= 0 .cse134) (not (= 0 (mod (+ .cse135 8) 9))) (not (= (mod .cse133 10) 0))))))))) (exists ((v_prenex_82 Int)) (let ((.cse140 (* 9 v_prenex_82))) (let ((.cse138 (div .cse140 10))) (let ((.cse139 (mod .cse138 48))) (let ((.cse137 (* 10 .cse139))) (let ((.cse136 (+ .cse137 440))) (and (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div .cse136 9)) (< .cse137 40) (<= 0 .cse138) (not (= (mod (+ .cse139 5) 9) 0)) (<= 0 .cse136) (= (mod .cse140 10) 0)))))))) (exists ((v_prenex_15 Int)) (let ((.cse144 (* 9 v_prenex_15))) (let ((.cse143 (div .cse144 10))) (let ((.cse141 (mod .cse143 48))) (let ((.cse142 (+ (* 10 .cse141) 440))) (and (not (= (mod (+ .cse141 8) 9) 0)) (= (mod (+ .cse141 5) 9) 0) (< .cse142 0) (<= 0 .cse143) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (+ (div .cse142 9) 1)) (= (mod .cse144 10) 0))))))) (exists ((v_prenex_35 Int)) (let ((.cse147 (* 9 v_prenex_35))) (let ((.cse145 (mod (div .cse147 10) 48))) (let ((.cse146 (* 10 .cse145))) (and (= (mod (+ .cse145 8) 9) 0) (= 0 .cse145) (< .cse146 40) (= (mod .cse147 10) 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ .cse146 440) 9)) (not (= (mod (+ .cse145 5) 9) 0))))))) (exists ((v_prenex_13 Int)) (let ((.cse149 (* 9 v_prenex_13))) (let ((.cse148 (div .cse149 10))) (let ((.cse151 (mod .cse148 48))) (let ((.cse150 (* 10 .cse151))) (and (< .cse148 0) (= (mod .cse149 10) 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ .cse150 (- 40)) 9)) (<= 40 .cse150) (not (= 0 .cse151)) (= (mod (+ .cse151 8) 9) 0))))))) (exists ((v_prenex_69 Int)) (let ((.cse152 (* 9 v_prenex_69))) (let ((.cse153 (div .cse152 10))) (let ((.cse155 (mod .cse153 48))) (let ((.cse154 (* 10 .cse155))) (and (= (mod .cse152 10) 0) (< .cse153 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (+ (div (+ .cse154 (- 40)) 9) 1)) (not (= (mod (+ .cse155 8) 9) 0)) (not (= (mod (+ .cse155 5) 9) 0)) (< (+ .cse154 440) 0) (< .cse154 40) (not (= 0 .cse155)))))))) (exists ((v_prenex_73 Int)) (let ((.cse159 (* 9 v_prenex_73))) (let ((.cse157 (+ (div .cse159 10) 1))) (let ((.cse158 (mod .cse157 48))) (let ((.cse156 (* 10 .cse158))) (and (<= 0 (+ .cse156 440)) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ .cse156 (- 40)) 9)) (< .cse157 0) (not (= 0 .cse158)) (not (= (mod .cse159 10) 0)) (<= 40 .cse156) (< .cse159 0))))))) (exists ((v_prenex_54 Int)) (let ((.cse161 (* 9 v_prenex_54))) (let ((.cse163 (div .cse161 10))) (let ((.cse160 (mod .cse163 48))) (let ((.cse162 (* 10 .cse160))) (and (= (mod (+ .cse160 8) 9) 0) (= (mod .cse161 10) 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ .cse162 440) 9)) (<= 40 .cse162) (<= 0 .cse163))))))) (exists ((v_prenex_68 Int)) (let ((.cse165 (* 9 v_prenex_68))) (let ((.cse167 (+ (div .cse165 10) 1))) (let ((.cse166 (mod .cse167 48))) (let ((.cse164 (* 10 .cse166))) (and (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (+ (div (+ .cse164 (- 40)) 9) 1)) (< .cse165 0) (< (+ .cse164 440) 0) (< .cse164 40) (not (= 0 .cse166)) (not (= (mod .cse165 10) 0)) (not (= 0 (mod (+ .cse166 8) 9))) (< .cse167 0) (not (= (mod (+ .cse166 5) 9) 0)))))))) (exists ((v_prenex_46 Int)) (let ((.cse169 (* 9 v_prenex_46))) (let ((.cse170 (mod (div .cse169 10) 48))) (let ((.cse168 (+ (* 10 .cse170) 440))) (and (< .cse168 0) (<= 0 .cse169) (not (= (mod (+ .cse170 8) 9) 0)) (= (mod (+ .cse170 5) 9) 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (+ (div .cse168 9) 1)) (= 0 .cse170)))))) (exists ((v_prenex_14 Int)) (let ((.cse171 (* 9 v_prenex_14))) (let ((.cse173 (div .cse171 10))) (let ((.cse174 (mod .cse173 48))) (let ((.cse172 (+ (* 10 .cse174) 440))) (and (= (mod .cse171 10) 0) (<= 0 .cse172) (<= 0 .cse173) (= (mod (+ .cse174 5) 9) 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div .cse172 9)))))))) (exists ((v_prenex_26 Int)) (let ((.cse178 (* 9 v_prenex_26))) (let ((.cse175 (div .cse178 10))) (let ((.cse176 (mod .cse175 48))) (let ((.cse177 (* 10 .cse176))) (and (< .cse175 0) (not (= 0 .cse176)) (= (mod (+ .cse176 8) 9) 0) (not (= (mod (+ .cse176 5) 9) 0)) (< .cse177 40) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (+ (div (+ .cse177 (- 40)) 9) 1)) (<= 0 .cse178))))))) (exists ((v_prenex_53 Int)) (let ((.cse179 (* 9 v_prenex_53))) (let ((.cse181 (mod (div .cse179 10) 48))) (let ((.cse180 (+ (* 10 .cse181) 440))) (and (= (mod .cse179 10) 0) (<= 0 .cse180) (= 0 .cse181) (= (mod (+ .cse181 5) 9) 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div .cse180 9))))))) (exists ((v_prenex_23 Int)) (let ((.cse183 (* 9 v_prenex_23))) (let ((.cse182 (mod (+ (div .cse183 10) 1) 48))) (let ((.cse184 (+ (* 10 .cse182) 440))) (and (not (= 0 (mod (+ .cse182 8) 9))) (= 0 .cse182) (< .cse183 0) (= (mod (+ .cse182 5) 9) 0) (< .cse184 0) (not (= (mod .cse183 10) 0)) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (+ (div .cse184 9) 1))))))) (exists ((v_prenex_55 Int)) (let ((.cse187 (* 9 v_prenex_55))) (let ((.cse188 (div .cse187 10))) (let ((.cse185 (mod .cse188 48))) (let ((.cse186 (* 10 .cse185))) (and (not (= (mod (+ .cse185 8) 9) 0)) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ .cse186 (- 40)) 9)) (< (+ .cse186 440) 0) (= (mod (+ .cse185 5) 9) 0) (not (= 0 .cse185)) (= (mod .cse187 10) 0) (< .cse188 0))))))) (exists ((v_prenex_67 Int)) (let ((.cse190 (* 9 v_prenex_67))) (let ((.cse189 (mod (div .cse190 10) 48))) (and (= (mod (+ .cse189 5) 9) 0) (= (mod (+ .cse189 8) 9) 0) (= 0 .cse189) (<= 0 .cse190) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ (* 10 .cse189) 440) 9)))))) (exists ((v_prenex_32 Int)) (let ((.cse193 (* 9 v_prenex_32))) (let ((.cse192 (mod (div .cse193 10) 48))) (let ((.cse191 (+ (* 10 .cse192) 440))) (and (< .cse191 0) (= 0 .cse192) (= (mod (+ .cse192 5) 9) 0) (= (mod .cse193 10) 0) (not (= (mod (+ .cse192 8) 9) 0)) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (+ (div .cse191 9) 1))))))) (exists ((v_prenex_65 Int)) (let ((.cse195 (* 9 v_prenex_65))) (let ((.cse196 (div .cse195 10))) (let ((.cse194 (mod .cse196 48))) (and (= (mod (+ .cse194 5) 9) 0) (= (mod .cse195 10) 0) (= (mod (+ .cse194 8) 9) 0) (not (= 0 .cse194)) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ (* 10 .cse194) (- 40)) 9)) (< .cse196 0)))))) (exists ((v_prenex_45 Int)) (let ((.cse199 (* 9 v_prenex_45))) (let ((.cse197 (div .cse199 10))) (let ((.cse198 (mod .cse197 48))) (and (<= 0 .cse197) (= (mod (+ .cse198 8) 9) 0) (= (mod (+ .cse198 5) 9) 0) (<= 0 .cse199) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ (* 10 .cse198) 440) 9))))))) (exists ((v_prenex_71 Int)) (let ((.cse200 (* 9 v_prenex_71))) (let ((.cse203 (div .cse200 10))) (let ((.cse202 (mod .cse203 48))) (let ((.cse204 (* 10 .cse202))) (let ((.cse201 (+ .cse204 440))) (and (<= 0 .cse200) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (+ (div .cse201 9) 1)) (not (= (mod (+ .cse202 8) 9) 0)) (< .cse201 0) (<= 0 .cse203) (<= 40 .cse204)))))))) (exists ((v_prenex_77 Int)) (let ((.cse207 (* 9 v_prenex_77))) (let ((.cse208 (div .cse207 10))) (let ((.cse205 (mod .cse208 48))) (let ((.cse206 (* 10 .cse205))) (and (not (= (mod (+ .cse205 5) 9) 0)) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (+ (div (+ .cse206 (- 40)) 9) 1)) (<= 0 (+ .cse206 440)) (< .cse206 40) (= (mod .cse207 10) 0) (not (= 0 .cse205)) (< .cse208 0))))))) (exists ((v_prenex_34 Int)) (let ((.cse211 (* 9 v_prenex_34))) (let ((.cse212 (+ (div .cse211 10) 1))) (let ((.cse209 (mod .cse212 48))) (let ((.cse210 (* 10 .cse209))) (and (not (= (mod (+ .cse209 5) 9) 0)) (not (= 0 .cse209)) (< .cse210 40) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (+ (div (+ .cse210 (- 40)) 9) 1)) (< .cse211 0) (< .cse212 0) (not (= (mod .cse211 10) 0)) (<= 0 (+ .cse210 440)))))))) (exists ((v_prenex_10 Int)) (let ((.cse213 (* 9 v_prenex_10))) (let ((.cse215 (+ (div .cse213 10) 1))) (let ((.cse214 (mod .cse215 48))) (let ((.cse216 (* 10 .cse214))) (and (< .cse213 0) (not (= 0 .cse214)) (= (mod (+ .cse214 5) 9) 0) (< .cse215 0) (not (= (mod .cse213 10) 0)) (<= 0 (+ .cse216 440)) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ .cse216 (- 40)) 9)))))))) (exists ((v_prenex_57 Int)) (let ((.cse218 (* 9 v_prenex_57))) (let ((.cse217 (mod (+ (div .cse218 10) 1) 48))) (let ((.cse220 (* 10 .cse217))) (let ((.cse219 (+ .cse220 440))) (and (not (= (mod (+ .cse217 5) 9) 0)) (= 0 .cse217) (not (= (mod .cse218 10) 0)) (<= 0 .cse219) (< .cse218 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div .cse219 9)) (< .cse220 40))))))) (exists ((v_prenex_27 Int)) (let ((.cse223 (* 9 v_prenex_27))) (let ((.cse222 (mod (div .cse223 10) 48))) (let ((.cse221 (* 10 .cse222))) (and (< .cse221 40) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ .cse221 440) 9)) (= 0 .cse222) (not (= (mod (+ .cse222 5) 9) 0)) (<= 0 .cse223) (= (mod (+ .cse222 8) 9) 0)))))) (exists ((v_prenex_61 Int)) (let ((.cse224 (* 9 v_prenex_61))) (let ((.cse225 (div .cse224 10))) (let ((.cse226 (mod .cse225 48))) (let ((.cse227 (* 10 .cse226))) (and (= (mod .cse224 10) 0) (< .cse225 0) (not (= 0 .cse226)) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ .cse227 (- 40)) 9)) (<= 0 (+ .cse227 440)) (= (mod (+ .cse226 5) 9) 0))))))) (exists ((v_prenex_18 Int)) (let ((.cse229 (* 9 v_prenex_18))) (let ((.cse228 (div .cse229 10))) (let ((.cse230 (mod .cse228 48))) (let ((.cse231 (* 10 .cse230))) (and (< .cse228 0) (= (mod .cse229 10) 0) (not (= 0 .cse230)) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ .cse231 (- 40)) 9)) (not (= (mod (+ .cse230 8) 9) 0)) (< (+ .cse231 440) 0) (<= 40 .cse231))))))) (exists ((v_prenex_49 Int)) (let ((.cse234 (* 9 v_prenex_49))) (let ((.cse232 (div .cse234 10))) (let ((.cse233 (mod .cse232 48))) (and (<= 0 .cse232) (= (mod (+ .cse233 5) 9) 0) (= (mod .cse234 10) 0) (= (mod (+ .cse233 8) 9) 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ (* 10 .cse233) 440) 9))))))) (exists ((v_prenex_44 Int)) (let ((.cse235 (* 9 v_prenex_44))) (let ((.cse236 (mod (div .cse235 10) 48))) (let ((.cse238 (* 10 .cse236))) (let ((.cse237 (+ .cse238 440))) (and (<= 0 .cse235) (= 0 .cse236) (<= 0 .cse237) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div .cse237 9)) (< .cse238 40) (not (= (mod (+ .cse236 5) 9) 0)))))))) (exists ((v_prenex_22 Int)) (let ((.cse242 (* 9 v_prenex_22))) (let ((.cse241 (+ (div .cse242 10) 1))) (let ((.cse240 (mod .cse241 48))) (let ((.cse239 (+ (* 10 .cse240) 440))) (and (< .cse239 0) (not (= 0 (mod (+ .cse240 8) 9))) (<= 0 .cse241) (< .cse242 0) (not (= (mod .cse242 10) 0)) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (+ (div .cse239 9) 1)) (= (mod (+ .cse240 5) 9) 0))))))) (exists ((v_prenex_43 Int)) (let ((.cse246 (* 9 v_prenex_43))) (let ((.cse245 (mod (div .cse246 10) 48))) (let ((.cse244 (* 10 .cse245))) (let ((.cse243 (+ .cse244 440))) (and (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div .cse243 9)) (<= 0 .cse243) (<= 40 .cse244) (= 0 .cse245) (<= 0 .cse246))))))) (exists ((v_prenex_40 Int)) (let ((.cse250 (* 9 v_prenex_40))) (let ((.cse248 (div .cse250 10))) (let ((.cse247 (mod .cse248 48))) (let ((.cse249 (* 10 .cse247))) (and (not (= (mod (+ .cse247 8) 9) 0)) (< .cse248 0) (< (+ .cse249 440) 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ .cse249 (- 40)) 9)) (<= 0 .cse250) (= (mod (+ .cse247 5) 9) 0) (not (= 0 .cse247)))))))) (exists ((v_prenex_80 Int)) (let ((.cse253 (* 9 v_prenex_80))) (let ((.cse254 (+ (div .cse253 10) 1))) (let ((.cse251 (mod .cse254 48))) (let ((.cse255 (* 10 .cse251))) (let ((.cse252 (+ .cse255 440))) (and (not (= (mod (+ .cse251 5) 9) 0)) (<= 0 .cse252) (not (= (mod .cse253 10) 0)) (<= 0 .cse254) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div .cse252 9)) (< .cse253 0) (< .cse255 40)))))))) (exists ((v_prenex_7 Int)) (let ((.cse257 (* 9 v_prenex_7))) (let ((.cse258 (div .cse257 10))) (let ((.cse256 (mod .cse258 48))) (and (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ (* 10 .cse256) (- 40)) 9)) (<= 0 .cse257) (< .cse258 0) (= (mod (+ .cse256 5) 9) 0) (not (= 0 .cse256)) (= (mod (+ .cse256 8) 9) 0)))))) (exists ((v_prenex_39 Int)) (let ((.cse261 (* 9 v_prenex_39))) (let ((.cse259 (+ (div .cse261 10) 1))) (let ((.cse260 (mod .cse259 48))) (let ((.cse262 (* 10 .cse260))) (and (< .cse259 0) (not (= 0 .cse260)) (not (= (mod .cse261 10) 0)) (< .cse261 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ .cse262 (- 40)) 9)) (<= 40 .cse262) (= 0 (mod (+ .cse260 8) 9)))))))) (exists ((v_prenex_81 Int)) (let ((.cse265 (* 9 v_prenex_81))) (let ((.cse264 (mod (div .cse265 10) 48))) (let ((.cse266 (* 10 .cse264))) (let ((.cse263 (+ .cse266 440))) (and (< .cse263 0) (= 0 .cse264) (<= 0 .cse265) (not (= (mod (+ .cse264 5) 9) 0)) (not (= (mod (+ .cse264 8) 9) 0)) (< .cse266 40) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (+ (div .cse263 9) 1)))))))) (exists ((v_prenex_84 Int)) (let ((.cse267 (* 9 v_prenex_84))) (let ((.cse268 (mod (+ (div .cse267 10) 1) 48))) (let ((.cse269 (* 10 .cse268))) (let ((.cse270 (+ .cse269 440))) (and (not (= (mod .cse267 10) 0)) (= 0 .cse268) (<= 40 .cse269) (not (= 0 (mod (+ .cse268 8) 9))) (< .cse270 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (+ (div .cse270 9) 1)) (< .cse267 0))))))) (exists ((v_prenex_9 Int)) (let ((.cse273 (* 9 v_prenex_9))) (let ((.cse271 (mod (+ (div .cse273 10) 1) 48))) (let ((.cse272 (* 10 .cse271))) (and (= 0 (mod (+ .cse271 8) 9)) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ .cse272 440) 9)) (< .cse273 0) (not (= (mod .cse273 10) 0)) (= 0 .cse271) (< .cse272 40) (not (= (mod (+ .cse271 5) 9) 0))))))) (exists ((v_prenex_47 Int)) (let ((.cse274 (* 9 v_prenex_47))) (let ((.cse276 (mod (+ (div .cse274 10) 1) 48))) (let ((.cse275 (* 10 .cse276))) (let ((.cse277 (+ .cse275 440))) (and (< .cse274 0) (not (= (mod .cse274 10) 0)) (<= 40 .cse275) (= 0 .cse276) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div .cse277 9)) (<= 0 .cse277))))))) (exists ((v_prenex_12 Int)) (let ((.cse281 (* 9 v_prenex_12))) (let ((.cse280 (div .cse281 10))) (let ((.cse278 (mod .cse280 48))) (let ((.cse279 (* 10 .cse278))) (and (not (= 0 .cse278)) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ .cse279 (- 40)) 9)) (< .cse280 0) (<= 0 .cse281) (= (mod (+ .cse278 8) 9) 0) (<= 40 .cse279))))))) (exists ((v_prenex_72 Int)) (let ((.cse284 (* 9 v_prenex_72))) (let ((.cse282 (div .cse284 10))) (let ((.cse285 (mod .cse282 48))) (let ((.cse283 (* 10 .cse285))) (and (<= 0 .cse282) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ .cse283 440) 9)) (<= 40 .cse283) (<= 0 .cse284) (= (mod (+ .cse285 8) 9) 0))))))) (exists ((v_prenex_6 Int)) (let ((.cse286 (* 9 v_prenex_6))) (let ((.cse289 (div .cse286 10))) (let ((.cse290 (mod .cse289 48))) (let ((.cse288 (* 10 .cse290))) (let ((.cse287 (+ .cse288 440))) (and (<= 0 .cse286) (<= 0 .cse287) (< .cse288 40) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div .cse287 9)) (<= 0 .cse289) (not (= (mod (+ .cse290 5) 9) 0))))))))) (exists ((v_prenex_42 Int)) (let ((.cse291 (* 9 v_prenex_42))) (let ((.cse294 (+ (div .cse291 10) 1))) (let ((.cse292 (mod .cse294 48))) (let ((.cse293 (* 10 .cse292))) (and (not (= (mod .cse291 10) 0)) (not (= 0 .cse292)) (< .cse291 0) (= 0 (mod (+ .cse292 8) 9)) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (+ (div (+ .cse293 (- 40)) 9) 1)) (not (= (mod (+ .cse292 5) 9) 0)) (< .cse293 40) (< .cse294 0))))))) (exists ((v_prenex_48 Int)) (let ((.cse295 (* 9 v_prenex_48))) (let ((.cse297 (+ (div .cse295 10) 1))) (let ((.cse296 (mod .cse297 48))) (let ((.cse298 (* 10 .cse296))) (and (not (= (mod .cse295 10) 0)) (= 0 (mod (+ .cse296 8) 9)) (<= 0 .cse297) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ .cse298 440) 9)) (< .cse295 0) (not (= (mod (+ .cse296 5) 9) 0)) (< .cse298 40))))))) (exists ((v_prenex_52 Int)) (let ((.cse300 (* 9 v_prenex_52))) (let ((.cse301 (mod (div .cse300 10) 48))) (let ((.cse299 (* 10 .cse301))) (and (<= 40 .cse299) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ .cse299 440) 9)) (<= 0 .cse300) (= 0 .cse301) (= (mod (+ .cse301 8) 9) 0)))))) (exists ((v_prenex_70 Int)) (let ((.cse305 (* 9 v_prenex_70))) (let ((.cse304 (div .cse305 10))) (let ((.cse302 (mod .cse304 48))) (let ((.cse303 (* 10 .cse302))) (and (not (= 0 .cse302)) (< (+ .cse303 440) 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ .cse303 (- 40)) 9)) (< .cse304 0) (<= 0 .cse305) (<= 40 .cse303) (not (= (mod (+ .cse302 8) 9) 0)))))))) (exists ((v_prenex_24 Int)) (let ((.cse306 (* 9 v_prenex_24))) (let ((.cse307 (mod (div .cse306 10) 48))) (let ((.cse308 (* 10 .cse307))) (and (= (mod .cse306 10) 0) (= (mod (+ .cse307 8) 9) 0) (<= c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 (div (+ .cse308 440) 9)) (<= 40 .cse308) (= 0 .cse307))))))) is different from false [2018-07-24 03:22:02,084 WARN L169 SmtUtils]: Spent 1.56 m on a formula simplification. DAG size of input: 6873 DAG size of output: 225 Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown