./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_3+newton_2_6.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/gcd_3+newton_2_6.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3d09a4cc0bc23b63ede1d1b9d8e202055edfb550f267c616041c6cb452339e6a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:34:20,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:34:20,070 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:34:20,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:34:20,088 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:34:20,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:34:20,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:34:20,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:34:20,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:34:20,092 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:34:20,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:34:20,093 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:34:20,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:34:20,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:34:20,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:34:20,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:34:20,096 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:34:20,097 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:34:20,098 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:34:20,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:34:20,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:34:20,100 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:34:20,101 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:34:20,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:34:20,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:34:20,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:34:20,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:34:20,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:34:20,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:34:20,105 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:34:20,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:34:20,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:34:20,106 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:34:20,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:34:20,107 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:34:20,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:34:20,108 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:34:20,108 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:34:20,108 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:34:20,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:34:20,109 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:34:20,117 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:34:20,148 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:34:20,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:34:20,148 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:34:20,148 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:34:20,149 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:34:20,149 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:34:20,149 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:34:20,149 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:34:20,150 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:34:20,150 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:34:20,151 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:34:20,151 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:34:20,151 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:34:20,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:34:20,151 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:34:20,151 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:34:20,151 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:34:20,151 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:34:20,152 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:34:20,152 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:34:20,152 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:34:20,152 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:34:20,152 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:34:20,152 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:34:20,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:34:20,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:34:20,153 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:34:20,153 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:34:20,153 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:34:20,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:34:20,153 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:34:20,154 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:34:20,154 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:34:20,154 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 3d09a4cc0bc23b63ede1d1b9d8e202055edfb550f267c616041c6cb452339e6a [2022-02-20 19:34:20,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:34:20,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:34:20,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:34:20,341 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:34:20,342 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:34:20,342 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_3+newton_2_6.i [2022-02-20 19:34:20,400 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95ac8833d/6b100cf9973b470f9c495bed3b752921/FLAGd11220f95 [2022-02-20 19:34:20,739 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:34:20,739 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_2_6.i [2022-02-20 19:34:20,748 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95ac8833d/6b100cf9973b470f9c495bed3b752921/FLAGd11220f95 [2022-02-20 19:34:21,185 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95ac8833d/6b100cf9973b470f9c495bed3b752921 [2022-02-20 19:34:21,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:34:21,188 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:34:21,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:34:21,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:34:21,194 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:34:21,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:34:21" (1/1) ... [2022-02-20 19:34:21,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a381b49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:34:21, skipping insertion in model container [2022-02-20 19:34:21,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:34:21" (1/1) ... [2022-02-20 19:34:21,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:34:21,224 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:34:21,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_2_6.i[1226,1239] [2022-02-20 19:34:21,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_2_6.i[2841,2854] [2022-02-20 19:34:21,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:34:21,387 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:34:21,398 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_2_6.i[1226,1239] [2022-02-20 19:34:21,417 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_2_6.i[2841,2854] [2022-02-20 19:34:21,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:34:21,434 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:34:21,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:34:21 WrapperNode [2022-02-20 19:34:21,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:34:21,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:34:21,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:34:21,436 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:34:21,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:34:21" (1/1) ... [2022-02-20 19:34:21,452 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:34:21" (1/1) ... [2022-02-20 19:34:21,479 INFO L137 Inliner]: procedures = 27, calls = 16, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 77 [2022-02-20 19:34:21,480 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:34:21,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:34:21,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:34:21,480 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:34:21,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:34:21" (1/1) ... [2022-02-20 19:34:21,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:34:21" (1/1) ... [2022-02-20 19:34:21,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:34:21" (1/1) ... [2022-02-20 19:34:21,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:34:21" (1/1) ... [2022-02-20 19:34:21,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:34:21" (1/1) ... [2022-02-20 19:34:21,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:34:21" (1/1) ... [2022-02-20 19:34:21,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:34:21" (1/1) ... [2022-02-20 19:34:21,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:34:21,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:34:21,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:34:21,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:34:21,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:34:21" (1/1) ... [2022-02-20 19:34:21,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:34:21,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:34:21,535 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:34:21,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:34:21,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:34:21,563 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-02-20 19:34:21,563 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-02-20 19:34:21,563 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-02-20 19:34:21,564 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-02-20 19:34:21,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:34:21,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:34:21,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:34:21,620 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:34:21,621 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:34:21,773 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:34:21,778 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:34:21,778 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 19:34:21,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:34:21 BoogieIcfgContainer [2022-02-20 19:34:21,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:34:21,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:34:21,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:34:21,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:34:21,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:34:21" (1/3) ... [2022-02-20 19:34:21,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135637f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:34:21, skipping insertion in model container [2022-02-20 19:34:21,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:34:21" (2/3) ... [2022-02-20 19:34:21,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135637f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:34:21, skipping insertion in model container [2022-02-20 19:34:21,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:34:21" (3/3) ... [2022-02-20 19:34:21,794 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_2_6.i [2022-02-20 19:34:21,797 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:34:21,811 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:34:21,847 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:34:21,852 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:34:21,852 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:34:21,880 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 19:34:21,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 19:34:21,884 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:34:21,884 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:34:21,885 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:34:21,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:34:21,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-02-20 19:34:21,897 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:34:21,906 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935293821] [2022-02-20 19:34:21,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:34:21,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:34:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:34:22,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {40#true} is VALID [2022-02-20 19:34:22,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {40#true} is VALID [2022-02-20 19:34:22,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet5#1, main1_#t~nondet6#1, main1_#t~ret7#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;assume -128 <= main1_#t~nondet5#1 && main1_#t~nondet5#1 <= 127;main1_~x~0#1 := main1_#t~nondet5#1;havoc main1_#t~nondet5#1;assume -128 <= main1_#t~nondet6#1 && main1_#t~nondet6#1 <= 127;main1_~y~0#1 := main1_#t~nondet6#1;havoc main1_#t~nondet6#1;havoc main1_~g~0#1;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main1_~x~0#1, main1_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1, gcd_test_~t~0#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1;havoc gcd_test_~t~0#1; {42#(= (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) |ULTIMATE.start_main1_~x~0#1|) 0)} is VALID [2022-02-20 19:34:22,121 INFO L290 TraceCheckUtils]: 3: Hoare triple {42#(= (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) |ULTIMATE.start_main1_~x~0#1|) 0)} assume gcd_test_~a#1 < 0;gcd_test_~a#1 := (if -gcd_test_~a#1 % 256 <= 127 then -gcd_test_~a#1 % 256 else -gcd_test_~a#1 % 256 - 256); {43#(<= (+ |ULTIMATE.start_main1_~x~0#1| 1) 0)} is VALID [2022-02-20 19:34:22,121 INFO L290 TraceCheckUtils]: 4: Hoare triple {43#(<= (+ |ULTIMATE.start_main1_~x~0#1| 1) 0)} assume gcd_test_~b#1 < 0;gcd_test_~b#1 := (if -gcd_test_~b#1 % 256 <= 127 then -gcd_test_~b#1 % 256 else -gcd_test_~b#1 % 256 - 256); {43#(<= (+ |ULTIMATE.start_main1_~x~0#1| 1) 0)} is VALID [2022-02-20 19:34:22,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#(<= (+ |ULTIMATE.start_main1_~x~0#1| 1) 0)} assume !(0 != gcd_test_~b#1); {43#(<= (+ |ULTIMATE.start_main1_~x~0#1| 1) 0)} is VALID [2022-02-20 19:34:22,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {43#(<= (+ |ULTIMATE.start_main1_~x~0#1| 1) 0)} gcd_test_#res#1 := gcd_test_~a#1; {43#(<= (+ |ULTIMATE.start_main1_~x~0#1| 1) 0)} is VALID [2022-02-20 19:34:22,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#(<= (+ |ULTIMATE.start_main1_~x~0#1| 1) 0)} main1_#t~ret7#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -128 <= main1_#t~ret7#1 && main1_#t~ret7#1 <= 127;main1_~g~0#1 := main1_#t~ret7#1;havoc main1_#t~ret7#1; {43#(<= (+ |ULTIMATE.start_main1_~x~0#1| 1) 0)} is VALID [2022-02-20 19:34:22,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#(<= (+ |ULTIMATE.start_main1_~x~0#1| 1) 0)} assume main1_~x~0#1 > 0;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main1_~x~0#1 >= main1_~g~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {41#false} is VALID [2022-02-20 19:34:22,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume 0 == __VERIFIER_assert_~cond#1; {41#false} is VALID [2022-02-20 19:34:22,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-02-20 19:34:22,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:34:22,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:34:22,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935293821] [2022-02-20 19:34:22,137 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935293821] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:34:22,137 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:34:22,138 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 19:34:22,139 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465525544] [2022-02-20 19:34:22,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:34:22,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 19:34:22,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:34:22,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:34:22,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:34:22,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:34:22,160 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:34:22,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:34:22,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:34:22,181 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:34:22,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:34:22,302 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2022-02-20 19:34:22,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:34:22,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 19:34:22,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:34:22,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:34:22,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2022-02-20 19:34:22,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:34:22,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2022-02-20 19:34:22,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 110 transitions. [2022-02-20 19:34:22,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:34:22,394 INFO L225 Difference]: With dead ends: 90 [2022-02-20 19:34:22,394 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 19:34:22,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:34:22,398 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 23 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:34:22,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 119 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:34:22,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 19:34:22,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2022-02-20 19:34:22,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:34:22,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 19:34:22,424 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 19:34:22,425 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 19:34:22,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:34:22,428 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-02-20 19:34:22,428 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-02-20 19:34:22,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:34:22,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:34:22,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 36 states. [2022-02-20 19:34:22,429 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 36 states. [2022-02-20 19:34:22,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:34:22,431 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-02-20 19:34:22,432 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-02-20 19:34:22,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:34:22,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:34:22,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:34:22,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:34:22,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 19:34:22,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-02-20 19:34:22,436 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2022-02-20 19:34:22,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:34:22,443 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-02-20 19:34:22,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:34:22,443 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-02-20 19:34:22,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 19:34:22,444 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:34:22,444 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:34:22,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:34:22,445 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:34:22,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:34:22,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1776235347, now seen corresponding path program 1 times [2022-02-20 19:34:22,446 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:34:22,446 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562968894] [2022-02-20 19:34:22,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:34:22,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:34:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:34:22,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {269#true} is VALID [2022-02-20 19:34:22,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {269#true} is VALID [2022-02-20 19:34:22,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {269#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet5#1, main1_#t~nondet6#1, main1_#t~ret7#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;assume -128 <= main1_#t~nondet5#1 && main1_#t~nondet5#1 <= 127;main1_~x~0#1 := main1_#t~nondet5#1;havoc main1_#t~nondet5#1;assume -128 <= main1_#t~nondet6#1 && main1_#t~nondet6#1 <= 127;main1_~y~0#1 := main1_#t~nondet6#1;havoc main1_#t~nondet6#1;havoc main1_~g~0#1;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main1_~x~0#1, main1_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1, gcd_test_~t~0#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1;havoc gcd_test_~t~0#1; {271#(= (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) |ULTIMATE.start_main1_~x~0#1|) 0)} is VALID [2022-02-20 19:34:22,502 INFO L290 TraceCheckUtils]: 3: Hoare triple {271#(= (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) |ULTIMATE.start_main1_~x~0#1|) 0)} assume !(gcd_test_~a#1 < 0); {271#(= (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) |ULTIMATE.start_main1_~x~0#1|) 0)} is VALID [2022-02-20 19:34:22,503 INFO L290 TraceCheckUtils]: 4: Hoare triple {271#(= (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) |ULTIMATE.start_main1_~x~0#1|) 0)} assume gcd_test_~b#1 < 0;gcd_test_~b#1 := (if -gcd_test_~b#1 % 256 <= 127 then -gcd_test_~b#1 % 256 else -gcd_test_~b#1 % 256 - 256); {271#(= (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) |ULTIMATE.start_main1_~x~0#1|) 0)} is VALID [2022-02-20 19:34:22,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {271#(= (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) |ULTIMATE.start_main1_~x~0#1|) 0)} assume !(0 != gcd_test_~b#1); {271#(= (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) |ULTIMATE.start_main1_~x~0#1|) 0)} is VALID [2022-02-20 19:34:22,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {271#(= (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) |ULTIMATE.start_main1_~x~0#1|) 0)} gcd_test_#res#1 := gcd_test_~a#1; {272#(<= |ULTIMATE.start_gcd_test_#res#1| |ULTIMATE.start_main1_~x~0#1|)} is VALID [2022-02-20 19:34:22,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {272#(<= |ULTIMATE.start_gcd_test_#res#1| |ULTIMATE.start_main1_~x~0#1|)} main1_#t~ret7#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -128 <= main1_#t~ret7#1 && main1_#t~ret7#1 <= 127;main1_~g~0#1 := main1_#t~ret7#1;havoc main1_#t~ret7#1; {273#(<= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~x~0#1|)} is VALID [2022-02-20 19:34:22,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {273#(<= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~x~0#1|)} assume main1_~x~0#1 > 0;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main1_~x~0#1 >= main1_~g~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {274#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 19:34:22,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {274#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {270#false} is VALID [2022-02-20 19:34:22,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {270#false} assume !false; {270#false} is VALID [2022-02-20 19:34:22,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:34:22,506 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:34:22,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562968894] [2022-02-20 19:34:22,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562968894] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:34:22,506 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:34:22,506 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:34:22,506 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468499164] [2022-02-20 19:34:22,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:34:22,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 19:34:22,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:34:22,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:34:22,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:34:22,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:34:22,517 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:34:22,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:34:22,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:34:22,518 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:34:22,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:34:22,644 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-02-20 19:34:22,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:34:22,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 19:34:22,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:34:22,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:34:22,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-02-20 19:34:22,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:34:22,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-02-20 19:34:22,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-02-20 19:34:22,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:34:22,675 INFO L225 Difference]: With dead ends: 36 [2022-02-20 19:34:22,675 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 19:34:22,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:34:22,677 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:34:22,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 130 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:34:22,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 19:34:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 19:34:22,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:34:22,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 19:34:22,680 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 19:34:22,681 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 19:34:22,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:34:22,682 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-02-20 19:34:22,683 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-02-20 19:34:22,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:34:22,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:34:22,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-02-20 19:34:22,684 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-02-20 19:34:22,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:34:22,685 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-02-20 19:34:22,685 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-02-20 19:34:22,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:34:22,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:34:22,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:34:22,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:34:22,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 19:34:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-02-20 19:34:22,688 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2022-02-20 19:34:22,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:34:22,688 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-02-20 19:34:22,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:34:22,688 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-02-20 19:34:22,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 19:34:22,689 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:34:22,689 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:34:22,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:34:22,689 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:34:22,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:34:22,690 INFO L85 PathProgramCache]: Analyzing trace with hash 830014046, now seen corresponding path program 1 times [2022-02-20 19:34:22,690 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:34:22,690 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904022380] [2022-02-20 19:34:22,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:34:22,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:34:22,713 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 19:34:22,717 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1927534703] [2022-02-20 19:34:22,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:34:22,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:34:22,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:34:22,738 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:34:22,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 19:34:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:34:22,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 19:34:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:34:22,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:34:54,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {424#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {424#true} is VALID [2022-02-20 19:34:54,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {424#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {424#true} is VALID [2022-02-20 19:34:54,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {424#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet5#1, main1_#t~nondet6#1, main1_#t~ret7#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;assume -128 <= main1_#t~nondet5#1 && main1_#t~nondet5#1 <= 127;main1_~x~0#1 := main1_#t~nondet5#1;havoc main1_#t~nondet5#1;assume -128 <= main1_#t~nondet6#1 && main1_#t~nondet6#1 <= 127;main1_~y~0#1 := main1_#t~nondet6#1;havoc main1_#t~nondet6#1;havoc main1_~g~0#1;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main1_~x~0#1, main1_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1, gcd_test_~t~0#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1;havoc gcd_test_~t~0#1; {435#(= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|)} is VALID [2022-02-20 19:34:54,746 INFO L290 TraceCheckUtils]: 3: Hoare triple {435#(= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|)} assume !(gcd_test_~a#1 < 0); {439#(and (= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)))} is VALID [2022-02-20 19:34:54,751 INFO L290 TraceCheckUtils]: 4: Hoare triple {439#(and (= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)))} assume gcd_test_~b#1 < 0;gcd_test_~b#1 := (if -gcd_test_~b#1 % 256 <= 127 then -gcd_test_~b#1 % 256 else -gcd_test_~b#1 % 256 - 256); {443#(and (= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_9| Int)) (and (<= (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_9|) 256) 127) (<= |ULTIMATE.start_gcd_test_~b#1| (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_9|) 256)))))} is VALID [2022-02-20 19:34:54,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {443#(and (= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_9| Int)) (and (<= (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_9|) 256) 127) (<= |ULTIMATE.start_gcd_test_~b#1| (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_9|) 256)))))} assume !!(0 != gcd_test_~b#1);gcd_test_~t~0#1 := gcd_test_~b#1;gcd_test_~b#1 := (if (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 <= 127 then (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 else (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 - 256);gcd_test_~a#1 := gcd_test_~t~0#1; {447#(and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_9| Int) (|v_ULTIMATE.start_gcd_test_~b#1_10| Int)) (and (<= (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_9|) 256) 127) (<= |ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_10|) (<= |v_ULTIMATE.start_gcd_test_~b#1_10| (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_9|) 256)) (or (and (<= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_10|) 256) 127) (= |ULTIMATE.start_gcd_test_~b#1| (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_10|) 256))) (and (not (<= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_10|) 256) 127)) (= (+ (- 256) (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_10|) 256)) |ULTIMATE.start_gcd_test_~b#1|))))) (not (< |ULTIMATE.start_main1_~x~0#1| 0)))} is VALID [2022-02-20 19:34:54,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {447#(and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_9| Int) (|v_ULTIMATE.start_gcd_test_~b#1_10| Int)) (and (<= (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_9|) 256) 127) (<= |ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_10|) (<= |v_ULTIMATE.start_gcd_test_~b#1_10| (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_9|) 256)) (or (and (<= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_10|) 256) 127) (= |ULTIMATE.start_gcd_test_~b#1| (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_10|) 256))) (and (not (<= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_10|) 256) 127)) (= (+ (- 256) (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_10|) 256)) |ULTIMATE.start_gcd_test_~b#1|))))) (not (< |ULTIMATE.start_main1_~x~0#1| 0)))} assume !(0 != gcd_test_~b#1); {451#(and (not (< |ULTIMATE.start_main1_~x~0#1| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_9| Int) (|v_ULTIMATE.start_gcd_test_~b#1_10| Int)) (and (= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_10|) 256) 0) (<= (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_9|) 256) 127) (<= |ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_10|) (<= |v_ULTIMATE.start_gcd_test_~b#1_10| (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_9|) 256)))))} is VALID [2022-02-20 19:34:54,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {451#(and (not (< |ULTIMATE.start_main1_~x~0#1| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_9| Int) (|v_ULTIMATE.start_gcd_test_~b#1_10| Int)) (and (= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_10|) 256) 0) (<= (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_9|) 256) 127) (<= |ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_10|) (<= |v_ULTIMATE.start_gcd_test_~b#1_10| (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_9|) 256)))))} gcd_test_#res#1 := gcd_test_~a#1; {455#(and (not (< |ULTIMATE.start_main1_~x~0#1| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_9| Int) (|v_ULTIMATE.start_gcd_test_~b#1_10| Int)) (and (= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_10|) 256) 0) (<= (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_9|) 256) 127) (<= |ULTIMATE.start_gcd_test_#res#1| |v_ULTIMATE.start_gcd_test_~b#1_10|) (<= |v_ULTIMATE.start_gcd_test_~b#1_10| (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_9|) 256)))))} is VALID [2022-02-20 19:34:54,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {455#(and (not (< |ULTIMATE.start_main1_~x~0#1| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_9| Int) (|v_ULTIMATE.start_gcd_test_~b#1_10| Int)) (and (= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_10|) 256) 0) (<= (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_9|) 256) 127) (<= |ULTIMATE.start_gcd_test_#res#1| |v_ULTIMATE.start_gcd_test_~b#1_10|) (<= |v_ULTIMATE.start_gcd_test_~b#1_10| (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_9|) 256)))))} main1_#t~ret7#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -128 <= main1_#t~ret7#1 && main1_#t~ret7#1 <= 127;main1_~g~0#1 := main1_#t~ret7#1;havoc main1_#t~ret7#1; {459#(and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_9| Int) (|v_ULTIMATE.start_gcd_test_~b#1_10| Int)) (and (<= |ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_10|) (= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_10|) 256) 0) (<= (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_9|) 256) 127) (<= |v_ULTIMATE.start_gcd_test_~b#1_10| (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_9|) 256)))) (not (< |ULTIMATE.start_main1_~x~0#1| 0)))} is VALID [2022-02-20 19:34:54,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {459#(and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_9| Int) (|v_ULTIMATE.start_gcd_test_~b#1_10| Int)) (and (<= |ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_10|) (= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_10|) 256) 0) (<= (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_9|) 256) 127) (<= |v_ULTIMATE.start_gcd_test_~b#1_10| (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_9|) 256)))) (not (< |ULTIMATE.start_main1_~x~0#1| 0)))} assume main1_~x~0#1 > 0;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main1_~x~0#1 >= main1_~g~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {463#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 19:34:54,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {463#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {425#false} is VALID [2022-02-20 19:34:54,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {425#false} assume !false; {425#false} is VALID [2022-02-20 19:34:54,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:34:54,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:35:01,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {425#false} assume !false; {425#false} is VALID [2022-02-20 19:35:01,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {463#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {425#false} is VALID [2022-02-20 19:35:01,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {476#(or (<= |ULTIMATE.start_main1_~x~0#1| 0) (<= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~x~0#1|))} assume main1_~x~0#1 > 0;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main1_~x~0#1 >= main1_~g~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {463#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 19:35:01,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {480#(or (<= |ULTIMATE.start_main1_~x~0#1| 0) (<= |ULTIMATE.start_gcd_test_#res#1| |ULTIMATE.start_main1_~x~0#1|))} main1_#t~ret7#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -128 <= main1_#t~ret7#1 && main1_#t~ret7#1 <= 127;main1_~g~0#1 := main1_#t~ret7#1;havoc main1_#t~ret7#1; {476#(or (<= |ULTIMATE.start_main1_~x~0#1| 0) (<= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~x~0#1|))} is VALID [2022-02-20 19:35:01,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {484#(or (<= |ULTIMATE.start_main1_~x~0#1| 0) (<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|))} gcd_test_#res#1 := gcd_test_~a#1; {480#(or (<= |ULTIMATE.start_main1_~x~0#1| 0) (<= |ULTIMATE.start_gcd_test_#res#1| |ULTIMATE.start_main1_~x~0#1|))} is VALID [2022-02-20 19:35:01,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {488#(or (<= |ULTIMATE.start_main1_~x~0#1| 0) (<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|) (not (= |ULTIMATE.start_gcd_test_~b#1| 0)))} assume !(0 != gcd_test_~b#1); {484#(or (<= |ULTIMATE.start_main1_~x~0#1| 0) (<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|))} is VALID [2022-02-20 19:35:01,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {492#(or (<= |ULTIMATE.start_main1_~x~0#1| 0) (<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~x~0#1|) (and (or (not (= 0 (mod (mod |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|) 256))) (and (not (= (mod |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0))) (or (not (= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) (mod |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|)) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)))))} assume !!(0 != gcd_test_~b#1);gcd_test_~t~0#1 := gcd_test_~b#1;gcd_test_~b#1 := (if (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 <= 127 then (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 else (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 - 256);gcd_test_~a#1 := gcd_test_~t~0#1; {488#(or (<= |ULTIMATE.start_main1_~x~0#1| 0) (<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|) (not (= |ULTIMATE.start_gcd_test_~b#1| 0)))} is VALID [2022-02-20 19:35:03,793 WARN L290 TraceCheckUtils]: 4: Hoare triple {496#(or (<= |ULTIMATE.start_main1_~x~0#1| 0) (forall ((|v_ULTIMATE.start_gcd_test_~b#1_12| Int) (|ULTIMATE.start_gcd_test_~b#1| Int)) (or (not (= (mod (mod |ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_12|) 256) 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_12| |ULTIMATE.start_main1_~x~0#1|) (not (<= |v_ULTIMATE.start_gcd_test_~b#1_12| (mod (* |ULTIMATE.start_gcd_test_~b#1| 255) 256))) (not (<= (mod (* |ULTIMATE.start_gcd_test_~b#1| 255) 256) 127)))))} assume gcd_test_~b#1 < 0;gcd_test_~b#1 := (if -gcd_test_~b#1 % 256 <= 127 then -gcd_test_~b#1 % 256 else -gcd_test_~b#1 % 256 - 256); {492#(or (<= |ULTIMATE.start_main1_~x~0#1| 0) (<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~x~0#1|) (and (or (not (= 0 (mod (mod |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|) 256))) (and (not (= (mod |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0))) (or (not (= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) (mod |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|)) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)))))} is UNKNOWN [2022-02-20 19:35:03,795 INFO L290 TraceCheckUtils]: 3: Hoare triple {500#(or (<= |ULTIMATE.start_main1_~x~0#1| 0) (forall ((|v_ULTIMATE.start_gcd_test_~b#1_12| Int) (|ULTIMATE.start_gcd_test_~b#1| Int)) (or (not (= (mod (mod |ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_12|) 256) 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_12| |ULTIMATE.start_main1_~x~0#1|) (not (<= |v_ULTIMATE.start_gcd_test_~b#1_12| (mod (* |ULTIMATE.start_gcd_test_~b#1| 255) 256))) (not (<= (mod (* |ULTIMATE.start_gcd_test_~b#1| 255) 256) 127)))) (< |ULTIMATE.start_gcd_test_~a#1| 0))} assume !(gcd_test_~a#1 < 0); {496#(or (<= |ULTIMATE.start_main1_~x~0#1| 0) (forall ((|v_ULTIMATE.start_gcd_test_~b#1_12| Int) (|ULTIMATE.start_gcd_test_~b#1| Int)) (or (not (= (mod (mod |ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_12|) 256) 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_12| |ULTIMATE.start_main1_~x~0#1|) (not (<= |v_ULTIMATE.start_gcd_test_~b#1_12| (mod (* |ULTIMATE.start_gcd_test_~b#1| 255) 256))) (not (<= (mod (* |ULTIMATE.start_gcd_test_~b#1| 255) 256) 127)))))} is VALID [2022-02-20 19:35:03,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {424#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet5#1, main1_#t~nondet6#1, main1_#t~ret7#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;assume -128 <= main1_#t~nondet5#1 && main1_#t~nondet5#1 <= 127;main1_~x~0#1 := main1_#t~nondet5#1;havoc main1_#t~nondet5#1;assume -128 <= main1_#t~nondet6#1 && main1_#t~nondet6#1 <= 127;main1_~y~0#1 := main1_#t~nondet6#1;havoc main1_#t~nondet6#1;havoc main1_~g~0#1;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main1_~x~0#1, main1_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1, gcd_test_~t~0#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1;havoc gcd_test_~t~0#1; {500#(or (<= |ULTIMATE.start_main1_~x~0#1| 0) (forall ((|v_ULTIMATE.start_gcd_test_~b#1_12| Int) (|ULTIMATE.start_gcd_test_~b#1| Int)) (or (not (= (mod (mod |ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_12|) 256) 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_12| |ULTIMATE.start_main1_~x~0#1|) (not (<= |v_ULTIMATE.start_gcd_test_~b#1_12| (mod (* |ULTIMATE.start_gcd_test_~b#1| 255) 256))) (not (<= (mod (* |ULTIMATE.start_gcd_test_~b#1| 255) 256) 127)))) (< |ULTIMATE.start_gcd_test_~a#1| 0))} is VALID [2022-02-20 19:35:03,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {424#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {424#true} is VALID [2022-02-20 19:35:03,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {424#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {424#true} is VALID [2022-02-20 19:35:03,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:35:03,801 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:35:03,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904022380] [2022-02-20 19:35:03,801 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 19:35:03,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927534703] [2022-02-20 19:35:03,801 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927534703] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:35:03,801 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 19:35:03,801 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-02-20 19:35:03,801 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882037011] [2022-02-20 19:35:03,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 19:35:03,803 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 19:35:03,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:35:03,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:35:06,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 19:35:06,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-20 19:35:06,296 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:35:06,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-20 19:35:06,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=206, Unknown=12, NotChecked=0, Total=272 [2022-02-20 19:35:06,297 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:35:07,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:35:07,599 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-02-20 19:35:07,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 19:35:07,599 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 19:35:07,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:35:07,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:35:07,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 46 transitions. [2022-02-20 19:35:07,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:35:07,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 46 transitions. [2022-02-20 19:35:07,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 46 transitions. [2022-02-20 19:35:07,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:35:07,659 INFO L225 Difference]: With dead ends: 42 [2022-02-20 19:35:07,659 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 19:35:07,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 35.6s TimeCoverageRelationStatistics Valid=74, Invalid=256, Unknown=12, NotChecked=0, Total=342 [2022-02-20 19:35:07,660 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:35:07,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 300 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 26 Unchecked, 0.0s Time] [2022-02-20 19:35:07,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 19:35:07,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-02-20 19:35:07,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:35:07,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 19:35:07,664 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 19:35:07,664 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 19:35:07,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:35:07,665 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-02-20 19:35:07,665 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-02-20 19:35:07,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:35:07,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:35:07,666 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-02-20 19:35:07,666 INFO L87 Difference]: Start difference. First operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-02-20 19:35:07,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:35:07,667 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-02-20 19:35:07,667 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-02-20 19:35:07,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:35:07,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:35:07,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:35:07,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:35:07,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 19:35:07,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-02-20 19:35:07,669 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 12 [2022-02-20 19:35:07,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:35:07,670 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-02-20 19:35:07,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:35:07,670 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-02-20 19:35:07,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 19:35:07,673 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:35:07,673 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:35:07,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 19:35:07,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:35:07,874 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:35:07,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:35:07,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1561924787, now seen corresponding path program 2 times [2022-02-20 19:35:07,875 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:35:07,875 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915077712] [2022-02-20 19:35:07,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:35:07,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:35:07,895 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 19:35:07,896 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [933099731] [2022-02-20 19:35:07,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 19:35:07,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:35:07,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:35:07,897 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:35:07,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 19:35:08,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 19:35:08,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 19:35:08,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-20 19:35:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:35:08,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:35:35,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {668#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {668#true} is VALID [2022-02-20 19:35:35,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {668#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {668#true} is VALID [2022-02-20 19:35:35,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {668#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet5#1, main1_#t~nondet6#1, main1_#t~ret7#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;assume -128 <= main1_#t~nondet5#1 && main1_#t~nondet5#1 <= 127;main1_~x~0#1 := main1_#t~nondet5#1;havoc main1_#t~nondet5#1;assume -128 <= main1_#t~nondet6#1 && main1_#t~nondet6#1 <= 127;main1_~y~0#1 := main1_#t~nondet6#1;havoc main1_#t~nondet6#1;havoc main1_~g~0#1;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main1_~x~0#1, main1_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1, gcd_test_~t~0#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1;havoc gcd_test_~t~0#1; {679#(= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|)} is VALID [2022-02-20 19:35:35,071 INFO L290 TraceCheckUtils]: 3: Hoare triple {679#(= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|)} assume !(gcd_test_~a#1 < 0); {683#(and (= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)))} is VALID [2022-02-20 19:35:35,071 INFO L290 TraceCheckUtils]: 4: Hoare triple {683#(and (= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)))} assume gcd_test_~b#1 < 0;gcd_test_~b#1 := (if -gcd_test_~b#1 % 256 <= 127 then -gcd_test_~b#1 % 256 else -gcd_test_~b#1 % 256 - 256); {683#(and (= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)))} is VALID [2022-02-20 19:35:35,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {683#(and (= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)))} assume !!(0 != gcd_test_~b#1);gcd_test_~t~0#1 := gcd_test_~b#1;gcd_test_~b#1 := (if (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 <= 127 then (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 else (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 - 256);gcd_test_~a#1 := gcd_test_~t~0#1; {690#(and (not (= |ULTIMATE.start_gcd_test_~a#1| 0)) (or (and (not (<= (mod (mod |ULTIMATE.start_main1_~x~0#1| |ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| (+ (mod (mod |ULTIMATE.start_main1_~x~0#1| |ULTIMATE.start_gcd_test_~a#1|) 256) (- 256)))) (and (<= (mod (mod |ULTIMATE.start_main1_~x~0#1| |ULTIMATE.start_gcd_test_~a#1|) 256) 127) (= |ULTIMATE.start_gcd_test_~b#1| (mod (mod |ULTIMATE.start_main1_~x~0#1| |ULTIMATE.start_gcd_test_~a#1|) 256)))) (not (< |ULTIMATE.start_main1_~x~0#1| 0)))} is VALID [2022-02-20 19:35:35,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {690#(and (not (= |ULTIMATE.start_gcd_test_~a#1| 0)) (or (and (not (<= (mod (mod |ULTIMATE.start_main1_~x~0#1| |ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| (+ (mod (mod |ULTIMATE.start_main1_~x~0#1| |ULTIMATE.start_gcd_test_~a#1|) 256) (- 256)))) (and (<= (mod (mod |ULTIMATE.start_main1_~x~0#1| |ULTIMATE.start_gcd_test_~a#1|) 256) 127) (= |ULTIMATE.start_gcd_test_~b#1| (mod (mod |ULTIMATE.start_main1_~x~0#1| |ULTIMATE.start_gcd_test_~a#1|) 256)))) (not (< |ULTIMATE.start_main1_~x~0#1| 0)))} assume !!(0 != gcd_test_~b#1);gcd_test_~t~0#1 := gcd_test_~b#1;gcd_test_~b#1 := (if (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 <= 127 then (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 else (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 - 256);gcd_test_~a#1 := gcd_test_~t~0#1; {694#(and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (or (and (or (and (< |ULTIMATE.start_gcd_test_~a#1| 0) (= |ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ |ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|)) 256)))) (and (<= (mod (+ |ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|)) 256) 127) (= |ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ (* |ULTIMATE.start_gcd_test_~a#1| 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|)) 256)))) (and (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= |ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ (* |ULTIMATE.start_gcd_test_~a#1| 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|)) 256)))) (and (= |ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ |ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|)) 256))) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~a#1| 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|)) 256) 127))) (not (= (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (and (or (= (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|) 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (= |ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|) 256)))) (not (= |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (or (and (<= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256) 127) (= |ULTIMATE.start_gcd_test_~a#1| (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256))) (and (= |ULTIMATE.start_gcd_test_~a#1| (+ (- 256) (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256))) (not (<= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256) 127)))))) (not (= |ULTIMATE.start_gcd_test_~a#1| 0)) (not (< |ULTIMATE.start_main1_~x~0#1| 0)))} is VALID [2022-02-20 19:35:35,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {694#(and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (or (and (or (and (< |ULTIMATE.start_gcd_test_~a#1| 0) (= |ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ |ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|)) 256)))) (and (<= (mod (+ |ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|)) 256) 127) (= |ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ (* |ULTIMATE.start_gcd_test_~a#1| 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|)) 256)))) (and (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= |ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ (* |ULTIMATE.start_gcd_test_~a#1| 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|)) 256)))) (and (= |ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ |ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|)) 256))) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~a#1| 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|)) 256) 127))) (not (= (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (and (or (= (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|) 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (= |ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|) 256)))) (not (= |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (or (and (<= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256) 127) (= |ULTIMATE.start_gcd_test_~a#1| (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256))) (and (= |ULTIMATE.start_gcd_test_~a#1| (+ (- 256) (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256))) (not (<= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256) 127)))))) (not (= |ULTIMATE.start_gcd_test_~a#1| 0)) (not (< |ULTIMATE.start_main1_~x~0#1| 0)))} assume !(0 != gcd_test_~b#1); {698#(and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|) 256) 0) (or (and (<= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256) 127) (= |ULTIMATE.start_gcd_test_~a#1| (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256))) (and (= |ULTIMATE.start_gcd_test_~a#1| (+ (- 256) (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256))) (not (<= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256) 127)))))) (not (= |ULTIMATE.start_gcd_test_~a#1| 0)) (not (< |ULTIMATE.start_main1_~x~0#1| 0)))} is VALID [2022-02-20 19:35:35,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {698#(and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_~a#1|) 256) 0) (or (and (<= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256) 127) (= |ULTIMATE.start_gcd_test_~a#1| (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256))) (and (= |ULTIMATE.start_gcd_test_~a#1| (+ (- 256) (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256))) (not (<= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256) 127)))))) (not (= |ULTIMATE.start_gcd_test_~a#1| 0)) (not (< |ULTIMATE.start_main1_~x~0#1| 0)))} gcd_test_#res#1 := gcd_test_~a#1; {702#(and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_#res#1|) 256) 0) (or (and (= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256) |ULTIMATE.start_gcd_test_#res#1|) (<= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256) 127)) (and (not (<= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256) 127)) (= |ULTIMATE.start_gcd_test_#res#1| (+ (- 256) (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256))))) (not (= |v_ULTIMATE.start_gcd_test_~a#1_13| 0)))) (not (< |ULTIMATE.start_main1_~x~0#1| 0)) (not (= |ULTIMATE.start_gcd_test_#res#1| 0)))} is VALID [2022-02-20 19:35:35,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {702#(and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |ULTIMATE.start_gcd_test_#res#1|) 256) 0) (or (and (= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256) |ULTIMATE.start_gcd_test_#res#1|) (<= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256) 127)) (and (not (<= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256) 127)) (= |ULTIMATE.start_gcd_test_#res#1| (+ (- 256) (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256))))) (not (= |v_ULTIMATE.start_gcd_test_~a#1_13| 0)))) (not (< |ULTIMATE.start_main1_~x~0#1| 0)) (not (= |ULTIMATE.start_gcd_test_#res#1| 0)))} main1_#t~ret7#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -128 <= main1_#t~ret7#1 && main1_#t~ret7#1 <= 127;main1_~g~0#1 := main1_#t~ret7#1;havoc main1_#t~ret7#1; {706#(and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (or (and (<= (+ 256 |ULTIMATE.start_main1_~g~0#1|) (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256)) (not (<= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256) 127)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| (+ (- 256) (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256))) 256) 0)) (and (not (= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256) 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256)) 256) 0) (<= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256) 127) (<= |ULTIMATE.start_main1_~g~0#1| (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256)))) (not (= |v_ULTIMATE.start_gcd_test_~a#1_13| 0)))) (not (< |ULTIMATE.start_main1_~x~0#1| 0)))} is VALID [2022-02-20 19:35:35,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {706#(and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (or (and (<= (+ 256 |ULTIMATE.start_main1_~g~0#1|) (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256)) (not (<= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256) 127)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| (+ (- 256) (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256))) 256) 0)) (and (not (= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256) 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256)) 256) 0) (<= (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256) 127) (<= |ULTIMATE.start_main1_~g~0#1| (mod (mod |ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256)))) (not (= |v_ULTIMATE.start_gcd_test_~a#1_13| 0)))) (not (< |ULTIMATE.start_main1_~x~0#1| 0)))} assume main1_~x~0#1 > 0;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main1_~x~0#1 >= main1_~g~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {710#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 19:35:35,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {710#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {669#false} is VALID [2022-02-20 19:35:35,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {669#false} assume !false; {669#false} is VALID [2022-02-20 19:35:35,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:35:35,110 INFO L328 TraceCheckSpWp]: Computing backward predicates...