java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/loop-acceleration/phases_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:04:32,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:04:32,855 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:04:32,872 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:04:32,872 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:04:32,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:04:32,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:04:32,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:04:32,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:04:32,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:04:32,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:04:32,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:04:32,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:04:32,899 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:04:32,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:04:32,903 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:04:32,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:04:32,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:04:32,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:04:32,911 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:04:32,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:04:32,918 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:04:32,922 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:04:32,923 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:04:32,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:04:32,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:04:32,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:04:32,927 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:04:32,928 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:04:32,929 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:04:32,929 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:04:32,930 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:04:32,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:04:32,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:04:32,933 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:04:32,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:04:32,934 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:04:32,934 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:04:32,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:04:32,935 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:04:32,936 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:04:32,937 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:04:32,970 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:04:32,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:04:32,975 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:04:32,975 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:04:32,975 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:04:32,975 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:04:32,975 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:04:32,976 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:04:32,976 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:04:32,976 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:04:32,978 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:04:32,978 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:04:32,979 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:04:32,979 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:04:32,979 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:04:32,979 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:04:32,979 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:04:32,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:04:32,980 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:04:32,980 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:04:32,980 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:04:32,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:04:32,981 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:04:32,981 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:04:32,981 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:04:32,985 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:04:32,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:04:32,986 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:04:32,986 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:04:33,301 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:04:33,314 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:04:33,318 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:04:33,319 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:04:33,320 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:04:33,320 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_2-2.c [2019-10-15 01:04:33,393 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d39f241f/ea325b4fb16747a095ded1b998574359/FLAG41d84e2a9 [2019-10-15 01:04:33,835 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:04:33,836 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_2-2.c [2019-10-15 01:04:33,842 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d39f241f/ea325b4fb16747a095ded1b998574359/FLAG41d84e2a9 [2019-10-15 01:04:34,240 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d39f241f/ea325b4fb16747a095ded1b998574359 [2019-10-15 01:04:34,251 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:04:34,252 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:04:34,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:04:34,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:04:34,257 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:04:34,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:04:34" (1/1) ... [2019-10-15 01:04:34,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4de72e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:34, skipping insertion in model container [2019-10-15 01:04:34,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:04:34" (1/1) ... [2019-10-15 01:04:34,269 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:04:34,286 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:04:34,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:04:34,459 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:04:34,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:04:34,493 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:04:34,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:34 WrapperNode [2019-10-15 01:04:34,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:04:34,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:04:34,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:04:34,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:04:34,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:34" (1/1) ... [2019-10-15 01:04:34,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:34" (1/1) ... [2019-10-15 01:04:34,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:34" (1/1) ... [2019-10-15 01:04:34,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:34" (1/1) ... [2019-10-15 01:04:34,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:34" (1/1) ... [2019-10-15 01:04:34,639 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:34" (1/1) ... [2019-10-15 01:04:34,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:34" (1/1) ... [2019-10-15 01:04:34,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:04:34,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:04:34,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:04:34,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:04:34,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:04:34,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:04:34,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:04:34,718 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-15 01:04:34,718 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:04:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:04:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:04:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-15 01:04:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 01:04:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:04:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:04:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:04:34,946 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:04:34,947 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:04:34,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:04:34 BoogieIcfgContainer [2019-10-15 01:04:34,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:04:34,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:04:34,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:04:34,953 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:04:34,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:04:34" (1/3) ... [2019-10-15 01:04:34,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194d0e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:04:34, skipping insertion in model container [2019-10-15 01:04:34,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:34" (2/3) ... [2019-10-15 01:04:34,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194d0e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:04:34, skipping insertion in model container [2019-10-15 01:04:34,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:04:34" (3/3) ... [2019-10-15 01:04:34,957 INFO L109 eAbstractionObserver]: Analyzing ICFG phases_2-2.c [2019-10-15 01:04:34,967 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:04:34,976 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:04:34,989 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:04:35,028 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:04:35,028 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:04:35,030 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:04:35,030 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:04:35,031 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:04:35,031 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:04:35,031 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:04:35,031 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:04:35,070 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-15 01:04:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-15 01:04:35,078 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:35,079 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:35,082 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:35,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:35,091 INFO L82 PathProgramCache]: Analyzing trace with hash -133618162, now seen corresponding path program 1 times [2019-10-15 01:04:35,106 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:35,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161033371] [2019-10-15 01:04:35,107 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:35,107 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:35,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:35,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:35,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161033371] [2019-10-15 01:04:35,229 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:35,229 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-15 01:04:35,229 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097283229] [2019-10-15 01:04:35,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 01:04:35,234 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:35,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 01:04:35,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 01:04:35,251 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-10-15 01:04:35,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:35,274 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-10-15 01:04:35,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 01:04:35,276 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-10-15 01:04:35,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:35,287 INFO L225 Difference]: With dead ends: 30 [2019-10-15 01:04:35,287 INFO L226 Difference]: Without dead ends: 13 [2019-10-15 01:04:35,294 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 01:04:35,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-10-15 01:04:35,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-15 01:04:35,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-15 01:04:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-10-15 01:04:35,330 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2019-10-15 01:04:35,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:35,330 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-10-15 01:04:35,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 01:04:35,331 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-10-15 01:04:35,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-15 01:04:35,331 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:35,332 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:35,332 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:35,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:35,332 INFO L82 PathProgramCache]: Analyzing trace with hash -142853372, now seen corresponding path program 1 times [2019-10-15 01:04:35,333 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:35,333 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234378073] [2019-10-15 01:04:35,333 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:35,333 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:35,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:35,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:35,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234378073] [2019-10-15 01:04:35,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:35,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:04:35,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845590730] [2019-10-15 01:04:35,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:04:35,613 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:35,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:04:35,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:04:35,614 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-10-15 01:04:37,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:37,709 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-10-15 01:04:37,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:04:37,710 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-10-15 01:04:37,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:37,712 INFO L225 Difference]: With dead ends: 20 [2019-10-15 01:04:37,712 INFO L226 Difference]: Without dead ends: 15 [2019-10-15 01:04:37,713 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:04:37,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-10-15 01:04:37,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-10-15 01:04:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-15 01:04:37,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-10-15 01:04:37,719 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2019-10-15 01:04:37,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:37,720 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-10-15 01:04:37,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:04:37,720 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-10-15 01:04:37,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 01:04:37,724 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:37,724 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:37,724 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:37,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:37,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1232195137, now seen corresponding path program 1 times [2019-10-15 01:04:37,725 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:37,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133195297] [2019-10-15 01:04:37,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:37,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:37,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:37,734 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-15 01:04:37,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [126901574] [2019-10-15 01:04:37,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:04:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:37,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 01:04:37,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:04:37,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:37,828 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:04:37,994 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~y~0 Int)) (let ((.cse0 (mod main_~y~0 4294967296))) (or (< (mod (* c_main_~x~0 c_main_~x~0) 4294967296) .cse0) (<= .cse0 (mod c_main_~x~0 4294967296))))) is different from true [2019-10-15 01:04:38,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2019-10-15 01:04:38,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133195297] [2019-10-15 01:04:38,011 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:04:38,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126901574] [2019-10-15 01:04:38,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:04:38,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-10-15 01:04:38,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214836574] [2019-10-15 01:04:38,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:04:38,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:38,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:04:38,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=19, Unknown=1, NotChecked=8, Total=42 [2019-10-15 01:04:38,014 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 4 states. [2019-10-15 01:04:40,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:40,059 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-10-15 01:04:40,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:04:40,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-15 01:04:40,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:40,060 INFO L225 Difference]: With dead ends: 21 [2019-10-15 01:04:40,060 INFO L226 Difference]: Without dead ends: 16 [2019-10-15 01:04:40,061 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=19, Unknown=1, NotChecked=8, Total=42 [2019-10-15 01:04:40,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-15 01:04:40,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-10-15 01:04:40,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-15 01:04:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-10-15 01:04:40,066 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 13 [2019-10-15 01:04:40,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:40,066 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-10-15 01:04:40,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:04:40,066 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-10-15 01:04:40,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 01:04:40,067 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:40,067 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:40,270 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:04:40,271 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:40,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:40,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1289453439, now seen corresponding path program 1 times [2019-10-15 01:04:40,272 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:40,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292624603] [2019-10-15 01:04:40,273 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:40,274 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:40,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:40,281 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-15 01:04:40,282 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [816298244] [2019-10-15 01:04:40,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:04:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:40,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-15 01:04:40,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:04:40,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:40,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:40,413 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:04:40,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:40,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292624603] [2019-10-15 01:04:40,545 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:04:40,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816298244] [2019-10-15 01:04:40,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:04:40,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2019-10-15 01:04:40,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043614737] [2019-10-15 01:04:40,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:04:40,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:40,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:04:40,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:04:40,549 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 7 states. [2019-10-15 01:04:46,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:46,698 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-10-15 01:04:46,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:04:46,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-10-15 01:04:46,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:46,700 INFO L225 Difference]: With dead ends: 21 [2019-10-15 01:04:46,700 INFO L226 Difference]: Without dead ends: 16 [2019-10-15 01:04:46,700 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:04:46,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-15 01:04:46,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-15 01:04:46,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-15 01:04:46,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-10-15 01:04:46,705 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2019-10-15 01:04:46,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:46,705 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-10-15 01:04:46,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:04:46,706 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-10-15 01:04:46,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 01:04:46,706 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:46,707 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:46,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:04:46,910 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:46,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:46,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1005461508, now seen corresponding path program 1 times [2019-10-15 01:04:46,911 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:46,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634015017] [2019-10-15 01:04:46,912 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:46,912 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:46,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:46,918 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-15 01:04:46,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [985339557] [2019-10-15 01:04:46,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:04:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:46,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 01:04:46,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:04:47,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:47,048 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:04:47,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:04:47,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:04:47,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:04:47,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:04:47,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:04:47,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:04:47,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:04:47,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:04:47,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:04:47,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:04:47,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:04:47,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:04:47,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:04:47,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:04:47,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:04:47,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:47,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:04:49,464 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse32 (mod c_main_~x~0 4294967296))) (let ((.cse1 (forall ((main_~y~0 Int)) (let ((.cse60 (mod main_~y~0 4294967296)) (.cse61 (mod c_main_~x~0 4294967296))) (let ((.cse62 (div .cse60 .cse61))) (or (<= .cse60 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse61 (mod .cse62 4294967296)) (not (= (mod .cse60 .cse61) 0)) (< .cse61 (mod (+ .cse62 4294967295) 4294967296))))))) (.cse5 (forall ((main_~y~0 Int)) (let ((.cse57 (mod main_~y~0 4294967296)) (.cse58 (mod c_main_~x~0 4294967296))) (let ((.cse59 (div .cse57 .cse58))) (or (<= .cse57 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse58 (mod .cse59 4294967296)) (<= 0 .cse57) (= (mod .cse57 .cse58) 0) (< .cse58 (mod (+ .cse59 1) 4294967296)) (< .cse58 (mod (+ .cse59 4294967295) 4294967296))))))) (.cse18 (forall ((main_~y~0 Int)) (let ((.cse55 (mod main_~y~0 4294967296)) (.cse56 (mod c_main_~x~0 4294967296))) (or (<= .cse55 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse56 (mod (div .cse55 .cse56) 4294967296)) (not (= (mod .cse55 .cse56) 0)))))) (.cse10 (forall ((main_~y~0 Int)) (let ((.cse52 (mod main_~y~0 4294967296)) (.cse53 (mod c_main_~x~0 4294967296))) (let ((.cse54 (div .cse52 .cse53))) (or (<= .cse52 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse53 (mod .cse54 4294967296)) (< .cse53 (mod (+ .cse54 1) 4294967296)) (< .cse53 (mod (+ .cse54 4294967295) 4294967296)) (< .cse52 0)))))) (.cse25 (forall ((main_~y~0 Int)) (let ((.cse49 (mod main_~y~0 4294967296)) (.cse50 (mod c_main_~x~0 4294967296))) (let ((.cse51 (div .cse49 .cse50))) (or (<= .cse49 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse50 (mod .cse51 4294967296)) (< .cse50 (mod (+ .cse51 4294967295) 4294967296)) (< .cse49 0)))))) (.cse26 (forall ((main_~y~0 Int)) (let ((.cse46 (mod main_~y~0 4294967296)) (.cse47 (mod c_main_~x~0 4294967296))) (let ((.cse48 (div .cse46 .cse47))) (or (<= .cse46 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse47 (mod .cse48 4294967296)) (not (= (mod .cse46 .cse47) 0)) (< .cse47 (mod (+ .cse48 1) 4294967296))))))) (.cse17 (forall ((main_~y~0 Int)) (let ((.cse45 (mod c_main_~x~0 4294967296)) (.cse44 (mod main_~y~0 4294967296))) (or (<= .cse44 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse45 (mod (div .cse44 .cse45) 4294967296)) (not (= (mod .cse44 .cse45) 0)) (< .cse44 0))))) (.cse12 (forall ((main_~y~0 Int)) (let ((.cse41 (mod main_~y~0 4294967296)) (.cse42 (mod c_main_~x~0 4294967296))) (let ((.cse43 (div .cse41 .cse42))) (or (<= .cse41 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse42 (mod .cse43 4294967296)) (< .cse42 (mod (+ .cse43 1) 4294967296)) (< .cse42 (mod (+ .cse43 4294967295) 4294967296))))))) (.cse11 (forall ((main_~y~0 Int)) (let ((.cse39 (mod main_~y~0 4294967296))) (or (<= .cse39 (mod (+ c_main_~x~0 1) 4294967296)) (let ((.cse40 (mod c_main_~x~0 4294967296))) (< .cse40 (mod (div .cse39 .cse40) 4294967296))) (< .cse39 0))))) (.cse9 (< .cse32 0)) (.cse13 (forall ((main_~y~0 Int)) (let ((.cse36 (mod main_~y~0 4294967296)) (.cse37 (mod c_main_~x~0 4294967296))) (let ((.cse38 (div .cse36 .cse37))) (or (<= .cse36 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse37 (mod .cse38 4294967296)) (< .cse37 (mod (+ .cse38 1) 4294967296)) (< .cse36 0)))))) (.cse6 (forall ((main_~y~0 Int)) (let ((.cse33 (mod main_~y~0 4294967296)) (.cse34 (mod c_main_~x~0 4294967296))) (let ((.cse35 (div .cse33 .cse34))) (or (<= .cse33 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse34 (mod .cse35 4294967296)) (not (= (mod .cse33 .cse34) 0)) (< .cse34 (mod (+ .cse35 1) 4294967296)) (< .cse34 (mod (+ .cse35 4294967295) 4294967296))))))) (.cse0 (<= 0 .cse32))) (and (or .cse0 .cse1) (forall ((main_~y~0 Int)) (let ((.cse2 (mod main_~y~0 4294967296)) (.cse3 (mod c_main_~x~0 4294967296))) (let ((.cse4 (div .cse2 .cse3))) (or (<= .cse2 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse3 (mod .cse4 4294967296)) (not (= (mod .cse2 .cse3) 0)) (< .cse3 (mod (+ .cse4 1) 4294967296)) (< .cse2 0))))) (or .cse0 .cse5) .cse6 (or (forall ((main_~y~0 Int)) (let ((.cse7 (mod main_~y~0 4294967296)) (.cse8 (mod c_main_~x~0 4294967296))) (or (<= .cse7 (mod (+ c_main_~x~0 1) 4294967296)) (<= 0 .cse7) (= (mod .cse7 .cse8) 0) (< .cse8 (mod (+ (div .cse7 .cse8) 1) 4294967296))))) .cse9) (or .cse10 .cse0) .cse11 (or .cse12 .cse9) (or .cse11 .cse0) .cse1 .cse13 (forall ((main_~y~0 Int)) (let ((.cse14 (mod main_~y~0 4294967296)) (.cse15 (mod c_main_~x~0 4294967296))) (let ((.cse16 (div .cse14 .cse15))) (or (<= .cse14 (mod (+ c_main_~x~0 1) 4294967296)) (<= 0 .cse14) (= (mod .cse14 .cse15) 0) (< .cse15 (mod (+ .cse16 1) 4294967296)) (< .cse15 (mod (+ .cse16 4294967295) 4294967296)))))) .cse17 (or .cse0 .cse18) .cse18 .cse5 (or .cse9 .cse5) (or .cse9 .cse18) (or .cse12 .cse0) .cse10 (or (forall ((main_~y~0 Int)) (let ((.cse19 (mod main_~y~0 4294967296)) (.cse20 (mod c_main_~x~0 4294967296))) (let ((.cse21 (div .cse19 .cse20))) (or (<= .cse19 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse20 (mod .cse21 4294967296)) (< .cse20 (mod (+ .cse21 1) 4294967296)))))) .cse9) (or (forall ((main_~y~0 Int)) (let ((.cse22 (mod main_~y~0 4294967296)) (.cse23 (mod c_main_~x~0 4294967296))) (let ((.cse24 (div .cse22 .cse23))) (or (<= .cse22 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse23 (mod .cse24 4294967296)) (<= 0 .cse22) (= (mod .cse22 .cse23) 0) (< .cse23 (mod (+ .cse24 1) 4294967296)))))) .cse9) (or .cse25 .cse0) (or .cse9 .cse26) .cse25 .cse26 (or .cse0 .cse17) .cse12 (or (forall ((main_~y~0 Int)) (let ((.cse27 (mod main_~y~0 4294967296)) (.cse28 (mod c_main_~x~0 4294967296))) (let ((.cse29 (div .cse27 .cse28))) (or (<= .cse27 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse28 (mod .cse29 4294967296)) (< .cse28 (mod (+ .cse29 4294967295) 4294967296)))))) .cse0) (or .cse11 .cse9) (or .cse9 .cse13) (or .cse6 .cse0) (or (forall ((main_~y~0 Int)) (let ((.cse30 (mod main_~y~0 4294967296)) (.cse31 (mod c_main_~x~0 4294967296))) (or (<= .cse30 (mod (+ c_main_~x~0 1) 4294967296)) (<= 0 .cse30) (= (mod .cse30 .cse31) 0) (< .cse31 (mod (+ (div .cse30 .cse31) 4294967295) 4294967296))))) .cse0)))) is different from false [2019-10-15 01:04:51,942 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse91 (mod c_main_~x~0 4294967296))) (let ((.cse18 (< .cse91 0)) (.cse0 (<= 0 .cse91))) (and (or .cse0 (forall ((main_~y~0 Int)) (let ((.cse1 (mod main_~y~0 4294967296)) (.cse2 (mod c_main_~x~0 4294967296))) (let ((.cse3 (div .cse1 .cse2))) (or (<= .cse1 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse2 (mod .cse3 4294967296)) (not (= (mod .cse1 .cse2) 0)) (< .cse2 (mod (+ .cse3 4294967295) 4294967296))))))) (or (forall ((v_prenex_18 Int)) (let ((.cse4 (mod v_prenex_18 4294967296)) (.cse5 (mod c_main_~x~0 4294967296))) (let ((.cse6 (div .cse4 .cse5))) (or (<= .cse4 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse5 (mod .cse6 4294967296)) (< .cse5 (mod (+ .cse6 1) 4294967296)) (< .cse5 (mod (+ .cse6 4294967295) 4294967296)))))) .cse0) (forall ((v_prenex_12 Int)) (let ((.cse7 (mod v_prenex_12 4294967296)) (.cse8 (mod c_main_~x~0 4294967296))) (or (<= .cse7 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse7 0) (< .cse8 (mod (div .cse7 .cse8) 4294967296)) (not (= (mod .cse7 .cse8) 0))))) (forall ((v_prenex_19 Int)) (let ((.cse11 (mod v_prenex_19 4294967296)) (.cse9 (mod c_main_~x~0 4294967296))) (let ((.cse10 (div .cse11 .cse9))) (or (< .cse9 (mod (+ .cse10 1) 4294967296)) (< .cse11 0) (< .cse9 (mod .cse10 4294967296)) (<= .cse11 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse9 (mod (+ .cse10 4294967295) 4294967296)))))) (or .cse0 (forall ((v_prenex_26 Int)) (let ((.cse12 (mod c_main_~x~0 4294967296)) (.cse13 (mod v_prenex_26 4294967296))) (or (< .cse12 (mod (div .cse13 .cse12) 4294967296)) (not (= (mod .cse13 .cse12) 0)) (< .cse13 0) (<= .cse13 (mod (+ c_main_~x~0 1) 4294967296)))))) (or (forall ((v_prenex_13 Int)) (let ((.cse15 (mod v_prenex_13 4294967296)) (.cse14 (mod c_main_~x~0 4294967296))) (or (< .cse14 (mod (div .cse15 .cse14) 4294967296)) (<= .cse15 (mod (+ c_main_~x~0 1) 4294967296)) (not (= (mod .cse15 .cse14) 0))))) .cse0) (or .cse0 (forall ((v_prenex_32 Int)) (let ((.cse16 (mod v_prenex_32 4294967296)) (.cse17 (mod c_main_~x~0 4294967296))) (or (= (mod .cse16 .cse17) 0) (<= 0 .cse16) (<= .cse16 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse17 (mod (+ (div .cse16 .cse17) 4294967295) 4294967296)))))) (or .cse18 (forall ((v_prenex_23 Int)) (let ((.cse19 (mod v_prenex_23 4294967296)) (.cse20 (mod c_main_~x~0 4294967296))) (let ((.cse21 (div .cse19 .cse20))) (or (not (= (mod .cse19 .cse20) 0)) (<= .cse19 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse20 (mod .cse21 4294967296)) (< .cse20 (mod (+ .cse21 1) 4294967296))))))) (forall ((v_prenex_10 Int)) (let ((.cse22 (mod v_prenex_10 4294967296)) (.cse23 (mod c_main_~x~0 4294967296))) (let ((.cse24 (div .cse22 .cse23))) (or (<= .cse22 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse23 (mod (+ .cse24 1) 4294967296)) (< .cse23 (mod .cse24 4294967296)) (< .cse22 0))))) (forall ((v_prenex_15 Int)) (let ((.cse25 (mod v_prenex_15 4294967296)) (.cse26 (mod c_main_~x~0 4294967296))) (let ((.cse27 (div .cse25 .cse26))) (or (<= 0 .cse25) (< .cse26 (mod (+ .cse27 4294967295) 4294967296)) (< .cse26 (mod (+ .cse27 1) 4294967296)) (= (mod .cse25 .cse26) 0) (<= .cse25 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse26 (mod .cse27 4294967296)))))) (or (forall ((v_prenex_31 Int)) (let ((.cse28 (mod v_prenex_31 4294967296)) (.cse29 (mod c_main_~x~0 4294967296))) (let ((.cse30 (div .cse28 .cse29))) (or (not (= (mod .cse28 .cse29) 0)) (< .cse29 (mod (+ .cse30 4294967295) 4294967296)) (< .cse29 (mod .cse30 4294967296)) (<= .cse28 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse29 (mod (+ .cse30 1) 4294967296)))))) .cse0) (or .cse0 (forall ((v_prenex_22 Int)) (let ((.cse31 (mod v_prenex_22 4294967296)) (.cse32 (mod c_main_~x~0 4294967296))) (let ((.cse33 (div .cse31 .cse32))) (or (< .cse31 0) (< .cse32 (mod (+ .cse33 4294967295) 4294967296)) (<= .cse31 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse32 (mod .cse33 4294967296))))))) (or .cse18 (forall ((v_prenex_4 Int)) (let ((.cse34 (mod v_prenex_4 4294967296)) (.cse35 (mod c_main_~x~0 4294967296))) (or (<= .cse34 (mod (+ c_main_~x~0 1) 4294967296)) (= (mod .cse34 .cse35) 0) (<= 0 .cse34) (< .cse35 (mod (+ (div .cse34 .cse35) 1) 4294967296)))))) (or (forall ((v_prenex_30 Int)) (let ((.cse36 (mod v_prenex_30 4294967296)) (.cse37 (mod c_main_~x~0 4294967296))) (let ((.cse38 (div .cse36 .cse37))) (or (< .cse36 0) (< .cse37 (mod (+ .cse38 1) 4294967296)) (<= .cse36 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse37 (mod .cse38 4294967296)))))) .cse18) (or .cse18 (forall ((v_prenex_16 Int)) (let ((.cse39 (mod v_prenex_16 4294967296)) (.cse40 (mod c_main_~x~0 4294967296))) (let ((.cse41 (div .cse39 .cse40))) (or (= (mod .cse39 .cse40) 0) (<= .cse39 (mod (+ c_main_~x~0 1) 4294967296)) (<= 0 .cse39) (< .cse40 (mod .cse41 4294967296)) (< .cse40 (mod (+ .cse41 4294967295) 4294967296)) (< .cse40 (mod (+ .cse41 1) 4294967296))))))) (or .cse0 (forall ((v_prenex_5 Int)) (let ((.cse44 (mod v_prenex_5 4294967296)) (.cse42 (mod c_main_~x~0 4294967296))) (let ((.cse43 (div .cse44 .cse42))) (or (< .cse42 (mod .cse43 4294967296)) (<= .cse44 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse42 (mod (+ .cse43 4294967295) 4294967296)) (< .cse44 0) (< .cse42 (mod (+ .cse43 1) 4294967296))))))) (or (forall ((v_prenex_2 Int)) (let ((.cse45 (mod v_prenex_2 4294967296)) (.cse46 (mod c_main_~x~0 4294967296))) (let ((.cse47 (div .cse45 .cse46))) (or (<= 0 .cse45) (< .cse46 (mod (+ .cse47 1) 4294967296)) (= (mod .cse45 .cse46) 0) (< .cse46 (mod (+ .cse47 4294967295) 4294967296)) (<= .cse45 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse46 (mod .cse47 4294967296)))))) .cse0) (forall ((v_prenex_27 Int)) (let ((.cse50 (mod v_prenex_27 4294967296)) (.cse48 (mod c_main_~x~0 4294967296))) (let ((.cse49 (div .cse50 .cse48))) (or (< .cse48 (mod (+ .cse49 1) 4294967296)) (<= .cse50 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse48 (mod .cse49 4294967296)) (< .cse48 (mod (+ .cse49 4294967295) 4294967296)))))) (forall ((v_prenex_25 Int)) (let ((.cse53 (mod v_prenex_25 4294967296)) (.cse51 (mod c_main_~x~0 4294967296))) (let ((.cse52 (div .cse53 .cse51))) (or (< .cse51 (mod .cse52 4294967296)) (not (= (mod .cse53 .cse51) 0)) (< .cse51 (mod (+ .cse52 1) 4294967296)) (<= .cse53 (mod (+ c_main_~x~0 1) 4294967296)))))) (or (forall ((v_prenex_20 Int)) (let ((.cse54 (mod v_prenex_20 4294967296)) (.cse55 (mod c_main_~x~0 4294967296))) (let ((.cse56 (div .cse54 .cse55))) (or (<= .cse54 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse55 (mod (+ .cse56 1) 4294967296)) (< .cse55 (mod .cse56 4294967296)))))) .cse18) (forall ((v_prenex_24 Int)) (let ((.cse57 (mod v_prenex_24 4294967296)) (.cse58 (mod c_main_~x~0 4294967296))) (let ((.cse59 (div .cse57 .cse58))) (or (<= .cse57 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse57 0) (< .cse58 (mod .cse59 4294967296)) (< .cse58 (mod (+ .cse59 4294967295) 4294967296)))))) (or (forall ((v_prenex_7 Int)) (let ((.cse60 (mod v_prenex_7 4294967296)) (.cse61 (mod c_main_~x~0 4294967296))) (let ((.cse62 (div .cse60 .cse61))) (or (<= .cse60 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse61 (mod .cse62 4294967296)) (< .cse61 (mod (+ .cse62 4294967295) 4294967296)) (< .cse61 (mod (+ .cse62 1) 4294967296)))))) .cse18) (forall ((v_prenex_11 Int)) (let ((.cse65 (mod v_prenex_11 4294967296)) (.cse63 (mod c_main_~x~0 4294967296))) (let ((.cse64 (div .cse65 .cse63))) (or (< .cse63 (mod (+ .cse64 4294967295) 4294967296)) (< .cse63 (mod (+ .cse64 1) 4294967296)) (= (mod .cse65 .cse63) 0) (<= 0 .cse65) (<= .cse65 (mod (+ c_main_~x~0 1) 4294967296)))))) (or (forall ((v_prenex_21 Int)) (let ((.cse66 (mod v_prenex_21 4294967296)) (.cse67 (mod c_main_~x~0 4294967296))) (let ((.cse68 (div .cse66 .cse67))) (or (<= .cse66 (mod (+ c_main_~x~0 1) 4294967296)) (<= 0 .cse66) (< .cse67 (mod (+ .cse68 1) 4294967296)) (= (mod .cse66 .cse67) 0) (< .cse67 (mod .cse68 4294967296)))))) .cse18) (forall ((v_prenex_14 Int)) (let ((.cse69 (mod c_main_~x~0 4294967296)) (.cse70 (mod v_prenex_14 4294967296))) (or (< .cse69 (mod (div .cse70 .cse69) 4294967296)) (not (= (mod .cse70 .cse69) 0)) (<= .cse70 (mod (+ c_main_~x~0 1) 4294967296))))) (forall ((v_prenex_9 Int)) (let ((.cse71 (mod v_prenex_9 4294967296)) (.cse72 (mod c_main_~x~0 4294967296))) (let ((.cse73 (div .cse71 .cse72))) (or (not (= (mod .cse71 .cse72) 0)) (< .cse72 (mod .cse73 4294967296)) (< .cse72 (mod (+ .cse73 4294967295) 4294967296)) (<= .cse71 (mod (+ c_main_~x~0 1) 4294967296)))))) (forall ((v_prenex_6 Int)) (let ((.cse74 (mod v_prenex_6 4294967296))) (or (<= .cse74 (mod (+ c_main_~x~0 1) 4294967296)) (let ((.cse75 (mod c_main_~x~0 4294967296))) (< .cse75 (mod (div .cse74 .cse75) 4294967296))) (< .cse74 0)))) (or (forall ((v_prenex_8 Int)) (let ((.cse77 (mod v_prenex_8 4294967296))) (or (let ((.cse76 (mod c_main_~x~0 4294967296))) (< .cse76 (mod (div .cse77 .cse76) 4294967296))) (<= .cse77 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse77 0)))) .cse0) (forall ((v_prenex_3 Int)) (let ((.cse80 (mod v_prenex_3 4294967296)) (.cse78 (mod c_main_~x~0 4294967296))) (let ((.cse79 (div .cse80 .cse78))) (or (< .cse78 (mod (+ .cse79 1) 4294967296)) (< .cse78 (mod (+ .cse79 4294967295) 4294967296)) (not (= (mod .cse80 .cse78) 0)) (< .cse78 (mod .cse79 4294967296)) (<= .cse80 (mod (+ c_main_~x~0 1) 4294967296)))))) (or .cse18 (forall ((v_prenex_17 Int)) (let ((.cse81 (mod c_main_~x~0 4294967296)) (.cse82 (mod v_prenex_17 4294967296))) (or (< .cse81 (mod (div .cse82 .cse81) 4294967296)) (not (= (mod .cse82 .cse81) 0)) (<= .cse82 (mod (+ c_main_~x~0 1) 4294967296)))))) (or (forall ((v_prenex_29 Int)) (let ((.cse83 (mod v_prenex_29 4294967296))) (or (<= .cse83 (mod (+ c_main_~x~0 1) 4294967296)) (let ((.cse84 (mod c_main_~x~0 4294967296))) (< .cse84 (mod (div .cse83 .cse84) 4294967296))) (< .cse83 0)))) .cse18) (forall ((v_prenex_1 Int)) (let ((.cse85 (mod v_prenex_1 4294967296)) (.cse86 (mod c_main_~x~0 4294967296))) (let ((.cse87 (div .cse85 .cse86))) (or (< .cse85 0) (< .cse86 (mod (+ .cse87 1) 4294967296)) (not (= (mod .cse85 .cse86) 0)) (< .cse86 (mod .cse87 4294967296)) (<= .cse85 (mod (+ c_main_~x~0 1) 4294967296)))))) (or (forall ((v_prenex_28 Int)) (let ((.cse90 (mod v_prenex_28 4294967296)) (.cse88 (mod c_main_~x~0 4294967296))) (let ((.cse89 (div .cse90 .cse88))) (or (< .cse88 (mod (+ .cse89 4294967295) 4294967296)) (< .cse88 (mod .cse89 4294967296)) (<= .cse90 (mod (+ c_main_~x~0 1) 4294967296)))))) .cse0)))) is different from false [2019-10-15 01:04:53,954 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse91 (mod c_main_~x~0 4294967296))) (let ((.cse18 (< .cse91 0)) (.cse0 (<= 0 .cse91))) (and (or .cse0 (forall ((main_~y~0 Int)) (let ((.cse1 (mod main_~y~0 4294967296)) (.cse2 (mod c_main_~x~0 4294967296))) (let ((.cse3 (div .cse1 .cse2))) (or (<= .cse1 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse2 (mod .cse3 4294967296)) (not (= (mod .cse1 .cse2) 0)) (< .cse2 (mod (+ .cse3 4294967295) 4294967296))))))) (or (forall ((v_prenex_18 Int)) (let ((.cse4 (mod v_prenex_18 4294967296)) (.cse5 (mod c_main_~x~0 4294967296))) (let ((.cse6 (div .cse4 .cse5))) (or (<= .cse4 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse5 (mod .cse6 4294967296)) (< .cse5 (mod (+ .cse6 1) 4294967296)) (< .cse5 (mod (+ .cse6 4294967295) 4294967296)))))) .cse0) (forall ((v_prenex_12 Int)) (let ((.cse7 (mod v_prenex_12 4294967296)) (.cse8 (mod c_main_~x~0 4294967296))) (or (<= .cse7 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse7 0) (< .cse8 (mod (div .cse7 .cse8) 4294967296)) (not (= (mod .cse7 .cse8) 0))))) (forall ((v_prenex_19 Int)) (let ((.cse11 (mod v_prenex_19 4294967296)) (.cse9 (mod c_main_~x~0 4294967296))) (let ((.cse10 (div .cse11 .cse9))) (or (< .cse9 (mod (+ .cse10 1) 4294967296)) (< .cse11 0) (< .cse9 (mod .cse10 4294967296)) (<= .cse11 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse9 (mod (+ .cse10 4294967295) 4294967296)))))) (or .cse0 (forall ((v_prenex_26 Int)) (let ((.cse12 (mod c_main_~x~0 4294967296)) (.cse13 (mod v_prenex_26 4294967296))) (or (< .cse12 (mod (div .cse13 .cse12) 4294967296)) (not (= (mod .cse13 .cse12) 0)) (< .cse13 0) (<= .cse13 (mod (+ c_main_~x~0 1) 4294967296)))))) (or (forall ((v_prenex_13 Int)) (let ((.cse15 (mod v_prenex_13 4294967296)) (.cse14 (mod c_main_~x~0 4294967296))) (or (< .cse14 (mod (div .cse15 .cse14) 4294967296)) (<= .cse15 (mod (+ c_main_~x~0 1) 4294967296)) (not (= (mod .cse15 .cse14) 0))))) .cse0) (or .cse0 (forall ((v_prenex_32 Int)) (let ((.cse16 (mod v_prenex_32 4294967296)) (.cse17 (mod c_main_~x~0 4294967296))) (or (= (mod .cse16 .cse17) 0) (<= 0 .cse16) (<= .cse16 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse17 (mod (+ (div .cse16 .cse17) 4294967295) 4294967296)))))) (or .cse18 (forall ((v_prenex_23 Int)) (let ((.cse19 (mod v_prenex_23 4294967296)) (.cse20 (mod c_main_~x~0 4294967296))) (let ((.cse21 (div .cse19 .cse20))) (or (not (= (mod .cse19 .cse20) 0)) (<= .cse19 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse20 (mod .cse21 4294967296)) (< .cse20 (mod (+ .cse21 1) 4294967296))))))) (forall ((v_prenex_10 Int)) (let ((.cse22 (mod v_prenex_10 4294967296)) (.cse23 (mod c_main_~x~0 4294967296))) (let ((.cse24 (div .cse22 .cse23))) (or (<= .cse22 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse23 (mod (+ .cse24 1) 4294967296)) (< .cse23 (mod .cse24 4294967296)) (< .cse22 0))))) (forall ((v_prenex_15 Int)) (let ((.cse25 (mod v_prenex_15 4294967296)) (.cse26 (mod c_main_~x~0 4294967296))) (let ((.cse27 (div .cse25 .cse26))) (or (<= 0 .cse25) (< .cse26 (mod (+ .cse27 4294967295) 4294967296)) (< .cse26 (mod (+ .cse27 1) 4294967296)) (= (mod .cse25 .cse26) 0) (<= .cse25 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse26 (mod .cse27 4294967296)))))) (or (forall ((v_prenex_31 Int)) (let ((.cse28 (mod v_prenex_31 4294967296)) (.cse29 (mod c_main_~x~0 4294967296))) (let ((.cse30 (div .cse28 .cse29))) (or (not (= (mod .cse28 .cse29) 0)) (< .cse29 (mod (+ .cse30 4294967295) 4294967296)) (< .cse29 (mod .cse30 4294967296)) (<= .cse28 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse29 (mod (+ .cse30 1) 4294967296)))))) .cse0) (or .cse0 (forall ((v_prenex_22 Int)) (let ((.cse31 (mod v_prenex_22 4294967296)) (.cse32 (mod c_main_~x~0 4294967296))) (let ((.cse33 (div .cse31 .cse32))) (or (< .cse31 0) (< .cse32 (mod (+ .cse33 4294967295) 4294967296)) (<= .cse31 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse32 (mod .cse33 4294967296))))))) (or .cse18 (forall ((v_prenex_4 Int)) (let ((.cse34 (mod v_prenex_4 4294967296)) (.cse35 (mod c_main_~x~0 4294967296))) (or (<= .cse34 (mod (+ c_main_~x~0 1) 4294967296)) (= (mod .cse34 .cse35) 0) (<= 0 .cse34) (< .cse35 (mod (+ (div .cse34 .cse35) 1) 4294967296)))))) (or (forall ((v_prenex_30 Int)) (let ((.cse36 (mod v_prenex_30 4294967296)) (.cse37 (mod c_main_~x~0 4294967296))) (let ((.cse38 (div .cse36 .cse37))) (or (< .cse36 0) (< .cse37 (mod (+ .cse38 1) 4294967296)) (<= .cse36 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse37 (mod .cse38 4294967296)))))) .cse18) (or .cse18 (forall ((v_prenex_16 Int)) (let ((.cse39 (mod v_prenex_16 4294967296)) (.cse40 (mod c_main_~x~0 4294967296))) (let ((.cse41 (div .cse39 .cse40))) (or (= (mod .cse39 .cse40) 0) (<= .cse39 (mod (+ c_main_~x~0 1) 4294967296)) (<= 0 .cse39) (< .cse40 (mod .cse41 4294967296)) (< .cse40 (mod (+ .cse41 4294967295) 4294967296)) (< .cse40 (mod (+ .cse41 1) 4294967296))))))) (or .cse0 (forall ((v_prenex_5 Int)) (let ((.cse44 (mod v_prenex_5 4294967296)) (.cse42 (mod c_main_~x~0 4294967296))) (let ((.cse43 (div .cse44 .cse42))) (or (< .cse42 (mod .cse43 4294967296)) (<= .cse44 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse42 (mod (+ .cse43 4294967295) 4294967296)) (< .cse44 0) (< .cse42 (mod (+ .cse43 1) 4294967296))))))) (or (forall ((v_prenex_2 Int)) (let ((.cse45 (mod v_prenex_2 4294967296)) (.cse46 (mod c_main_~x~0 4294967296))) (let ((.cse47 (div .cse45 .cse46))) (or (<= 0 .cse45) (< .cse46 (mod (+ .cse47 1) 4294967296)) (= (mod .cse45 .cse46) 0) (< .cse46 (mod (+ .cse47 4294967295) 4294967296)) (<= .cse45 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse46 (mod .cse47 4294967296)))))) .cse0) (forall ((v_prenex_27 Int)) (let ((.cse50 (mod v_prenex_27 4294967296)) (.cse48 (mod c_main_~x~0 4294967296))) (let ((.cse49 (div .cse50 .cse48))) (or (< .cse48 (mod (+ .cse49 1) 4294967296)) (<= .cse50 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse48 (mod .cse49 4294967296)) (< .cse48 (mod (+ .cse49 4294967295) 4294967296)))))) (forall ((v_prenex_25 Int)) (let ((.cse53 (mod v_prenex_25 4294967296)) (.cse51 (mod c_main_~x~0 4294967296))) (let ((.cse52 (div .cse53 .cse51))) (or (< .cse51 (mod .cse52 4294967296)) (not (= (mod .cse53 .cse51) 0)) (< .cse51 (mod (+ .cse52 1) 4294967296)) (<= .cse53 (mod (+ c_main_~x~0 1) 4294967296)))))) (or (forall ((v_prenex_20 Int)) (let ((.cse54 (mod v_prenex_20 4294967296)) (.cse55 (mod c_main_~x~0 4294967296))) (let ((.cse56 (div .cse54 .cse55))) (or (<= .cse54 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse55 (mod (+ .cse56 1) 4294967296)) (< .cse55 (mod .cse56 4294967296)))))) .cse18) (forall ((v_prenex_24 Int)) (let ((.cse57 (mod v_prenex_24 4294967296)) (.cse58 (mod c_main_~x~0 4294967296))) (let ((.cse59 (div .cse57 .cse58))) (or (<= .cse57 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse57 0) (< .cse58 (mod .cse59 4294967296)) (< .cse58 (mod (+ .cse59 4294967295) 4294967296)))))) (or (forall ((v_prenex_7 Int)) (let ((.cse60 (mod v_prenex_7 4294967296)) (.cse61 (mod c_main_~x~0 4294967296))) (let ((.cse62 (div .cse60 .cse61))) (or (<= .cse60 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse61 (mod .cse62 4294967296)) (< .cse61 (mod (+ .cse62 4294967295) 4294967296)) (< .cse61 (mod (+ .cse62 1) 4294967296)))))) .cse18) (forall ((v_prenex_11 Int)) (let ((.cse65 (mod v_prenex_11 4294967296)) (.cse63 (mod c_main_~x~0 4294967296))) (let ((.cse64 (div .cse65 .cse63))) (or (< .cse63 (mod (+ .cse64 4294967295) 4294967296)) (< .cse63 (mod (+ .cse64 1) 4294967296)) (= (mod .cse65 .cse63) 0) (<= 0 .cse65) (<= .cse65 (mod (+ c_main_~x~0 1) 4294967296)))))) (or (forall ((v_prenex_21 Int)) (let ((.cse66 (mod v_prenex_21 4294967296)) (.cse67 (mod c_main_~x~0 4294967296))) (let ((.cse68 (div .cse66 .cse67))) (or (<= .cse66 (mod (+ c_main_~x~0 1) 4294967296)) (<= 0 .cse66) (< .cse67 (mod (+ .cse68 1) 4294967296)) (= (mod .cse66 .cse67) 0) (< .cse67 (mod .cse68 4294967296)))))) .cse18) (forall ((v_prenex_14 Int)) (let ((.cse69 (mod c_main_~x~0 4294967296)) (.cse70 (mod v_prenex_14 4294967296))) (or (< .cse69 (mod (div .cse70 .cse69) 4294967296)) (not (= (mod .cse70 .cse69) 0)) (<= .cse70 (mod (+ c_main_~x~0 1) 4294967296))))) (forall ((v_prenex_9 Int)) (let ((.cse71 (mod v_prenex_9 4294967296)) (.cse72 (mod c_main_~x~0 4294967296))) (let ((.cse73 (div .cse71 .cse72))) (or (not (= (mod .cse71 .cse72) 0)) (< .cse72 (mod .cse73 4294967296)) (< .cse72 (mod (+ .cse73 4294967295) 4294967296)) (<= .cse71 (mod (+ c_main_~x~0 1) 4294967296)))))) (forall ((v_prenex_6 Int)) (let ((.cse74 (mod v_prenex_6 4294967296))) (or (<= .cse74 (mod (+ c_main_~x~0 1) 4294967296)) (let ((.cse75 (mod c_main_~x~0 4294967296))) (< .cse75 (mod (div .cse74 .cse75) 4294967296))) (< .cse74 0)))) (or (forall ((v_prenex_8 Int)) (let ((.cse77 (mod v_prenex_8 4294967296))) (or (let ((.cse76 (mod c_main_~x~0 4294967296))) (< .cse76 (mod (div .cse77 .cse76) 4294967296))) (<= .cse77 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse77 0)))) .cse0) (forall ((v_prenex_3 Int)) (let ((.cse80 (mod v_prenex_3 4294967296)) (.cse78 (mod c_main_~x~0 4294967296))) (let ((.cse79 (div .cse80 .cse78))) (or (< .cse78 (mod (+ .cse79 1) 4294967296)) (< .cse78 (mod (+ .cse79 4294967295) 4294967296)) (not (= (mod .cse80 .cse78) 0)) (< .cse78 (mod .cse79 4294967296)) (<= .cse80 (mod (+ c_main_~x~0 1) 4294967296)))))) (or .cse18 (forall ((v_prenex_17 Int)) (let ((.cse81 (mod c_main_~x~0 4294967296)) (.cse82 (mod v_prenex_17 4294967296))) (or (< .cse81 (mod (div .cse82 .cse81) 4294967296)) (not (= (mod .cse82 .cse81) 0)) (<= .cse82 (mod (+ c_main_~x~0 1) 4294967296)))))) (or (forall ((v_prenex_29 Int)) (let ((.cse83 (mod v_prenex_29 4294967296))) (or (<= .cse83 (mod (+ c_main_~x~0 1) 4294967296)) (let ((.cse84 (mod c_main_~x~0 4294967296))) (< .cse84 (mod (div .cse83 .cse84) 4294967296))) (< .cse83 0)))) .cse18) (forall ((v_prenex_1 Int)) (let ((.cse85 (mod v_prenex_1 4294967296)) (.cse86 (mod c_main_~x~0 4294967296))) (let ((.cse87 (div .cse85 .cse86))) (or (< .cse85 0) (< .cse86 (mod (+ .cse87 1) 4294967296)) (not (= (mod .cse85 .cse86) 0)) (< .cse86 (mod .cse87 4294967296)) (<= .cse85 (mod (+ c_main_~x~0 1) 4294967296)))))) (or (forall ((v_prenex_28 Int)) (let ((.cse90 (mod v_prenex_28 4294967296)) (.cse88 (mod c_main_~x~0 4294967296))) (let ((.cse89 (div .cse90 .cse88))) (or (< .cse88 (mod (+ .cse89 4294967295) 4294967296)) (< .cse88 (mod .cse89 4294967296)) (<= .cse90 (mod (+ c_main_~x~0 1) 4294967296)))))) .cse0)))) is different from true [2019-10-15 01:04:54,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2019-10-15 01:04:54,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634015017] [2019-10-15 01:04:54,048 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:04:54,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985339557] [2019-10-15 01:04:54,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [908245822] [2019-10-15 01:04:54,058 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 16 [2019-10-15 01:04:54,104 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:04:54,105 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:04:54,187 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:04:54,445 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:04:54,448 INFO L272 AbstractInterpreter]: Visited 14 different actions 46 times. Merged at 4 different actions 12 times. Widened at 1 different actions 2 times. Performed 82 root evaluator evaluations with a maximum evaluation depth of 12. Performed 82 inverse root evaluator evaluations with a maximum inverse evaluation depth of 12. Found 6 fixpoints after 2 different actions. Largest state had 4 variables. [2019-10-15 01:04:54,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:54,453 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:04:54,454 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:04:54,454 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-10-15 01:04:54,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568880253] [2019-10-15 01:04:54,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:04:54,456 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:54,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:04:54,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=13, Unknown=3, NotChecked=14, Total=42 [2019-10-15 01:04:54,457 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 7 states. [2019-10-15 01:04:54,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:54,554 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-10-15 01:04:54,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:04:54,554 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-10-15 01:04:54,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:54,555 INFO L225 Difference]: With dead ends: 17 [2019-10-15 01:04:54,555 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:04:54,555 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=12, Invalid=13, Unknown=3, NotChecked=14, Total=42 [2019-10-15 01:04:54,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:04:54,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:04:54,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:04:54,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:04:54,557 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2019-10-15 01:04:54,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:54,557 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:04:54,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:04:54,557 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:04:54,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:04:54,758 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:04:54,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:04:54,907 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-15 01:04:54,907 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:04:54,907 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:04:54,908 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 01:04:54,908 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:04:54,908 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:04:54,908 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 12 27) the Hoare annotation is: true [2019-10-15 01:04:54,909 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 12 27) no Hoare annotation was computed. [2019-10-15 01:04:54,909 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 23) no Hoare annotation was computed. [2019-10-15 01:04:54,909 INFO L439 ceAbstractionStarter]: At program point L19-2(lines 18 24) the Hoare annotation is: (and (= main_~x~0 1) (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~x~0) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))) [2019-10-15 01:04:54,909 INFO L443 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2019-10-15 01:04:54,909 INFO L439 ceAbstractionStarter]: At program point L18-2(lines 18 24) the Hoare annotation is: (= (mod main_~y~0 4294967296) (mod main_~x~0 4294967296)) [2019-10-15 01:04:54,909 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 12 27) no Hoare annotation was computed. [2019-10-15 01:04:54,909 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2019-10-15 01:04:54,910 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2019-10-15 01:04:54,910 INFO L443 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2019-10-15 01:04:54,910 INFO L443 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2019-10-15 01:04:54,910 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2019-10-15 01:04:54,910 INFO L443 ceAbstractionStarter]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2019-10-15 01:04:54,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:04:54 BoogieIcfgContainer [2019-10-15 01:04:54,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:04:54,936 INFO L168 Benchmark]: Toolchain (without parser) took 20682.21 ms. Allocated memory was 143.1 MB in the beginning and 239.1 MB in the end (delta: 95.9 MB). Free memory was 105.4 MB in the beginning and 120.0 MB in the end (delta: -14.7 MB). Peak memory consumption was 81.3 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:54,937 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 143.1 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-10-15 01:04:54,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.58 ms. Allocated memory is still 143.1 MB. Free memory was 105.2 MB in the beginning and 95.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:54,939 INFO L168 Benchmark]: Boogie Preprocessor took 147.99 ms. Allocated memory was 143.1 MB in the beginning and 205.5 MB in the end (delta: 62.4 MB). Free memory was 95.7 MB in the beginning and 184.0 MB in the end (delta: -88.2 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:54,940 INFO L168 Benchmark]: RCFGBuilder took 306.00 ms. Allocated memory is still 205.5 MB. Free memory was 184.0 MB in the beginning and 172.5 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:54,941 INFO L168 Benchmark]: TraceAbstraction took 19983.38 ms. Allocated memory was 205.5 MB in the beginning and 239.1 MB in the end (delta: 33.6 MB). Free memory was 171.9 MB in the beginning and 120.0 MB in the end (delta: 51.8 MB). Peak memory consumption was 85.4 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:54,945 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 143.1 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 240.58 ms. Allocated memory is still 143.1 MB. Free memory was 105.2 MB in the beginning and 95.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 147.99 ms. Allocated memory was 143.1 MB in the beginning and 205.5 MB in the end (delta: 62.4 MB). Free memory was 95.7 MB in the beginning and 184.0 MB in the end (delta: -88.2 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 306.00 ms. Allocated memory is still 205.5 MB. Free memory was 184.0 MB in the beginning and 172.5 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19983.38 ms. Allocated memory was 205.5 MB in the beginning and 239.1 MB in the end (delta: 33.6 MB). Free memory was 171.9 MB in the beginning and 120.0 MB in the end (delta: 51.8 MB). Peak memory consumption was 85.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: x == 1 && 4294967296 * (y / 4294967296) + x <= y + 4294967296 * (x / 4294967296) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. Result: SAFE, OverallTime: 19.8s, OverallIterations: 5, TraceHistogramMax: 2, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 56 SDtfs, 9 SDslu, 80 SDs, 0 SdLazy, 76 SolverSat, 3 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 15 NumberOfFragments, 31 HoareAnnotationTreeSize, 11 FomulaSimplifications, 4 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 95 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 96 ConstructedInterpolants, 5 QuantifiedInterpolants, 75442 SizeOfPredicates, 7 NumberOfNonLiveVariables, 91 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 8/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...