./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/bitvector/gcd_1_true-unreach-call_true-no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/bitvector/gcd_1_true-unreach-call_true-no-overflow.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d5d419a3a7f083f15010050e5cf28b10f30a132d ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 15:48:49,934 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 15:48:49,938 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 15:48:49,957 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 15:48:49,957 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 15:48:49,958 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 15:48:49,964 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 15:48:49,967 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 15:48:49,968 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 15:48:49,969 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 15:48:49,970 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 15:48:49,971 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 15:48:49,972 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 15:48:49,973 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 15:48:49,974 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 15:48:49,975 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 15:48:49,976 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 15:48:49,978 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 15:48:49,981 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 15:48:49,983 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 15:48:49,984 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 15:48:49,985 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 15:48:49,988 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 15:48:49,989 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 15:48:49,989 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 15:48:49,990 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 15:48:49,993 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 15:48:49,993 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 15:48:49,994 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 15:48:50,000 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 15:48:50,001 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 15:48:50,001 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 15:48:50,002 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 15:48:50,002 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 15:48:50,003 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 15:48:50,003 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 15:48:50,005 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 15:48:50,027 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 15:48:50,028 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 15:48:50,029 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 15:48:50,029 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 15:48:50,029 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 15:48:50,030 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 15:48:50,030 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 15:48:50,030 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 15:48:50,030 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 15:48:50,030 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 15:48:50,031 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 15:48:50,031 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 15:48:50,031 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 15:48:50,031 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 15:48:50,031 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 15:48:50,031 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 15:48:50,032 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 15:48:50,033 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 15:48:50,034 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 15:48:50,034 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 15:48:50,034 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 15:48:50,034 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 15:48:50,034 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 15:48:50,034 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 15:48:50,035 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 15:48:50,036 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 15:48:50,036 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 15:48:50,036 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 15:48:50,036 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d5d419a3a7f083f15010050e5cf28b10f30a132d [2018-12-30 15:48:50,073 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 15:48:50,087 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 15:48:50,091 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 15:48:50,093 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 15:48:50,093 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 15:48:50,094 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/gcd_1_true-unreach-call_true-no-overflow.i [2018-12-30 15:48:50,161 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/930902da9/e052034ffbe741419b2d47d8b64b14d1/FLAG926113a40 [2018-12-30 15:48:50,617 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 15:48:50,618 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/gcd_1_true-unreach-call_true-no-overflow.i [2018-12-30 15:48:50,625 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/930902da9/e052034ffbe741419b2d47d8b64b14d1/FLAG926113a40 [2018-12-30 15:48:50,972 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/930902da9/e052034ffbe741419b2d47d8b64b14d1 [2018-12-30 15:48:50,976 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 15:48:50,978 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 15:48:50,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 15:48:50,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 15:48:50,984 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 15:48:50,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 03:48:50" (1/1) ... [2018-12-30 15:48:50,989 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e69981e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:48:50, skipping insertion in model container [2018-12-30 15:48:50,989 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 03:48:50" (1/1) ... [2018-12-30 15:48:50,998 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 15:48:51,017 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 15:48:51,201 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 15:48:51,207 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 15:48:51,225 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 15:48:51,243 INFO L195 MainTranslator]: Completed translation [2018-12-30 15:48:51,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:48:51 WrapperNode [2018-12-30 15:48:51,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 15:48:51,245 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 15:48:51,245 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 15:48:51,245 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 15:48:51,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:48:51" (1/1) ... [2018-12-30 15:48:51,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:48:51" (1/1) ... [2018-12-30 15:48:51,284 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 15:48:51,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 15:48:51,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 15:48:51,284 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 15:48:51,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:48:51" (1/1) ... [2018-12-30 15:48:51,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:48:51" (1/1) ... [2018-12-30 15:48:51,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:48:51" (1/1) ... [2018-12-30 15:48:51,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:48:51" (1/1) ... [2018-12-30 15:48:51,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:48:51" (1/1) ... [2018-12-30 15:48:51,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:48:51" (1/1) ... [2018-12-30 15:48:51,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:48:51" (1/1) ... [2018-12-30 15:48:51,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 15:48:51,309 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 15:48:51,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 15:48:51,310 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 15:48:51,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:48:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 15:48:51,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 15:48:51,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 15:48:51,701 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 15:48:51,702 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-30 15:48:51,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 03:48:51 BoogieIcfgContainer [2018-12-30 15:48:51,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 15:48:51,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 15:48:51,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 15:48:51,707 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 15:48:51,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 03:48:50" (1/3) ... [2018-12-30 15:48:51,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d39fce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 03:48:51, skipping insertion in model container [2018-12-30 15:48:51,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:48:51" (2/3) ... [2018-12-30 15:48:51,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d39fce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 03:48:51, skipping insertion in model container [2018-12-30 15:48:51,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 03:48:51" (3/3) ... [2018-12-30 15:48:51,713 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_1_true-unreach-call_true-no-overflow.i [2018-12-30 15:48:51,726 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 15:48:51,734 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 15:48:51,752 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 15:48:51,789 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 15:48:51,790 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 15:48:51,790 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 15:48:51,790 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 15:48:51,790 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 15:48:51,790 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 15:48:51,790 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 15:48:51,791 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 15:48:51,791 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 15:48:51,809 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-12-30 15:48:51,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-30 15:48:51,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:48:51,816 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:48:51,819 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:48:51,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:48:51,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1311742288, now seen corresponding path program 1 times [2018-12-30 15:48:51,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:48:51,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:48:51,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:48:51,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:51,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:48:51,903 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 15:48:51,904 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 15:48:51,904 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 [2018-12-30 15:48:51,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:48:51,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:48:52,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:48:52,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:48:52,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 15:48:52,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 15:48:52,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 15:48:52,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:48:52,100 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-12-30 15:48:52,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:48:52,145 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2018-12-30 15:48:52,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 15:48:52,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-30 15:48:52,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:48:52,158 INFO L225 Difference]: With dead ends: 25 [2018-12-30 15:48:52,158 INFO L226 Difference]: Without dead ends: 11 [2018-12-30 15:48:52,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:48:52,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-30 15:48:52,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-30 15:48:52,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-30 15:48:52,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-12-30 15:48:52,201 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2018-12-30 15:48:52,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:48:52,202 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-30 15:48:52,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 15:48:52,202 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-12-30 15:48:52,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-30 15:48:52,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:48:52,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:48:52,203 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:48:52,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:48:52,204 INFO L82 PathProgramCache]: Analyzing trace with hash -182643218, now seen corresponding path program 1 times [2018-12-30 15:48:52,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:48:52,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:48:52,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:48:52,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:52,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:48:52,210 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 15:48:52,210 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 15:48:52,210 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 [2018-12-30 15:48:52,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:48:52,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:48:52,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:48:52,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-30 15:48:52,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-12-30 15:48:52,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 15:48:52,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 15:48:52,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-30 15:48:52,441 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2018-12-30 15:48:52,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:48:52,874 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-12-30 15:48:52,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 15:48:52,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-12-30 15:48:52,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:48:52,875 INFO L225 Difference]: With dead ends: 17 [2018-12-30 15:48:52,875 INFO L226 Difference]: Without dead ends: 12 [2018-12-30 15:48:52,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-30 15:48:52,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-30 15:48:52,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-30 15:48:52,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-30 15:48:52,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-12-30 15:48:52,880 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-12-30 15:48:52,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:48:52,880 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-12-30 15:48:52,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 15:48:52,880 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-12-30 15:48:52,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-30 15:48:52,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:48:52,881 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:48:52,881 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:48:52,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:48:52,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1315317778, now seen corresponding path program 2 times [2018-12-30 15:48:52,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:48:52,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:48:52,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:48:52,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:48:52,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:48:52,887 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 15:48:52,887 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 15:48:52,888 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 [2018-12-30 15:48:52,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-30 15:49:13,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-30 15:49:13,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:49:13,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:49:13,528 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 13 [2018-12-30 15:49:15,793 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2018-12-30 15:49:29,539 WARN L181 SmtUtils]: Spent 5.25 s on a formula simplification. DAG size of input: 485 DAG size of output: 28 [2018-12-30 15:49:31,601 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse13 (< c_ULTIMATE.start_gcd_test_~a 0)) (.cse0 (<= 0 c_ULTIMATE.start_gcd_test_~a)) (.cse5 (not (= c_ULTIMATE.start_gcd_test_~a 0)))) (or (and .cse0 (exists ((v_prenex_67 Int) (v_prenex_68 Int)) (let ((.cse2 (mod v_prenex_68 c_ULTIMATE.start_gcd_test_~a)) (.cse1 (mod (* 255 v_prenex_67) 256))) (let ((.cse3 (mod (mod .cse1 v_prenex_68) 256)) (.cse4 (mod .cse2 256))) (and (<= .cse1 127) (= 0 .cse2) (<= 0 (+ v_prenex_67 128)) (<= .cse3 127) (= .cse3 c_ULTIMATE.start_gcd_test_~a) (= (+ c_ULTIMATE.start_gcd_test_~b 256) .cse4) (< 127 .cse4) (<= v_prenex_67 127) (not (= 0 v_prenex_68)) (<= 0 .cse1) (< v_prenex_67 0) (= (mod v_prenex_67 v_prenex_68) 0) (<= 0 v_prenex_68))))) .cse5) (and .cse0 (exists ((v_prenex_58 Int) (v_prenex_57 Int)) (let ((.cse7 (mod v_prenex_58 c_ULTIMATE.start_gcd_test_~a)) (.cse9 (mod (* 255 v_prenex_57) 256))) (let ((.cse6 (mod (mod .cse9 v_prenex_58) 256)) (.cse8 (mod .cse7 256))) (and (<= 0 v_prenex_58) (not (= 0 v_prenex_58)) (<= 0 (+ v_prenex_57 128)) (= .cse6 c_ULTIMATE.start_gcd_test_~a) (= 0 .cse7) (<= .cse6 127) (<= .cse8 127) (<= 0 .cse9) (= (mod v_prenex_57 v_prenex_58) 0) (= c_ULTIMATE.start_gcd_test_~b .cse8) (<= .cse9 127) (<= v_prenex_57 127) (< v_prenex_57 0))))) .cse5) (and (exists ((v_prenex_52 Int) (v_prenex_51 Int)) (let ((.cse12 (mod (* 255 v_prenex_51) 256))) (let ((.cse10 (mod (mod v_prenex_52 c_ULTIMATE.start_gcd_test_~a) 256)) (.cse11 (mod (mod .cse12 v_prenex_52) 256))) (and (= c_ULTIMATE.start_gcd_test_~b .cse10) (<= 0 (+ v_prenex_51 128)) (<= v_prenex_51 127) (<= .cse11 127) (<= 0 .cse12) (< v_prenex_51 0) (<= .cse10 127) (<= .cse12 127) (not (= 0 v_prenex_52)) (= (mod v_prenex_51 v_prenex_52) 0) (= .cse11 c_ULTIMATE.start_gcd_test_~a) (<= 0 v_prenex_52))))) .cse13 .cse5) (and (exists ((v_prenex_59 Int) (v_prenex_60 Int)) (let ((.cse17 (mod (* 255 v_prenex_59) 256)) (.cse15 (mod v_prenex_60 c_ULTIMATE.start_gcd_test_~a))) (let ((.cse14 (mod (+ (* 255 c_ULTIMATE.start_gcd_test_~a) .cse15) 256)) (.cse16 (mod (mod .cse17 v_prenex_60) 256))) (and (= (mod v_prenex_59 v_prenex_60) 0) (< v_prenex_59 0) (= c_ULTIMATE.start_gcd_test_~b .cse14) (<= .cse14 127) (< v_prenex_60 0) (not (= 0 .cse15)) (<= .cse16 127) (not (= 0 v_prenex_60)) (= .cse16 c_ULTIMATE.start_gcd_test_~a) (<= .cse17 127) (<= 0 .cse17) (<= 0 v_prenex_60) (<= 0 (+ v_prenex_59 128)) (<= v_prenex_59 127))))) .cse0 .cse5) (and .cse13 .cse5 (exists ((v_prenex_48 Int) (v_prenex_47 Int)) (let ((.cse19 (mod (* 255 v_prenex_47) 256)) (.cse21 (mod v_prenex_48 c_ULTIMATE.start_gcd_test_~a))) (let ((.cse20 (mod (+ c_ULTIMATE.start_gcd_test_~a .cse21) 256)) (.cse18 (mod (mod .cse19 v_prenex_48) 256))) (and (<= 0 v_prenex_48) (= (mod v_prenex_47 v_prenex_48) 0) (< v_prenex_48 0) (<= .cse18 127) (<= .cse19 127) (<= .cse20 127) (not (= 0 .cse21)) (not (= 0 v_prenex_48)) (= c_ULTIMATE.start_gcd_test_~b .cse20) (<= 0 (+ v_prenex_47 128)) (<= v_prenex_47 127) (< v_prenex_47 0) (= .cse18 c_ULTIMATE.start_gcd_test_~a) (<= 0 .cse19)))))) (and (exists ((v_prenex_29 Int) (v_ULTIMATE.start_gcd_test_~a_11 Int)) (let ((.cse22 (mod (* 255 v_prenex_29) 256)) (.cse23 (mod v_ULTIMATE.start_gcd_test_~a_11 c_ULTIMATE.start_gcd_test_~a))) (let ((.cse25 (mod .cse23 256)) (.cse24 (mod (mod .cse22 v_ULTIMATE.start_gcd_test_~a_11) 256))) (and (not (= 0 v_ULTIMATE.start_gcd_test_~a_11)) (< v_prenex_29 0) (<= 0 .cse22) (<= v_prenex_29 127) (<= .cse22 127) (= 0 .cse23) (= .cse24 c_ULTIMATE.start_gcd_test_~a) (= (mod v_prenex_29 v_ULTIMATE.start_gcd_test_~a_11) 0) (< 127 .cse25) (<= 0 (+ v_prenex_29 128)) (<= 0 v_ULTIMATE.start_gcd_test_~a_11) (= (+ c_ULTIMATE.start_gcd_test_~b 256) .cse25) (<= .cse24 127))))) .cse13 .cse5) (and .cse13 .cse5 (exists ((v_prenex_49 Int) (v_prenex_50 Int)) (let ((.cse29 (mod v_prenex_50 c_ULTIMATE.start_gcd_test_~a)) (.cse28 (mod (* 255 v_prenex_49) 256))) (let ((.cse26 (mod (mod .cse28 v_prenex_50) 256)) (.cse27 (mod .cse29 256))) (and (= .cse26 c_ULTIMATE.start_gcd_test_~a) (<= v_prenex_49 127) (<= .cse26 127) (= (mod v_prenex_49 v_prenex_50) 0) (<= 0 v_prenex_50) (= c_ULTIMATE.start_gcd_test_~b .cse27) (<= .cse28 127) (= 0 .cse29) (<= .cse27 127) (< v_prenex_49 0) (<= 0 .cse28) (not (= 0 v_prenex_50)) (<= 0 (+ v_prenex_49 128))))))) (and (exists ((v_prenex_66 Int) (v_prenex_65 Int)) (let ((.cse30 (mod v_prenex_66 c_ULTIMATE.start_gcd_test_~a)) (.cse32 (mod (* 255 v_prenex_65) 256))) (let ((.cse31 (mod (mod .cse32 v_prenex_66) 256)) (.cse33 (mod (+ (* 255 c_ULTIMATE.start_gcd_test_~a) .cse30) 256))) (and (<= 0 v_prenex_66) (not (= 0 .cse30)) (< v_prenex_65 0) (<= .cse31 127) (<= 0 (+ v_prenex_65 128)) (= .cse31 c_ULTIMATE.start_gcd_test_~a) (not (= 0 v_prenex_66)) (<= .cse32 127) (<= 0 .cse32) (<= v_prenex_65 127) (< v_prenex_66 0) (< 127 .cse33) (= (mod v_prenex_65 v_prenex_66) 0) (= (+ c_ULTIMATE.start_gcd_test_~b 256) .cse33))))) .cse0 .cse5) (and (exists ((v_prenex_54 Int) (v_prenex_53 Int)) (let ((.cse36 (mod (* 255 v_prenex_53) 256))) (let ((.cse34 (mod (mod .cse36 v_prenex_54) 256)) (.cse35 (mod (mod v_prenex_54 c_ULTIMATE.start_gcd_test_~a) 256))) (and (= .cse34 c_ULTIMATE.start_gcd_test_~a) (= (+ c_ULTIMATE.start_gcd_test_~b 256) .cse35) (<= .cse34 127) (<= 0 v_prenex_54) (= (mod v_prenex_53 v_prenex_54) 0) (< 127 .cse35) (not (= 0 v_prenex_54)) (<= v_prenex_53 127) (<= .cse36 127) (< v_prenex_53 0) (<= 0 (+ v_prenex_53 128)) (<= 0 .cse36))))) .cse13 .cse5) (and .cse0 .cse5 (exists ((v_prenex_62 Int) (v_prenex_61 Int)) (let ((.cse39 (mod (* 255 v_prenex_61) 256))) (let ((.cse37 (mod (mod v_prenex_62 c_ULTIMATE.start_gcd_test_~a) 256)) (.cse38 (mod (mod .cse39 v_prenex_62) 256))) (and (<= 0 (+ v_prenex_61 128)) (<= v_prenex_61 127) (< v_prenex_61 0) (not (= 0 v_prenex_62)) (= (mod v_prenex_61 v_prenex_62) 0) (<= .cse37 127) (= .cse38 c_ULTIMATE.start_gcd_test_~a) (<= 0 .cse39) (= c_ULTIMATE.start_gcd_test_~b .cse37) (<= 0 v_prenex_62) (<= .cse38 127) (<= .cse39 127)))))) (and .cse13 .cse5 (exists ((v_prenex_56 Int) (v_prenex_55 Int)) (let ((.cse42 (mod (* 255 v_prenex_55) 256)) (.cse41 (mod v_prenex_56 c_ULTIMATE.start_gcd_test_~a))) (let ((.cse40 (mod (+ c_ULTIMATE.start_gcd_test_~a .cse41) 256)) (.cse43 (mod (mod .cse42 v_prenex_56) 256))) (and (<= 0 (+ v_prenex_55 128)) (< 127 .cse40) (not (= 0 .cse41)) (< v_prenex_55 0) (<= .cse42 127) (= .cse40 (+ c_ULTIMATE.start_gcd_test_~b 256)) (<= 0 .cse42) (= .cse43 c_ULTIMATE.start_gcd_test_~a) (< v_prenex_56 0) (<= v_prenex_55 127) (<= .cse43 127) (not (= 0 v_prenex_56)) (= (mod v_prenex_55 v_prenex_56) 0) (<= 0 v_prenex_56)))))) (and .cse0 (exists ((v_prenex_63 Int) (v_prenex_64 Int)) (let ((.cse46 (mod (* 255 v_prenex_63) 256))) (let ((.cse44 (mod (mod v_prenex_64 c_ULTIMATE.start_gcd_test_~a) 256)) (.cse45 (mod (mod .cse46 v_prenex_64) 256))) (and (<= v_prenex_63 127) (< 127 .cse44) (<= .cse45 127) (<= 0 v_prenex_64) (< v_prenex_63 0) (= (+ c_ULTIMATE.start_gcd_test_~b 256) .cse44) (not (= 0 v_prenex_64)) (<= .cse46 127) (= .cse45 c_ULTIMATE.start_gcd_test_~a) (<= 0 .cse46) (= (mod v_prenex_63 v_prenex_64) 0) (<= 0 (+ v_prenex_63 128)))))) .cse5))) is different from false [2018-12-30 15:49:33,669 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_ULTIMATE.start_gcd_test_~a 0)) (.cse12 (<= 0 c_ULTIMATE.start_gcd_test_~a)) (.cse1 (not (= c_ULTIMATE.start_gcd_test_~a 0)))) (or (and .cse0 .cse1 (exists ((v_prenex_52 Int) (v_prenex_51 Int)) (let ((.cse3 (mod (* 255 v_prenex_51) 256))) (let ((.cse4 (mod (mod v_prenex_52 c_ULTIMATE.start_gcd_test_~a) 256)) (.cse2 (mod (mod .cse3 v_prenex_52) 256))) (and (<= 0 (+ v_prenex_51 128)) (<= v_prenex_51 127) (<= .cse2 127) (<= 0 .cse3) (< v_prenex_51 0) (<= .cse4 127) (<= .cse3 127) (not (= 0 v_prenex_52)) (= (mod v_prenex_51 v_prenex_52) 0) (= 0 .cse4) (= .cse2 c_ULTIMATE.start_gcd_test_~a) (<= 0 v_prenex_52)))))) (and (exists ((v_prenex_56 Int) (v_prenex_55 Int)) (let ((.cse7 (mod (* 255 v_prenex_55) 256)) (.cse6 (mod v_prenex_56 c_ULTIMATE.start_gcd_test_~a))) (let ((.cse5 (mod (+ c_ULTIMATE.start_gcd_test_~a .cse6) 256)) (.cse8 (mod (mod .cse7 v_prenex_56) 256))) (and (<= 0 (+ v_prenex_55 128)) (< 127 .cse5) (not (= 0 .cse6)) (< v_prenex_55 0) (<= .cse7 127) (<= 0 .cse7) (= .cse8 c_ULTIMATE.start_gcd_test_~a) (< v_prenex_56 0) (<= v_prenex_55 127) (= .cse5 256) (<= .cse8 127) (not (= 0 v_prenex_56)) (= (mod v_prenex_55 v_prenex_56) 0) (<= 0 v_prenex_56))))) .cse0 .cse1) (and (exists ((v_prenex_54 Int) (v_prenex_53 Int)) (let ((.cse11 (mod (* 255 v_prenex_53) 256))) (let ((.cse9 (mod (mod .cse11 v_prenex_54) 256)) (.cse10 (mod (mod v_prenex_54 c_ULTIMATE.start_gcd_test_~a) 256))) (and (= .cse9 c_ULTIMATE.start_gcd_test_~a) (<= .cse9 127) (<= 0 v_prenex_54) (= (mod v_prenex_53 v_prenex_54) 0) (< 127 .cse10) (not (= 0 v_prenex_54)) (<= v_prenex_53 127) (<= .cse11 127) (= .cse10 256) (< v_prenex_53 0) (<= 0 (+ v_prenex_53 128)) (<= 0 .cse11))))) .cse0 .cse1) (and .cse12 (exists ((v_prenex_58 Int) (v_prenex_57 Int)) (let ((.cse14 (mod v_prenex_58 c_ULTIMATE.start_gcd_test_~a)) (.cse16 (mod (* 255 v_prenex_57) 256))) (let ((.cse13 (mod (mod .cse16 v_prenex_58) 256)) (.cse15 (mod .cse14 256))) (and (<= 0 v_prenex_58) (not (= 0 v_prenex_58)) (<= 0 (+ v_prenex_57 128)) (= .cse13 c_ULTIMATE.start_gcd_test_~a) (= 0 .cse14) (<= .cse13 127) (<= .cse15 127) (<= 0 .cse16) (= (mod v_prenex_57 v_prenex_58) 0) (<= .cse16 127) (<= v_prenex_57 127) (< v_prenex_57 0) (= .cse15 0))))) .cse1) (and .cse0 .cse1 (exists ((v_prenex_29 Int) (v_ULTIMATE.start_gcd_test_~a_11 Int)) (let ((.cse17 (mod (* 255 v_prenex_29) 256)) (.cse18 (mod v_ULTIMATE.start_gcd_test_~a_11 c_ULTIMATE.start_gcd_test_~a))) (let ((.cse20 (mod .cse18 256)) (.cse19 (mod (mod .cse17 v_ULTIMATE.start_gcd_test_~a_11) 256))) (and (not (= 0 v_ULTIMATE.start_gcd_test_~a_11)) (< v_prenex_29 0) (<= 0 .cse17) (<= v_prenex_29 127) (<= .cse17 127) (= 0 .cse18) (= .cse19 c_ULTIMATE.start_gcd_test_~a) (= (mod v_prenex_29 v_ULTIMATE.start_gcd_test_~a_11) 0) (< 127 .cse20) (<= 0 (+ v_prenex_29 128)) (<= 0 v_ULTIMATE.start_gcd_test_~a_11) (= 256 .cse20) (<= .cse19 127)))))) (and .cse12 .cse1 (exists ((v_prenex_62 Int) (v_prenex_61 Int)) (let ((.cse23 (mod (* 255 v_prenex_61) 256))) (let ((.cse22 (mod (mod .cse23 v_prenex_62) 256)) (.cse21 (mod (mod v_prenex_62 c_ULTIMATE.start_gcd_test_~a) 256))) (and (<= 0 (+ v_prenex_61 128)) (<= v_prenex_61 127) (< v_prenex_61 0) (not (= 0 v_prenex_62)) (= (mod v_prenex_61 v_prenex_62) 0) (<= .cse21 127) (= .cse22 c_ULTIMATE.start_gcd_test_~a) (<= 0 .cse23) (<= 0 v_prenex_62) (<= .cse22 127) (<= .cse23 127) (= 0 .cse21)))))) (and .cse0 .cse1 (exists ((v_prenex_48 Int) (v_prenex_47 Int)) (let ((.cse25 (mod (* 255 v_prenex_47) 256)) (.cse27 (mod v_prenex_48 c_ULTIMATE.start_gcd_test_~a))) (let ((.cse26 (mod (+ c_ULTIMATE.start_gcd_test_~a .cse27) 256)) (.cse24 (mod (mod .cse25 v_prenex_48) 256))) (and (<= 0 v_prenex_48) (= (mod v_prenex_47 v_prenex_48) 0) (< v_prenex_48 0) (<= .cse24 127) (<= .cse25 127) (<= .cse26 127) (not (= 0 .cse27)) (not (= 0 v_prenex_48)) (= 0 .cse26) (<= 0 (+ v_prenex_47 128)) (<= v_prenex_47 127) (< v_prenex_47 0) (= .cse24 c_ULTIMATE.start_gcd_test_~a) (<= 0 .cse25)))))) (and .cse12 (exists ((v_prenex_63 Int) (v_prenex_64 Int)) (let ((.cse30 (mod (* 255 v_prenex_63) 256))) (let ((.cse28 (mod (mod v_prenex_64 c_ULTIMATE.start_gcd_test_~a) 256)) (.cse29 (mod (mod .cse30 v_prenex_64) 256))) (and (<= v_prenex_63 127) (< 127 .cse28) (<= .cse29 127) (<= 0 v_prenex_64) (< v_prenex_63 0) (not (= 0 v_prenex_64)) (= 256 .cse28) (<= .cse30 127) (= .cse29 c_ULTIMATE.start_gcd_test_~a) (<= 0 .cse30) (= (mod v_prenex_63 v_prenex_64) 0) (<= 0 (+ v_prenex_63 128)))))) .cse1) (and (exists ((v_prenex_49 Int) (v_prenex_50 Int)) (let ((.cse34 (mod v_prenex_50 c_ULTIMATE.start_gcd_test_~a)) (.cse33 (mod (* 255 v_prenex_49) 256))) (let ((.cse32 (mod (mod .cse33 v_prenex_50) 256)) (.cse31 (mod .cse34 256))) (and (= .cse31 0) (= .cse32 c_ULTIMATE.start_gcd_test_~a) (<= v_prenex_49 127) (<= .cse32 127) (= (mod v_prenex_49 v_prenex_50) 0) (<= 0 v_prenex_50) (<= .cse33 127) (= 0 .cse34) (<= .cse31 127) (< v_prenex_49 0) (<= 0 .cse33) (not (= 0 v_prenex_50)) (<= 0 (+ v_prenex_49 128)))))) .cse0 .cse1) (and .cse12 .cse1 (exists ((v_prenex_59 Int) (v_prenex_60 Int)) (let ((.cse38 (mod (* 255 v_prenex_59) 256)) (.cse36 (mod v_prenex_60 c_ULTIMATE.start_gcd_test_~a))) (let ((.cse35 (mod (+ (* 255 c_ULTIMATE.start_gcd_test_~a) .cse36) 256)) (.cse37 (mod (mod .cse38 v_prenex_60) 256))) (and (= (mod v_prenex_59 v_prenex_60) 0) (< v_prenex_59 0) (= .cse35 0) (<= .cse35 127) (< v_prenex_60 0) (not (= 0 .cse36)) (<= .cse37 127) (not (= 0 v_prenex_60)) (= .cse37 c_ULTIMATE.start_gcd_test_~a) (<= .cse38 127) (<= 0 .cse38) (<= 0 v_prenex_60) (<= 0 (+ v_prenex_59 128)) (<= v_prenex_59 127)))))) (and .cse12 (exists ((v_prenex_67 Int) (v_prenex_68 Int)) (let ((.cse40 (mod v_prenex_68 c_ULTIMATE.start_gcd_test_~a)) (.cse39 (mod (* 255 v_prenex_67) 256))) (let ((.cse41 (mod (mod .cse39 v_prenex_68) 256)) (.cse42 (mod .cse40 256))) (and (<= .cse39 127) (= 0 .cse40) (<= 0 (+ v_prenex_67 128)) (<= .cse41 127) (= .cse41 c_ULTIMATE.start_gcd_test_~a) (< 127 .cse42) (<= v_prenex_67 127) (not (= 0 v_prenex_68)) (<= 0 .cse39) (= .cse42 256) (< v_prenex_67 0) (= (mod v_prenex_67 v_prenex_68) 0) (<= 0 v_prenex_68))))) .cse1) (and .cse12 .cse1 (exists ((v_prenex_66 Int) (v_prenex_65 Int)) (let ((.cse43 (mod v_prenex_66 c_ULTIMATE.start_gcd_test_~a)) (.cse45 (mod (* 255 v_prenex_65) 256))) (let ((.cse44 (mod (mod .cse45 v_prenex_66) 256)) (.cse46 (mod (+ (* 255 c_ULTIMATE.start_gcd_test_~a) .cse43) 256))) (and (<= 0 v_prenex_66) (not (= 0 .cse43)) (< v_prenex_65 0) (<= .cse44 127) (<= 0 (+ v_prenex_65 128)) (= .cse44 c_ULTIMATE.start_gcd_test_~a) (not (= 0 v_prenex_66)) (<= .cse45 127) (<= 0 .cse45) (<= v_prenex_65 127) (< v_prenex_66 0) (< 127 .cse46) (= (mod v_prenex_65 v_prenex_66) 0) (= .cse46 256)))))))) is different from false [2018-12-30 15:49:35,740 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (< |c_ULTIMATE.start_gcd_test_#res| 0)) (.cse12 (<= 0 |c_ULTIMATE.start_gcd_test_#res|)) (.cse0 (not (= |c_ULTIMATE.start_gcd_test_#res| 0)))) (or (and .cse0 (exists ((v_prenex_49 Int) (v_prenex_50 Int)) (let ((.cse4 (mod v_prenex_50 |c_ULTIMATE.start_gcd_test_#res|)) (.cse3 (mod (* 255 v_prenex_49) 256))) (let ((.cse1 (mod (mod .cse3 v_prenex_50) 256)) (.cse2 (mod .cse4 256))) (and (<= v_prenex_49 127) (<= .cse1 127) (= (mod v_prenex_49 v_prenex_50) 0) (<= 0 v_prenex_50) (= |c_ULTIMATE.start_gcd_test_#res| .cse1) (= .cse2 0) (<= .cse3 127) (= .cse4 0) (<= .cse2 127) (< v_prenex_49 0) (<= 0 .cse3) (not (= 0 v_prenex_50)) (<= 0 (+ v_prenex_49 128)))))) .cse5) (and .cse0 (exists ((v_prenex_54 Int) (v_prenex_53 Int)) (let ((.cse8 (mod (* 255 v_prenex_53) 256))) (let ((.cse7 (mod (mod v_prenex_54 |c_ULTIMATE.start_gcd_test_#res|) 256)) (.cse6 (mod (mod .cse8 v_prenex_54) 256))) (and (<= .cse6 127) (< 127 .cse7) (<= 0 v_prenex_54) (= 256 .cse7) (= (mod v_prenex_53 v_prenex_54) 0) (not (= 0 v_prenex_54)) (<= v_prenex_53 127) (<= .cse8 127) (< v_prenex_53 0) (= |c_ULTIMATE.start_gcd_test_#res| .cse6) (<= 0 (+ v_prenex_53 128)) (<= 0 .cse8))))) .cse5) (and (exists ((v_prenex_63 Int) (v_prenex_64 Int)) (let ((.cse11 (mod (* 255 v_prenex_63) 256))) (let ((.cse9 (mod (mod .cse11 v_prenex_64) 256)) (.cse10 (mod (mod v_prenex_64 |c_ULTIMATE.start_gcd_test_#res|) 256))) (and (<= v_prenex_63 127) (<= .cse9 127) (= .cse10 256) (<= 0 v_prenex_64) (< v_prenex_63 0) (= |c_ULTIMATE.start_gcd_test_#res| .cse9) (not (= 0 v_prenex_64)) (<= .cse11 127) (< 127 .cse10) (<= 0 .cse11) (= (mod v_prenex_63 v_prenex_64) 0) (<= 0 (+ v_prenex_63 128)))))) .cse12 .cse0) (and .cse0 (exists ((v_prenex_56 Int) (v_prenex_55 Int)) (let ((.cse16 (mod (* 255 v_prenex_55) 256)) (.cse13 (mod v_prenex_56 |c_ULTIMATE.start_gcd_test_#res|))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_gcd_test_#res| .cse13) 256)) (.cse15 (mod (mod .cse16 v_prenex_56) 256))) (and (not (= .cse13 0)) (<= 0 (+ v_prenex_55 128)) (= 256 .cse14) (= |c_ULTIMATE.start_gcd_test_#res| .cse15) (< v_prenex_55 0) (< 127 .cse14) (<= .cse16 127) (<= 0 .cse16) (< v_prenex_56 0) (<= v_prenex_55 127) (<= .cse15 127) (not (= 0 v_prenex_56)) (= (mod v_prenex_55 v_prenex_56) 0) (<= 0 v_prenex_56))))) .cse5) (and .cse12 (exists ((v_prenex_62 Int) (v_prenex_61 Int)) (let ((.cse19 (mod (* 255 v_prenex_61) 256))) (let ((.cse17 (mod (mod .cse19 v_prenex_62) 256)) (.cse18 (mod (mod v_prenex_62 |c_ULTIMATE.start_gcd_test_#res|) 256))) (and (<= 0 (+ v_prenex_61 128)) (<= v_prenex_61 127) (< v_prenex_61 0) (= |c_ULTIMATE.start_gcd_test_#res| .cse17) (not (= 0 v_prenex_62)) (= (mod v_prenex_61 v_prenex_62) 0) (<= .cse18 127) (<= 0 .cse19) (<= 0 v_prenex_62) (<= .cse17 127) (<= .cse19 127) (= .cse18 0))))) .cse0) (and (exists ((v_prenex_29 Int) (v_ULTIMATE.start_gcd_test_~a_11 Int)) (let ((.cse21 (mod (* 255 v_prenex_29) 256)) (.cse22 (mod v_ULTIMATE.start_gcd_test_~a_11 |c_ULTIMATE.start_gcd_test_#res|))) (let ((.cse20 (mod .cse22 256)) (.cse23 (mod (mod .cse21 v_ULTIMATE.start_gcd_test_~a_11) 256))) (and (= 256 .cse20) (not (= 0 v_ULTIMATE.start_gcd_test_~a_11)) (< v_prenex_29 0) (<= 0 .cse21) (<= v_prenex_29 127) (<= .cse21 127) (< 127 .cse20) (= (mod v_prenex_29 v_ULTIMATE.start_gcd_test_~a_11) 0) (<= 0 (+ v_prenex_29 128)) (= .cse22 0) (<= 0 v_ULTIMATE.start_gcd_test_~a_11) (= .cse23 |c_ULTIMATE.start_gcd_test_#res|) (<= .cse23 127))))) .cse0 .cse5) (and .cse12 .cse0 (exists ((v_prenex_67 Int) (v_prenex_68 Int)) (let ((.cse27 (mod v_prenex_68 |c_ULTIMATE.start_gcd_test_#res|)) (.cse24 (mod (* 255 v_prenex_67) 256))) (let ((.cse25 (mod (mod .cse24 v_prenex_68) 256)) (.cse26 (mod .cse27 256))) (and (<= .cse24 127) (<= 0 (+ v_prenex_67 128)) (<= .cse25 127) (= 256 .cse26) (= |c_ULTIMATE.start_gcd_test_#res| .cse25) (<= v_prenex_67 127) (not (= 0 v_prenex_68)) (<= 0 .cse24) (= 0 .cse27) (< v_prenex_67 0) (= (mod v_prenex_67 v_prenex_68) 0) (<= 0 v_prenex_68) (< 127 .cse26)))))) (and .cse12 .cse0 (exists ((v_prenex_58 Int) (v_prenex_57 Int)) (let ((.cse31 (mod v_prenex_58 |c_ULTIMATE.start_gcd_test_#res|)) (.cse30 (mod (* 255 v_prenex_57) 256))) (let ((.cse29 (mod (mod .cse30 v_prenex_58) 256)) (.cse28 (mod .cse31 256))) (and (<= 0 v_prenex_58) (not (= 0 v_prenex_58)) (<= .cse28 127) (<= 0 (+ v_prenex_57 128)) (= |c_ULTIMATE.start_gcd_test_#res| .cse29) (<= .cse29 127) (<= 0 .cse30) (= .cse28 0) (= 0 .cse31) (= (mod v_prenex_57 v_prenex_58) 0) (<= .cse30 127) (<= v_prenex_57 127) (< v_prenex_57 0)))))) (and .cse0 (exists ((v_prenex_48 Int) (v_prenex_47 Int)) (let ((.cse33 (mod v_prenex_48 |c_ULTIMATE.start_gcd_test_#res|)) (.cse35 (mod (* 255 v_prenex_47) 256))) (let ((.cse34 (mod (mod .cse35 v_prenex_48) 256)) (.cse32 (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_#res|) 256))) (and (<= 0 v_prenex_48) (= (mod v_prenex_47 v_prenex_48) 0) (= .cse32 0) (< v_prenex_48 0) (not (= 0 .cse33)) (<= .cse34 127) (<= .cse35 127) (not (= 0 v_prenex_48)) (= |c_ULTIMATE.start_gcd_test_#res| .cse34) (<= 0 (+ v_prenex_47 128)) (<= v_prenex_47 127) (< v_prenex_47 0) (<= 0 .cse35) (<= .cse32 127))))) .cse5) (and .cse12 .cse0 (exists ((v_prenex_66 Int) (v_prenex_65 Int)) (let ((.cse39 (mod (* 255 v_prenex_65) 256)) (.cse36 (mod v_prenex_66 |c_ULTIMATE.start_gcd_test_#res|))) (let ((.cse37 (mod (+ .cse36 (* 255 |c_ULTIMATE.start_gcd_test_#res|)) 256)) (.cse38 (mod (mod .cse39 v_prenex_66) 256))) (and (not (= 0 .cse36)) (<= 0 v_prenex_66) (< 127 .cse37) (< v_prenex_65 0) (<= .cse38 127) (<= 0 (+ v_prenex_65 128)) (not (= 0 v_prenex_66)) (<= .cse39 127) (<= 0 .cse39) (<= v_prenex_65 127) (< v_prenex_66 0) (= .cse37 256) (= (mod v_prenex_65 v_prenex_66) 0) (= |c_ULTIMATE.start_gcd_test_#res| .cse38)))))) (and .cse0 (exists ((v_prenex_52 Int) (v_prenex_51 Int)) (let ((.cse42 (mod (* 255 v_prenex_51) 256))) (let ((.cse40 (mod (mod v_prenex_52 |c_ULTIMATE.start_gcd_test_#res|) 256)) (.cse41 (mod (mod .cse42 v_prenex_52) 256))) (and (<= 0 (+ v_prenex_51 128)) (<= v_prenex_51 127) (<= .cse40 127) (<= .cse41 127) (<= 0 .cse42) (< v_prenex_51 0) (= 0 .cse40) (<= .cse42 127) (not (= 0 v_prenex_52)) (= |c_ULTIMATE.start_gcd_test_#res| .cse41) (= (mod v_prenex_51 v_prenex_52) 0) (<= 0 v_prenex_52))))) .cse5) (and .cse12 .cse0 (exists ((v_prenex_59 Int) (v_prenex_60 Int)) (let ((.cse43 (mod v_prenex_60 |c_ULTIMATE.start_gcd_test_#res|)) (.cse46 (mod (* 255 v_prenex_59) 256))) (let ((.cse44 (mod (mod .cse46 v_prenex_60) 256)) (.cse45 (mod (+ (* 255 |c_ULTIMATE.start_gcd_test_#res|) .cse43) 256))) (and (= (mod v_prenex_59 v_prenex_60) 0) (not (= 0 .cse43)) (= |c_ULTIMATE.start_gcd_test_#res| .cse44) (< v_prenex_59 0) (< v_prenex_60 0) (<= .cse44 127) (= .cse45 0) (not (= 0 v_prenex_60)) (<= .cse46 127) (<= 0 .cse46) (<= 0 v_prenex_60) (<= 0 (+ v_prenex_59 128)) (<= .cse45 127) (<= v_prenex_59 127)))))))) is different from false [2018-12-30 15:49:37,763 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (< |c_ULTIMATE.start_gcd_test_#res| 0)) (.cse12 (<= 0 |c_ULTIMATE.start_gcd_test_#res|)) (.cse0 (not (= |c_ULTIMATE.start_gcd_test_#res| 0)))) (or (and .cse0 (exists ((v_prenex_49 Int) (v_prenex_50 Int)) (let ((.cse4 (mod v_prenex_50 |c_ULTIMATE.start_gcd_test_#res|)) (.cse3 (mod (* 255 v_prenex_49) 256))) (let ((.cse1 (mod (mod .cse3 v_prenex_50) 256)) (.cse2 (mod .cse4 256))) (and (<= v_prenex_49 127) (<= .cse1 127) (= (mod v_prenex_49 v_prenex_50) 0) (<= 0 v_prenex_50) (= |c_ULTIMATE.start_gcd_test_#res| .cse1) (= .cse2 0) (<= .cse3 127) (= .cse4 0) (<= .cse2 127) (< v_prenex_49 0) (<= 0 .cse3) (not (= 0 v_prenex_50)) (<= 0 (+ v_prenex_49 128)))))) .cse5) (and .cse0 (exists ((v_prenex_54 Int) (v_prenex_53 Int)) (let ((.cse8 (mod (* 255 v_prenex_53) 256))) (let ((.cse7 (mod (mod v_prenex_54 |c_ULTIMATE.start_gcd_test_#res|) 256)) (.cse6 (mod (mod .cse8 v_prenex_54) 256))) (and (<= .cse6 127) (< 127 .cse7) (<= 0 v_prenex_54) (= 256 .cse7) (= (mod v_prenex_53 v_prenex_54) 0) (not (= 0 v_prenex_54)) (<= v_prenex_53 127) (<= .cse8 127) (< v_prenex_53 0) (= |c_ULTIMATE.start_gcd_test_#res| .cse6) (<= 0 (+ v_prenex_53 128)) (<= 0 .cse8))))) .cse5) (and (exists ((v_prenex_63 Int) (v_prenex_64 Int)) (let ((.cse11 (mod (* 255 v_prenex_63) 256))) (let ((.cse9 (mod (mod .cse11 v_prenex_64) 256)) (.cse10 (mod (mod v_prenex_64 |c_ULTIMATE.start_gcd_test_#res|) 256))) (and (<= v_prenex_63 127) (<= .cse9 127) (= .cse10 256) (<= 0 v_prenex_64) (< v_prenex_63 0) (= |c_ULTIMATE.start_gcd_test_#res| .cse9) (not (= 0 v_prenex_64)) (<= .cse11 127) (< 127 .cse10) (<= 0 .cse11) (= (mod v_prenex_63 v_prenex_64) 0) (<= 0 (+ v_prenex_63 128)))))) .cse12 .cse0) (and .cse0 (exists ((v_prenex_56 Int) (v_prenex_55 Int)) (let ((.cse16 (mod (* 255 v_prenex_55) 256)) (.cse13 (mod v_prenex_56 |c_ULTIMATE.start_gcd_test_#res|))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_gcd_test_#res| .cse13) 256)) (.cse15 (mod (mod .cse16 v_prenex_56) 256))) (and (not (= .cse13 0)) (<= 0 (+ v_prenex_55 128)) (= 256 .cse14) (= |c_ULTIMATE.start_gcd_test_#res| .cse15) (< v_prenex_55 0) (< 127 .cse14) (<= .cse16 127) (<= 0 .cse16) (< v_prenex_56 0) (<= v_prenex_55 127) (<= .cse15 127) (not (= 0 v_prenex_56)) (= (mod v_prenex_55 v_prenex_56) 0) (<= 0 v_prenex_56))))) .cse5) (and .cse12 (exists ((v_prenex_62 Int) (v_prenex_61 Int)) (let ((.cse19 (mod (* 255 v_prenex_61) 256))) (let ((.cse17 (mod (mod .cse19 v_prenex_62) 256)) (.cse18 (mod (mod v_prenex_62 |c_ULTIMATE.start_gcd_test_#res|) 256))) (and (<= 0 (+ v_prenex_61 128)) (<= v_prenex_61 127) (< v_prenex_61 0) (= |c_ULTIMATE.start_gcd_test_#res| .cse17) (not (= 0 v_prenex_62)) (= (mod v_prenex_61 v_prenex_62) 0) (<= .cse18 127) (<= 0 .cse19) (<= 0 v_prenex_62) (<= .cse17 127) (<= .cse19 127) (= .cse18 0))))) .cse0) (and (exists ((v_prenex_29 Int) (v_ULTIMATE.start_gcd_test_~a_11 Int)) (let ((.cse21 (mod (* 255 v_prenex_29) 256)) (.cse22 (mod v_ULTIMATE.start_gcd_test_~a_11 |c_ULTIMATE.start_gcd_test_#res|))) (let ((.cse20 (mod .cse22 256)) (.cse23 (mod (mod .cse21 v_ULTIMATE.start_gcd_test_~a_11) 256))) (and (= 256 .cse20) (not (= 0 v_ULTIMATE.start_gcd_test_~a_11)) (< v_prenex_29 0) (<= 0 .cse21) (<= v_prenex_29 127) (<= .cse21 127) (< 127 .cse20) (= (mod v_prenex_29 v_ULTIMATE.start_gcd_test_~a_11) 0) (<= 0 (+ v_prenex_29 128)) (= .cse22 0) (<= 0 v_ULTIMATE.start_gcd_test_~a_11) (= .cse23 |c_ULTIMATE.start_gcd_test_#res|) (<= .cse23 127))))) .cse0 .cse5) (and .cse12 .cse0 (exists ((v_prenex_67 Int) (v_prenex_68 Int)) (let ((.cse27 (mod v_prenex_68 |c_ULTIMATE.start_gcd_test_#res|)) (.cse24 (mod (* 255 v_prenex_67) 256))) (let ((.cse25 (mod (mod .cse24 v_prenex_68) 256)) (.cse26 (mod .cse27 256))) (and (<= .cse24 127) (<= 0 (+ v_prenex_67 128)) (<= .cse25 127) (= 256 .cse26) (= |c_ULTIMATE.start_gcd_test_#res| .cse25) (<= v_prenex_67 127) (not (= 0 v_prenex_68)) (<= 0 .cse24) (= 0 .cse27) (< v_prenex_67 0) (= (mod v_prenex_67 v_prenex_68) 0) (<= 0 v_prenex_68) (< 127 .cse26)))))) (and .cse12 .cse0 (exists ((v_prenex_58 Int) (v_prenex_57 Int)) (let ((.cse31 (mod v_prenex_58 |c_ULTIMATE.start_gcd_test_#res|)) (.cse30 (mod (* 255 v_prenex_57) 256))) (let ((.cse29 (mod (mod .cse30 v_prenex_58) 256)) (.cse28 (mod .cse31 256))) (and (<= 0 v_prenex_58) (not (= 0 v_prenex_58)) (<= .cse28 127) (<= 0 (+ v_prenex_57 128)) (= |c_ULTIMATE.start_gcd_test_#res| .cse29) (<= .cse29 127) (<= 0 .cse30) (= .cse28 0) (= 0 .cse31) (= (mod v_prenex_57 v_prenex_58) 0) (<= .cse30 127) (<= v_prenex_57 127) (< v_prenex_57 0)))))) (and .cse0 (exists ((v_prenex_48 Int) (v_prenex_47 Int)) (let ((.cse33 (mod v_prenex_48 |c_ULTIMATE.start_gcd_test_#res|)) (.cse35 (mod (* 255 v_prenex_47) 256))) (let ((.cse34 (mod (mod .cse35 v_prenex_48) 256)) (.cse32 (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_#res|) 256))) (and (<= 0 v_prenex_48) (= (mod v_prenex_47 v_prenex_48) 0) (= .cse32 0) (< v_prenex_48 0) (not (= 0 .cse33)) (<= .cse34 127) (<= .cse35 127) (not (= 0 v_prenex_48)) (= |c_ULTIMATE.start_gcd_test_#res| .cse34) (<= 0 (+ v_prenex_47 128)) (<= v_prenex_47 127) (< v_prenex_47 0) (<= 0 .cse35) (<= .cse32 127))))) .cse5) (and .cse12 .cse0 (exists ((v_prenex_66 Int) (v_prenex_65 Int)) (let ((.cse39 (mod (* 255 v_prenex_65) 256)) (.cse36 (mod v_prenex_66 |c_ULTIMATE.start_gcd_test_#res|))) (let ((.cse37 (mod (+ .cse36 (* 255 |c_ULTIMATE.start_gcd_test_#res|)) 256)) (.cse38 (mod (mod .cse39 v_prenex_66) 256))) (and (not (= 0 .cse36)) (<= 0 v_prenex_66) (< 127 .cse37) (< v_prenex_65 0) (<= .cse38 127) (<= 0 (+ v_prenex_65 128)) (not (= 0 v_prenex_66)) (<= .cse39 127) (<= 0 .cse39) (<= v_prenex_65 127) (< v_prenex_66 0) (= .cse37 256) (= (mod v_prenex_65 v_prenex_66) 0) (= |c_ULTIMATE.start_gcd_test_#res| .cse38)))))) (and .cse0 (exists ((v_prenex_52 Int) (v_prenex_51 Int)) (let ((.cse42 (mod (* 255 v_prenex_51) 256))) (let ((.cse40 (mod (mod v_prenex_52 |c_ULTIMATE.start_gcd_test_#res|) 256)) (.cse41 (mod (mod .cse42 v_prenex_52) 256))) (and (<= 0 (+ v_prenex_51 128)) (<= v_prenex_51 127) (<= .cse40 127) (<= .cse41 127) (<= 0 .cse42) (< v_prenex_51 0) (= 0 .cse40) (<= .cse42 127) (not (= 0 v_prenex_52)) (= |c_ULTIMATE.start_gcd_test_#res| .cse41) (= (mod v_prenex_51 v_prenex_52) 0) (<= 0 v_prenex_52))))) .cse5) (and .cse12 .cse0 (exists ((v_prenex_59 Int) (v_prenex_60 Int)) (let ((.cse43 (mod v_prenex_60 |c_ULTIMATE.start_gcd_test_#res|)) (.cse46 (mod (* 255 v_prenex_59) 256))) (let ((.cse44 (mod (mod .cse46 v_prenex_60) 256)) (.cse45 (mod (+ (* 255 |c_ULTIMATE.start_gcd_test_#res|) .cse43) 256))) (and (= (mod v_prenex_59 v_prenex_60) 0) (not (= 0 .cse43)) (= |c_ULTIMATE.start_gcd_test_#res| .cse44) (< v_prenex_59 0) (< v_prenex_60 0) (<= .cse44 127) (= .cse45 0) (not (= 0 v_prenex_60)) (<= .cse46 127) (<= 0 .cse46) (<= 0 v_prenex_60) (<= 0 (+ v_prenex_59 128)) (<= .cse45 127) (<= v_prenex_59 127)))))))) is different from true [2018-12-30 15:49:46,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-30 15:49:46,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-30 15:49:46,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-12-30 15:49:46,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 15:49:46,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 15:49:46,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=19, Unknown=8, NotChecked=30, Total=72 [2018-12-30 15:49:46,954 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 9 states. [2018-12-30 15:49:52,234 WARN L181 SmtUtils]: Spent 4.32 s on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2018-12-30 15:49:57,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:49:57,283 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-12-30 15:49:57,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 15:49:57,285 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-12-30 15:49:57,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:49:57,286 INFO L225 Difference]: With dead ends: 21 [2018-12-30 15:49:57,286 INFO L226 Difference]: Without dead ends: 16 [2018-12-30 15:49:57,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=29, Invalid=47, Unknown=8, NotChecked=48, Total=132 [2018-12-30 15:49:57,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-30 15:49:57,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-12-30 15:49:57,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-30 15:49:57,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-12-30 15:49:57,291 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2018-12-30 15:49:57,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:49:57,291 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-12-30 15:49:57,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 15:49:57,291 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-12-30 15:49:57,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-30 15:49:57,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:49:57,293 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:49:57,294 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:49:57,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:49:57,294 INFO L82 PathProgramCache]: Analyzing trace with hash -635259408, now seen corresponding path program 1 times [2018-12-30 15:49:57,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:49:57,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:49:57,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:49:57,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 15:49:57,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:49:57,301 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 15:49:57,301 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 15:49:57,301 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 [2018-12-30 15:49:57,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:49:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:49:57,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:49:57,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:49:58,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-30 15:49:58,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-12-30 15:49:58,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 15:49:58,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 15:49:58,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-30 15:49:58,022 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 6 states. [2018-12-30 15:49:58,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:49:58,196 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-12-30 15:49:58,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 15:49:58,200 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-12-30 15:49:58,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:49:58,201 INFO L225 Difference]: With dead ends: 22 [2018-12-30 15:49:58,201 INFO L226 Difference]: Without dead ends: 13 [2018-12-30 15:49:58,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-30 15:49:58,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-30 15:49:58,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-30 15:49:58,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-30 15:49:58,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-30 15:49:58,204 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-30 15:49:58,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:49:58,205 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-30 15:49:58,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 15:49:58,205 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-30 15:49:58,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-30 15:49:58,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:49:58,205 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:49:58,206 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:49:58,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:49:58,206 INFO L82 PathProgramCache]: Analyzing trace with hash -2068490770, now seen corresponding path program 3 times [2018-12-30 15:49:58,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:49:58,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:49:58,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:49:58,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:49:58,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:49:58,213 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-30 15:49:58,213 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-30 15:49:58,213 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-30 15:49:58,235 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-30 15:50:18,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-30 15:50:18,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 15:50:18,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 15:50:18,950 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 13 [2018-12-30 15:50:31,443 WARN L181 SmtUtils]: Spent 4.67 s on a formula simplification. DAG size of input: 507 DAG size of output: 28 [2018-12-30 15:50:31,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-30 15:50:31,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-30 15:50:31,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-12-30 15:50:31,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 15:50:31,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 15:50:31,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=19, Unknown=2, NotChecked=0, Total=30 [2018-12-30 15:50:31,511 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2018-12-30 15:50:39,597 WARN L181 SmtUtils]: Spent 6.12 s on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2018-12-30 15:50:41,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:50:41,643 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-30 15:50:41,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 15:50:41,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-12-30 15:50:41,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:50:41,644 INFO L225 Difference]: With dead ends: 13 [2018-12-30 15:50:41,645 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 15:50:41,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=23, Invalid=47, Unknown=2, NotChecked=0, Total=72 [2018-12-30 15:50:41,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 15:50:41,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 15:50:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 15:50:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 15:50:41,647 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2018-12-30 15:50:41,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:50:41,648 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 15:50:41,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 15:50:41,648 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 15:50:41,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 15:50:41,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 15:50:58,968 WARN L181 SmtUtils]: Spent 17.22 s on a formula simplification. DAG size of input: 349 DAG size of output: 41 [2018-12-30 15:50:58,971 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 15:50:58,971 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-12-30 15:50:58,971 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 11 23) no Hoare annotation was computed. [2018-12-30 15:50:58,971 INFO L448 ceAbstractionStarter]: For program point L17-2(lines 17 21) no Hoare annotation was computed. [2018-12-30 15:50:58,972 INFO L451 ceAbstractionStarter]: At program point L38(lines 26 39) the Hoare annotation is: true [2018-12-30 15:50:58,972 INFO L448 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-12-30 15:50:58,972 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 36) no Hoare annotation was computed. [2018-12-30 15:50:58,972 INFO L451 ceAbstractionStarter]: At program point L32-1(lines 32 36) the Hoare annotation is: true [2018-12-30 15:50:58,972 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 15:50:58,972 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 15:50:58,972 INFO L444 ceAbstractionStarter]: At program point L22(lines 10 23) the Hoare annotation is: (or (and (= ULTIMATE.start_gcd_test_~a ULTIMATE.start_main_~y~0) (= |ULTIMATE.start_gcd_test_#res| ULTIMATE.start_main_~y~0)) (and (not (= |ULTIMATE.start_gcd_test_#res| 0)) (exists ((v_prenex_58 Int) (v_prenex_57 Int)) (let ((.cse3 (mod v_prenex_58 |ULTIMATE.start_gcd_test_#res|)) (.cse2 (mod (* 255 v_prenex_57) 256))) (let ((.cse1 (mod (mod .cse2 v_prenex_58) 256)) (.cse0 (mod .cse3 256))) (and (<= 0 v_prenex_58) (not (= 0 v_prenex_58)) (<= .cse0 127) (<= 0 (+ v_prenex_57 128)) (= |ULTIMATE.start_gcd_test_#res| .cse1) (<= .cse1 127) (<= 0 .cse2) (= .cse0 0) (= 0 .cse3) (= (mod v_prenex_57 v_prenex_58) 0) (<= .cse2 127) (<= v_prenex_57 127) (< v_prenex_57 0))))))) [2018-12-30 15:50:58,973 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-12-30 15:50:58,973 INFO L448 ceAbstractionStarter]: For program point L14-2(lines 11 23) no Hoare annotation was computed. [2018-12-30 15:50:58,973 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-12-30 15:50:58,980 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:58,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:58,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:58,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:58,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:58,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:58,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:58,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:58,987 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:58,987 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:58,987 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:58,988 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:58,988 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:58,988 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:58,988 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:58,988 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:58,997 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:58,997 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:58,997 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:58,998 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:58,999 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:58,999 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:58,999 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:58,999 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:58,999 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:58,999 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:59,000 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:59,000 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:59,000 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:59,000 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:59,000 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:59,000 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:59,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 03:50:59 BoogieIcfgContainer [2018-12-30 15:50:59,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 15:50:59,006 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 15:50:59,006 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 15:50:59,006 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 15:50:59,007 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 03:48:51" (3/4) ... [2018-12-30 15:50:59,012 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 15:50:59,024 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-30 15:50:59,024 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-30 15:50:59,056 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (a == y && \result == y) || (!(\result == 0) && (\exists v_prenex_58 : int, v_prenex_57 : int :: (((((((((((0 <= v_prenex_58 && !(0 == v_prenex_58)) && v_prenex_58 % \result % 256 <= 127) && 0 <= v_prenex_57 + 128) && \result == 255 * v_prenex_57 % 256 % v_prenex_58 % 256) && 255 * v_prenex_57 % 256 % v_prenex_58 % 256 <= 127) && 0 <= 255 * v_prenex_57 % 256) && v_prenex_58 % \result % 256 == 0) && 0 == v_prenex_58 % \result) && v_prenex_57 % v_prenex_58 == 0) && 255 * v_prenex_57 % 256 <= 127) && v_prenex_57 <= 127) && v_prenex_57 < 0)) [2018-12-30 15:50:59,086 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 15:50:59,086 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 15:50:59,087 INFO L168 Benchmark]: Toolchain (without parser) took 128109.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.2 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -148.7 MB). Peak memory consumption was 50.5 MB. Max. memory is 11.5 GB. [2018-12-30 15:50:59,088 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 15:50:59,088 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.02 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-30 15:50:59,089 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.95 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 15:50:59,089 INFO L168 Benchmark]: Boogie Preprocessor took 24.97 ms. Allocated memory is still 1.0 GB. Free memory was 935.2 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-30 15:50:59,090 INFO L168 Benchmark]: RCFGBuilder took 393.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -185.5 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-12-30 15:50:59,091 INFO L168 Benchmark]: TraceAbstraction took 127302.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.6 MB). Peak memory consumption was 80.4 MB. Max. memory is 11.5 GB. [2018-12-30 15:50:59,092 INFO L168 Benchmark]: Witness Printer took 80.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 15:50:59,097 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 265.02 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.95 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.97 ms. Allocated memory is still 1.0 GB. Free memory was 935.2 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 393.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -185.5 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 127302.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.6 MB). Peak memory consumption was 80.4 MB. Max. memory is 11.5 GB. * Witness Printer took 80.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: 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: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant [2018-12-30 15:50:59,112 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:59,112 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:59,112 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:59,112 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:59,112 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:59,113 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:59,113 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:59,113 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:59,113 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:59,113 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:59,116 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:59,116 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:59,116 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:59,116 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:59,116 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:59,117 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:59,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:59,121 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:59,121 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:59,121 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:59,121 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:59,121 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:59,122 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:59,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:59,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:59,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:59,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:59,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:59,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2018-12-30 15:50:59,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:59,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] [2018-12-30 15:50:59,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_57,QUANTIFIED] Derived loop invariant: (a == y && \result == y) || (!(\result == 0) && (\exists v_prenex_58 : int, v_prenex_57 : int :: (((((((((((0 <= v_prenex_58 && !(0 == v_prenex_58)) && v_prenex_58 % \result % 256 <= 127) && 0 <= v_prenex_57 + 128) && \result == 255 * v_prenex_57 % 256 % v_prenex_58 % 256) && 255 * v_prenex_57 % 256 % v_prenex_58 % 256 <= 127) && 0 <= 255 * v_prenex_57 % 256) && v_prenex_58 % \result % 256 == 0) && 0 == v_prenex_58 % \result) && v_prenex_57 % v_prenex_58 == 0) && 255 * v_prenex_57 % 256 <= 127) && v_prenex_57 <= 127) && v_prenex_57 < 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. SAFE Result, 127.1s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 21.1s AutomataDifference, 0.0s DeadEndRemovalTime, 17.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 37 SDtfs, 19 SDslu, 62 SDs, 0 SdLazy, 86 SolverSat, 8 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 50.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 7 NumberOfFragments, 95 HoareAnnotationTreeSize, 3 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 991 FormulaSimplificationTreeSizeReductionInter, 17.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 40.8s SatisfiabilityAnalysisTime, 47.3s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 48 ConstructedInterpolants, 10 QuantifiedInterpolants, 38861 SizeOfPredicates, 31 NumberOfNonLiveVariables, 256 ConjunctsInSsa, 139 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 7/13 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...