java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/bitvector/gcd_3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 12:49:42,365 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 12:49:42,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 12:49:42,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 12:49:42,378 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 12:49:42,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 12:49:42,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 12:49:42,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 12:49:42,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 12:49:42,384 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 12:49:42,385 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 12:49:42,386 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 12:49:42,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 12:49:42,387 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 12:49:42,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 12:49:42,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 12:49:42,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 12:49:42,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 12:49:42,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 12:49:42,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 12:49:42,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 12:49:42,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 12:49:42,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 12:49:42,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 12:49:42,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 12:49:42,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 12:49:42,402 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 12:49:42,403 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 12:49:42,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 12:49:42,404 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 12:49:42,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 12:49:42,405 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 12:49:42,406 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 12:49:42,407 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 12:49:42,408 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 12:49:42,408 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 12:49:42,409 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 12:49:42,409 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 12:49:42,409 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 12:49:42,410 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 12:49:42,411 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 12:49:42,412 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-09-07 12:49:42,437 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 12:49:42,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 12:49:42,440 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 12:49:42,440 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 12:49:42,440 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 12:49:42,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 12:49:42,441 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 12:49:42,441 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 12:49:42,441 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 12:49:42,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 12:49:42,442 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 12:49:42,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 12:49:42,442 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 12:49:42,442 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 12:49:42,442 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 12:49:42,443 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 12:49:42,443 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 12:49:42,443 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 12:49:42,443 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 12:49:42,443 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 12:49:42,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 12:49:42,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 12:49:42,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 12:49:42,444 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 12:49:42,444 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 12:49:42,445 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 12:49:42,445 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 12:49:42,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 12:49:42,445 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 12:49:42,484 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 12:49:42,496 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 12:49:42,499 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 12:49:42,500 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 12:49:42,500 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 12:49:42,501 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/gcd_3.c [2019-09-07 12:49:42,560 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8427f4d51/1f452b4c9d9e403b8bd47dccc563725c/FLAG08aa5f2d9 [2019-09-07 12:49:42,982 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 12:49:42,983 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/gcd_3.c [2019-09-07 12:49:42,990 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8427f4d51/1f452b4c9d9e403b8bd47dccc563725c/FLAG08aa5f2d9 [2019-09-07 12:49:43,370 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8427f4d51/1f452b4c9d9e403b8bd47dccc563725c [2019-09-07 12:49:43,382 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 12:49:43,385 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 12:49:43,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 12:49:43,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 12:49:43,389 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 12:49:43,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 12:49:43" (1/1) ... [2019-09-07 12:49:43,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5194cf01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:49:43, skipping insertion in model container [2019-09-07 12:49:43,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 12:49:43" (1/1) ... [2019-09-07 12:49:43,399 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 12:49:43,413 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 12:49:43,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 12:49:43,594 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 12:49:43,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 12:49:43,622 INFO L192 MainTranslator]: Completed translation [2019-09-07 12:49:43,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:49:43 WrapperNode [2019-09-07 12:49:43,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 12:49:43,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 12:49:43,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 12:49:43,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 12:49:43,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:49:43" (1/1) ... [2019-09-07 12:49:43,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:49:43" (1/1) ... [2019-09-07 12:49:43,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:49:43" (1/1) ... [2019-09-07 12:49:43,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:49:43" (1/1) ... [2019-09-07 12:49:43,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:49:43" (1/1) ... [2019-09-07 12:49:43,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:49:43" (1/1) ... [2019-09-07 12:49:43,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:49:43" (1/1) ... [2019-09-07 12:49:43,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 12:49:43,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 12:49:43,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 12:49:43,736 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 12:49:43,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:49:43" (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-09-07 12:49:43,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 12:49:43,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 12:49:43,782 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 12:49:43,782 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd_test [2019-09-07 12:49:43,782 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 12:49:43,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 12:49:43,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-07 12:49:43,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 12:49:43,783 INFO L130 BoogieDeclarations]: Found specification of procedure gcd_test [2019-09-07 12:49:43,783 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 12:49:43,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 12:49:43,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 12:49:43,977 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 12:49:43,977 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 12:49:43,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 12:49:43 BoogieIcfgContainer [2019-09-07 12:49:43,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 12:49:43,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 12:49:43,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 12:49:43,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 12:49:43,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 12:49:43" (1/3) ... [2019-09-07 12:49:43,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69af6ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 12:49:43, skipping insertion in model container [2019-09-07 12:49:43,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:49:43" (2/3) ... [2019-09-07 12:49:43,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69af6ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 12:49:43, skipping insertion in model container [2019-09-07 12:49:43,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 12:49:43" (3/3) ... [2019-09-07 12:49:43,989 INFO L109 eAbstractionObserver]: Analyzing ICFG gcd_3.c [2019-09-07 12:49:43,999 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 12:49:44,017 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 12:49:44,056 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 12:49:44,103 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 12:49:44,103 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 12:49:44,103 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 12:49:44,104 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 12:49:44,104 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 12:49:44,104 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 12:49:44,104 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 12:49:44,104 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 12:49:44,104 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 12:49:44,119 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-09-07 12:49:44,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 12:49:44,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:49:44,124 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:49:44,126 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:49:44,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:49:44,131 INFO L82 PathProgramCache]: Analyzing trace with hash 578872383, now seen corresponding path program 1 times [2019-09-07 12:49:44,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:49:44,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:49:44,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:49:44,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:49:44,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:49:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:49:44,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:49:44,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:49:44,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 12:49:44,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 12:49:44,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 12:49:44,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 12:49:44,270 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-09-07 12:49:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:49:44,287 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2019-09-07 12:49:44,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 12:49:44,289 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-09-07 12:49:44,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:49:44,295 INFO L225 Difference]: With dead ends: 44 [2019-09-07 12:49:44,295 INFO L226 Difference]: Without dead ends: 20 [2019-09-07 12:49:44,298 INFO L628 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-09-07 12:49:44,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-07 12:49:44,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-07 12:49:44,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-07 12:49:44,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-09-07 12:49:44,336 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 19 [2019-09-07 12:49:44,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:49:44,336 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-09-07 12:49:44,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 12:49:44,336 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-09-07 12:49:44,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 12:49:44,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:49:44,338 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:49:44,338 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:49:44,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:49:44,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1364926403, now seen corresponding path program 1 times [2019-09-07 12:49:44,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:49:44,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:49:44,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:49:44,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:49:44,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:49:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:49:44,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:49:44,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:49:44,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-07 12:49:44,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 12:49:44,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 12:49:44,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 12:49:44,538 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 8 states. [2019-09-07 12:49:44,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:49:44,674 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-09-07 12:49:44,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 12:49:44,675 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-09-07 12:49:44,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:49:44,677 INFO L225 Difference]: With dead ends: 32 [2019-09-07 12:49:44,678 INFO L226 Difference]: Without dead ends: 22 [2019-09-07 12:49:44,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-07 12:49:44,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-07 12:49:44,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-07 12:49:44,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-07 12:49:44,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-09-07 12:49:44,686 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 19 [2019-09-07 12:49:44,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:49:44,686 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-09-07 12:49:44,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 12:49:44,687 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-09-07 12:49:44,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 12:49:44,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:49:44,688 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:49:44,688 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:49:44,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:49:44,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1106760965, now seen corresponding path program 1 times [2019-09-07 12:49:44,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:49:44,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:49:44,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:49:44,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:49:44,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:49:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:49:44,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:49:44,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:49:44,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:49:44,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:49:44,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:49:44,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:49:44,759 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 5 states. [2019-09-07 12:49:44,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:49:44,794 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-09-07 12:49:44,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:49:44,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-07 12:49:44,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:49:44,795 INFO L225 Difference]: With dead ends: 33 [2019-09-07 12:49:44,796 INFO L226 Difference]: Without dead ends: 21 [2019-09-07 12:49:44,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:49:44,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-07 12:49:44,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-07 12:49:44,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-07 12:49:44,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-09-07 12:49:44,800 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2019-09-07 12:49:44,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:49:44,801 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-09-07 12:49:44,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:49:44,801 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-09-07 12:49:44,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 12:49:44,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:49:44,802 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:49:44,802 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:49:44,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:49:44,803 INFO L82 PathProgramCache]: Analyzing trace with hash -41516072, now seen corresponding path program 1 times [2019-09-07 12:49:44,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:49:44,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:49:44,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:49:44,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:49:44,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:49:44,813 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 12:49:44,814 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 12:49:44,814 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 12:49:44,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:49:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:49:45,025 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 12:49:45,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:49:45,337 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-09-07 12:49:45,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:49:46,135 WARN L188 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 31 [2019-09-07 12:49:48,290 WARN L188 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 30 [2019-09-07 12:49:50,608 WARN L188 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-09-07 12:49:52,765 WARN L188 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-09-07 12:49:52,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:49:52,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:49:52,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:49:52,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:49:52,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 12:49:52,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-09-07 12:49:52,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 12:49:52,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 12:49:52,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-07 12:49:52,870 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 13 states. [2019-09-07 12:49:55,433 WARN L188 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-09-07 12:50:03,047 WARN L188 SmtUtils]: Spent 5.45 s on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-07 12:50:04,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:50:04,093 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-09-07 12:50:04,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 12:50:04,094 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-09-07 12:50:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:50:04,095 INFO L225 Difference]: With dead ends: 33 [2019-09-07 12:50:04,095 INFO L226 Difference]: Without dead ends: 23 [2019-09-07 12:50:04,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-09-07 12:50:04,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-07 12:50:04,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-09-07 12:50:04,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-07 12:50:04,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-09-07 12:50:04,100 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2019-09-07 12:50:04,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:50:04,101 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-09-07 12:50:04,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 12:50:04,101 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-09-07 12:50:04,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 12:50:04,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:50:04,102 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:50:04,102 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:50:04,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:50:04,103 INFO L82 PathProgramCache]: Analyzing trace with hash 216649366, now seen corresponding path program 1 times [2019-09-07 12:50:04,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:50:04,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:50:04,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:50:04,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:50:04,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:50:04,108 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 12:50:04,109 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 12:50:04,109 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 12:50:04,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:50:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:50:04,157 WARN L254 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 12:50:04,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:50:04,565 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 23 [2019-09-07 12:50:04,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:04,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:50:04,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 12:50:04,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-09-07 12:50:04,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 12:50:04,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 12:50:04,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-07 12:50:04,794 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 14 states. [2019-09-07 12:50:05,494 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 24 [2019-09-07 12:50:05,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:50:05,648 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2019-09-07 12:50:05,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 12:50:05,649 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2019-09-07 12:50:05,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:50:05,650 INFO L225 Difference]: With dead ends: 34 [2019-09-07 12:50:05,650 INFO L226 Difference]: Without dead ends: 24 [2019-09-07 12:50:05,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-09-07 12:50:05,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-07 12:50:05,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-09-07 12:50:05,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-07 12:50:05,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-09-07 12:50:05,655 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2019-09-07 12:50:05,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:50:05,655 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-09-07 12:50:05,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 12:50:05,656 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-09-07 12:50:05,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-07 12:50:05,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:50:05,656 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:50:05,657 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:50:05,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:50:05,657 INFO L82 PathProgramCache]: Analyzing trace with hash -691559837, now seen corresponding path program 2 times [2019-09-07 12:50:05,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:50:05,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:50:05,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:50:05,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:50:05,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:50:05,663 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 12:50:05,664 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 12:50:05,664 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 12:50:05,686 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 12:50:05,725 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 12:50:05,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:50:05,726 WARN L254 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 12:50:05,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:50:05,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:05,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,767 WARN L188 SmtUtils]: Spent 12.78 s on a formula simplification. DAG size of input: 147 DAG size of output: 43 [2019-09-07 12:50:18,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:50:18,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:53:41,368 WARN L188 SmtUtils]: Spent 3.33 m on a formula simplification. DAG size of input: 248 DAG size of output: 110 [2019-09-07 12:55:35,879 WARN L188 SmtUtils]: Spent 1.81 m on a formula simplification. DAG size of input: 417 DAG size of output: 164 [2019-09-07 12:56:39,992 WARN L188 SmtUtils]: Spent 57.91 s on a formula simplification that was a NOOP. DAG size: 164 [2019-09-07 12:56:40,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 12:56:40,145 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2019-09-07 12:56:40,809 WARN L188 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2019-09-07 12:56:41,034 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2019-09-07 12:56:41,399 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-07 12:57:28,385 WARN L188 SmtUtils]: Spent 45.47 s on a formula simplification that was a NOOP. DAG size: 125 [2019-09-07 12:57:28,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 12:57:59,028 WARN L188 SmtUtils]: Spent 28.36 s on a formula simplification that was a NOOP. DAG size: 124 [2019-09-07 12:58:52,897 WARN L188 SmtUtils]: Spent 50.98 s on a formula simplification. DAG size of input: 125 DAG size of output: 125 [2019-09-07 12:58:52,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:58:54,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 12:58:54,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 12:58:54,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-09-07 12:58:54,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 12:58:54,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 12:58:54,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=170, Unknown=9, NotChecked=0, Total=210 [2019-09-07 12:58:54,377 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 15 states. [2019-09-07 12:59:12,313 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (exists ((v_gcd_test_~b_11 Int)) (let ((.cse49 (mod (* 255 v_gcd_test_~b_11) 256))) (let ((.cse50 (mod (mod |c_gcd_test_#in~a| .cse49) 256))) (and (<= |c_gcd_test_#in~b| v_gcd_test_~b_11) (not (= .cse49 0)) (<= 0 .cse49) (<= .cse49 127) (< v_gcd_test_~b_11 0) (= c_gcd_test_~a .cse50) (<= .cse50 127)))))) (.cse2 (<= 0 |c_gcd_test_#in~a|))) (and (or (and (exists ((v_prenex_2 Int)) (let ((.cse0 (mod (* 255 v_prenex_2) 256))) (let ((.cse1 (mod (mod |c_gcd_test_#in~a| (+ .cse0 (- 256))) 256))) (and (<= |c_gcd_test_#in~b| v_prenex_2) (< 127 .cse0) (< v_prenex_2 0) (= c_gcd_test_~b .cse1) (<= .cse1 127) (not (= 256 .cse0)) (< .cse0 256))))) .cse2) (and (exists ((v_gcd_test_~b_11 Int)) (let ((.cse4 (mod (* 255 v_gcd_test_~b_11) 256))) (let ((.cse3 (mod (mod |c_gcd_test_#in~a| .cse4) 256))) (and (<= |c_gcd_test_#in~b| v_gcd_test_~b_11) (= c_gcd_test_~b .cse3) (not (= .cse4 0)) (<= 0 .cse4) (<= .cse4 127) (< v_gcd_test_~b_11 0) (<= .cse3 127))))) .cse2)) (let ((.cse14 (exists ((v_gcd_test_~a_11 Int)) (let ((.cse30 (mod v_gcd_test_~a_11 c_gcd_test_~a))) (let ((.cse29 (mod (+ .cse30 (* 255 c_gcd_test_~a)) 256))) (and (< 127 .cse29) (< v_gcd_test_~a_11 0) (<= (mod .cse30 256) 127) (< 127 (mod (+ .cse30 c_gcd_test_~a) 256)) (= (+ c_gcd_test_~b 256) .cse29) (not (= .cse30 0))))))) (.cse6 (exists ((v_prenex_2 Int)) (let ((.cse27 (mod (* 255 v_prenex_2) 256))) (let ((.cse28 (mod (mod |c_gcd_test_#in~a| (+ .cse27 (- 256))) 256))) (and (<= |c_gcd_test_#in~b| v_prenex_2) (< 127 .cse27) (< v_prenex_2 0) (<= .cse28 127) (= c_gcd_test_~a .cse28) (not (= 256 .cse27)) (< .cse27 256)))))) (.cse16 (exists ((v_gcd_test_~a_11 Int)) (let ((.cse26 (mod v_gcd_test_~a_11 c_gcd_test_~a))) (let ((.cse25 (mod (+ .cse26 (* 255 c_gcd_test_~a)) 256))) (and (< 127 .cse25) (< v_gcd_test_~a_11 0) (<= (mod (+ .cse26 c_gcd_test_~a) 256) 127) (<= (mod .cse26 256) 127) (= (+ c_gcd_test_~b 256) .cse25) (not (= .cse26 0))))))) (.cse15 (exists ((v_gcd_test_~a_11 Int)) (let ((.cse23 (mod v_gcd_test_~a_11 c_gcd_test_~a))) (let ((.cse24 (mod .cse23 256))) (and (< 127 (mod (+ .cse23 (* 255 c_gcd_test_~a)) 256)) (= c_gcd_test_~b .cse24) (<= .cse24 127) (<= 0 v_gcd_test_~a_11) (< 127 (mod (+ .cse23 c_gcd_test_~a) 256))))))) (.cse5 (exists ((v_gcd_test_~a_11 Int)) (let ((.cse21 (mod v_gcd_test_~a_11 c_gcd_test_~a))) (let ((.cse22 (mod .cse21 256))) (and (< 127 (mod (+ .cse21 (* 255 c_gcd_test_~a)) 256)) (<= (mod (+ .cse21 c_gcd_test_~a) 256) 127) (= c_gcd_test_~b .cse22) (<= .cse22 127) (<= 0 v_gcd_test_~a_11))))))) (or (and .cse5 .cse2 .cse6) (and (exists ((v_gcd_test_~a_11 Int)) (let ((.cse8 (mod v_gcd_test_~a_11 c_gcd_test_~a))) (let ((.cse7 (mod (+ .cse8 (* 255 c_gcd_test_~a)) 256))) (and (< 127 .cse7) (< v_gcd_test_~a_11 0) (< 127 (mod .cse8 256)) (< 127 (mod (+ .cse8 c_gcd_test_~a) 256)) (= (+ c_gcd_test_~b 256) .cse7) (not (= .cse8 0)))))) .cse9 .cse2) (and .cse9 (exists ((v_prenex_4 Int)) (let ((.cse11 (mod v_prenex_4 c_gcd_test_~a))) (let ((.cse10 (mod (+ .cse11 (* 255 c_gcd_test_~a)) 256))) (and (<= .cse10 127) (< v_prenex_4 0) (<= (mod (+ .cse11 c_gcd_test_~a) 256) 127) (<= (mod .cse11 256) 127) (not (= .cse11 0)) (= c_gcd_test_~b .cse10))))) .cse2) (and .cse9 .cse2 (exists ((v_prenex_4 Int)) (let ((.cse12 (mod v_prenex_4 c_gcd_test_~a))) (let ((.cse13 (mod .cse12 256))) (and (= .cse12 0) (<= (mod (+ .cse12 (* 255 c_gcd_test_~a)) 256) 127) (= c_gcd_test_~b .cse13) (<= (mod (+ .cse12 c_gcd_test_~a) 256) 127) (<= .cse13 127)))))) (and .cse14 .cse9 .cse2) (and .cse15 .cse2 .cse6) (and .cse14 .cse2 .cse6) (and .cse16 .cse2 .cse6) (and .cse9 .cse2 (exists ((v_gcd_test_~a_11 Int)) (let ((.cse17 (mod v_gcd_test_~a_11 c_gcd_test_~a))) (let ((.cse18 (mod .cse17 256))) (and (< 127 (mod (+ .cse17 (* 255 c_gcd_test_~a)) 256)) (< 127 .cse18) (<= 0 v_gcd_test_~a_11) (< 127 (mod (+ .cse17 c_gcd_test_~a) 256)) (= (+ c_gcd_test_~b 256) .cse18)))))) (and .cse16 .cse9 .cse2) (and .cse9 (exists ((v_prenex_4 Int)) (let ((.cse19 (mod v_prenex_4 c_gcd_test_~a))) (let ((.cse20 (mod .cse19 256))) (and (<= 0 v_prenex_4) (<= (mod (+ .cse19 (* 255 c_gcd_test_~a)) 256) 127) (= c_gcd_test_~b .cse20) (<= (mod (+ .cse19 c_gcd_test_~a) 256) 127) (<= .cse20 127))))) .cse2) (and .cse9 .cse15 .cse2) (and .cse5 .cse9 .cse2))) (or (and (exists ((v_prenex_4 Int)) (let ((.cse32 (mod v_prenex_4 c_gcd_test_~a))) (let ((.cse31 (mod (+ .cse32 (* 255 c_gcd_test_~a)) 256))) (and (= 0 .cse31) (<= .cse31 127) (< v_prenex_4 0) (<= (mod (+ .cse32 c_gcd_test_~a) 256) 127) (<= (mod .cse32 256) 127) (not (= .cse32 0)))))) .cse9 .cse2) (and (exists ((v_prenex_26 Int)) (let ((.cse33 (mod (* 255 v_prenex_26) 256))) (let ((.cse34 (mod (mod |c_gcd_test_#in~a| .cse33) 256))) (and (<= .cse33 127) (< v_prenex_26 0) (<= 0 .cse33) (<= .cse34 127) (not (= .cse33 0)) (<= |c_gcd_test_#in~b| v_prenex_26) (= c_gcd_test_~a .cse34))))) .cse2 (exists ((v_prenex_25 Int)) (let ((.cse36 (mod v_prenex_25 c_gcd_test_~a))) (let ((.cse35 (mod .cse36 256))) (and (<= 0 v_prenex_25) (= 0 .cse35) (<= (mod (+ .cse36 c_gcd_test_~a) 256) 127) (< 127 (mod (+ .cse36 (* 255 c_gcd_test_~a)) 256)) (<= .cse35 127)))))) (and .cse2 (exists ((v_prenex_11 Int)) (let ((.cse37 (mod (* 255 v_prenex_11) 256))) (let ((.cse38 (mod (mod |c_gcd_test_#in~a| .cse37) 256))) (and (not (= .cse37 0)) (= c_gcd_test_~a .cse38) (<= .cse37 127) (<= 0 .cse37) (< v_prenex_11 0) (<= .cse38 127) (<= |c_gcd_test_#in~b| v_prenex_11))))) (exists ((v_prenex_12 Int)) (let ((.cse39 (mod v_prenex_12 c_gcd_test_~a))) (let ((.cse40 (mod .cse39 256))) (and (= .cse39 0) (<= (mod (+ .cse39 c_gcd_test_~a) 256) 127) (<= (mod (+ .cse39 (* 255 c_gcd_test_~a)) 256) 127) (<= .cse40 127) (= 0 .cse40)))))) (and (exists ((v_prenex_15 Int)) (let ((.cse42 (mod (* 255 v_prenex_15) 256))) (let ((.cse41 (mod (mod |c_gcd_test_#in~a| .cse42) 256))) (and (= c_gcd_test_~a .cse41) (<= .cse42 127) (<= .cse41 127) (<= 0 .cse42) (< v_prenex_15 0) (not (= .cse42 0)) (<= |c_gcd_test_#in~b| v_prenex_15))))) .cse2 (exists ((v_prenex_16 Int)) (let ((.cse43 (mod v_prenex_16 c_gcd_test_~a))) (let ((.cse44 (mod .cse43 256))) (and (<= (mod (+ .cse43 c_gcd_test_~a) 256) 127) (= 0 .cse44) (<= .cse44 127) (<= 0 v_prenex_16) (<= (mod (+ .cse43 (* 255 c_gcd_test_~a)) 256) 127)))))) (and .cse2 (exists ((v_prenex_17 Int)) (let ((.cse45 (mod v_prenex_17 c_gcd_test_~a))) (let ((.cse46 (mod .cse45 256))) (and (< 127 (mod (+ .cse45 (* 255 c_gcd_test_~a)) 256)) (= 0 .cse46) (<= 0 v_prenex_17) (<= .cse46 127) (<= (mod (+ .cse45 c_gcd_test_~a) 256) 127))))) (exists ((v_prenex_18 Int)) (let ((.cse47 (mod (* 255 v_prenex_18) 256))) (let ((.cse48 (mod (mod |c_gcd_test_#in~a| (+ .cse47 (- 256))) 256))) (and (not (= 256 .cse47)) (< 127 .cse47) (= c_gcd_test_~a .cse48) (< .cse47 256) (< v_prenex_18 0) (<= |c_gcd_test_#in~b| v_prenex_18) (<= .cse48 127))))))))) is different from false [2019-09-07 13:00:00,432 WARN L188 SmtUtils]: Spent 43.38 s on a formula simplification that was a NOOP. DAG size: 129 [2019-09-07 13:00:39,945 WARN L188 SmtUtils]: Spent 30.63 s on a formula simplification that was a NOOP. DAG size: 128 [2019-09-07 13:01:22,819 WARN L188 SmtUtils]: Spent 34.90 s on a formula simplification that was a NOOP. DAG size: 129 [2019-09-07 13:01:23,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:23,178 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-09-07 13:01:23,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 13:01:23,179 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-09-07 13:01:23,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:23,180 INFO L225 Difference]: With dead ends: 35 [2019-09-07 13:01:23,180 INFO L226 Difference]: Without dead ends: 25 [2019-09-07 13:01:23,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 648.3s TimeCoverageRelationStatistics Valid=51, Invalid=280, Unknown=15, NotChecked=34, Total=380 [2019-09-07 13:01:23,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-07 13:01:23,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-09-07 13:01:23,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-07 13:01:23,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-09-07 13:01:23,185 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 21 [2019-09-07 13:01:23,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:23,185 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-09-07 13:01:23,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 13:01:23,185 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-09-07 13:01:23,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-07 13:01:23,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:23,186 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:01:23,187 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:23,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:23,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1278365851, now seen corresponding path program 2 times [2019-09-07 13:01:23,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:23,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:23,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:23,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 13:01:23,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:23,192 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 13:01:23,192 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 13:01:23,192 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 13:01:23,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 13:01:23,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 13:01:23,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 13:01:23,223 WARN L254 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 13:01:23,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:01:23,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:01:23,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:01:23,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:01:23,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:01:23,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:01:23,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:01:23,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:01:23,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:01:23,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:01:23,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:01:23,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:01:23,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:01:23,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:01:23,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:01:23,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:01:23,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:01:23,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:01:23,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:01:23,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:01:23,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:01:23,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:01:23,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:01:23,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:01:38,488 WARN L188 SmtUtils]: Spent 15.14 s on a formula simplification. DAG size of input: 110 DAG size of output: 38 [2019-09-07 13:01:38,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:01:38,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:01:38,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:01:38,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:01:38,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:03:53,078 WARN L188 SmtUtils]: Spent 2.22 m on a formula simplification. DAG size of input: 187 DAG size of output: 133