./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_3+newton_3_2.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_3_2.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 87554a4f39ea71934805d096a19f81b20cf82924707369622052a80438a85d9f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:34:40,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:34:40,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:34:40,108 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:34:40,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:34:40,112 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:34:40,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:34:40,119 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:34:40,121 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:34:40,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:34:40,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:34:40,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:34:40,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:34:40,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:34:40,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:34:40,133 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:34:40,136 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:34:40,137 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:34:40,138 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:34:40,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:34:40,144 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:34:40,145 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:34:40,146 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:34:40,147 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:34:40,151 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:34:40,151 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:34:40,151 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:34:40,153 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:34:40,153 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:34:40,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:34:40,155 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:34:40,155 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:34:40,157 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:34:40,158 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:34:40,159 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:34:40,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:34:40,160 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:34:40,160 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:34:40,160 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:34:40,161 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:34:40,161 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:34:40,162 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:40,194 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:34:40,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:34:40,197 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:34:40,197 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:34:40,198 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:34:40,198 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:34:40,199 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:34:40,199 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:34:40,199 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:34:40,199 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:34:40,200 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:34:40,201 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:34:40,201 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:34:40,201 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:34:40,201 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:34:40,201 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:34:40,201 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:34:40,202 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:34:40,202 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:34:40,202 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:34:40,202 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:34:40,202 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:34:40,203 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:34:40,203 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:34:40,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:34:40,203 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:34:40,203 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:34:40,205 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:34:40,205 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:34:40,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:34:40,205 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:34:40,206 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:34:40,206 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:34:40,206 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 -> 87554a4f39ea71934805d096a19f81b20cf82924707369622052a80438a85d9f [2022-02-20 19:34:40,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:34:40,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:34:40,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:34:40,482 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:34:40,483 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:34:40,483 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_3+newton_3_2.i [2022-02-20 19:34:40,552 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/324d026ba/b6e17a7f6e3344ab9affabfeb9f281ee/FLAGc5b8bd533 [2022-02-20 19:34:40,916 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:34:40,917 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_3_2.i [2022-02-20 19:34:40,927 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/324d026ba/b6e17a7f6e3344ab9affabfeb9f281ee/FLAGc5b8bd533 [2022-02-20 19:34:40,943 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/324d026ba/b6e17a7f6e3344ab9affabfeb9f281ee [2022-02-20 19:34:40,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:34:40,949 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:34:40,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:34:40,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:34:40,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:34:40,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:34:40" (1/1) ... [2022-02-20 19:34:40,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13263380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:34:40, skipping insertion in model container [2022-02-20 19:34:40,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:34:40" (1/1) ... [2022-02-20 19:34:40,961 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:34:40,980 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:34:41,132 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_3_2.i[1226,1239] [2022-02-20 19:34:41,158 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_3_2.i[2862,2875] [2022-02-20 19:34:41,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:34:41,166 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:34:41,176 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_3_2.i[1226,1239] [2022-02-20 19:34:41,188 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_3_2.i[2862,2875] [2022-02-20 19:34:41,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:34:41,201 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:34:41,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:34:41 WrapperNode [2022-02-20 19:34:41,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:34:41,203 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:34:41,203 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:34:41,203 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:34:41,208 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:41" (1/1) ... [2022-02-20 19:34:41,214 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:41" (1/1) ... [2022-02-20 19:34:41,236 INFO L137 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 82 [2022-02-20 19:34:41,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:34:41,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:34:41,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:34:41,237 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:34:41,243 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:41" (1/1) ... [2022-02-20 19:34:41,243 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:41" (1/1) ... [2022-02-20 19:34:41,245 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:41" (1/1) ... [2022-02-20 19:34:41,245 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:41" (1/1) ... [2022-02-20 19:34:41,249 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:41" (1/1) ... [2022-02-20 19:34:41,252 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:41" (1/1) ... [2022-02-20 19:34:41,253 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:41" (1/1) ... [2022-02-20 19:34:41,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:34:41,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:34:41,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:34:41,255 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:34:41,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:34:41" (1/1) ... [2022-02-20 19:34:41,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:34:41,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:34:41,279 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:41,284 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:41,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:34:41,307 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-02-20 19:34:41,307 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-02-20 19:34:41,307 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-02-20 19:34:41,307 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-02-20 19:34:41,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:34:41,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:34:41,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:34:41,359 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:34:41,361 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:34:41,639 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:34:41,645 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:34:41,645 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 19:34:41,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:34:41 BoogieIcfgContainer [2022-02-20 19:34:41,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:34:41,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:34:41,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:34:41,651 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:34:41,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:34:40" (1/3) ... [2022-02-20 19:34:41,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181f7b3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:34:41, skipping insertion in model container [2022-02-20 19:34:41,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:34:41" (2/3) ... [2022-02-20 19:34:41,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181f7b3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:34:41, skipping insertion in model container [2022-02-20 19:34:41,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:34:41" (3/3) ... [2022-02-20 19:34:41,654 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_3_2.i [2022-02-20 19:34:41,658 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:34:41,658 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:34:41,705 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:34:41,716 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:41,716 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:34:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:34:41,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 19:34:41,746 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:34:41,746 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:34:41,747 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:34:41,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:34:41,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-02-20 19:34:41,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:34:41,766 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225793989] [2022-02-20 19:34:41,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:34:41,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:34:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:34:42,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#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); {43#true} is VALID [2022-02-20 19:34:42,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~ret16#1, main_#t~ret17#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647; {43#true} is VALID [2022-02-20 19:34:42,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume 0 != main_#t~nondet15#1;havoc main_#t~nondet15#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; {45#(= (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) |ULTIMATE.start_main1_~x~0#1|) 0)} is VALID [2022-02-20 19:34:42,011 INFO L290 TraceCheckUtils]: 3: Hoare triple {45#(= (+ (* |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); {46#(<= (+ |ULTIMATE.start_main1_~x~0#1| 1) 0)} is VALID [2022-02-20 19:34:42,011 INFO L290 TraceCheckUtils]: 4: Hoare triple {46#(<= (+ |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); {46#(<= (+ |ULTIMATE.start_main1_~x~0#1| 1) 0)} is VALID [2022-02-20 19:34:42,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {46#(<= (+ |ULTIMATE.start_main1_~x~0#1| 1) 0)} assume !(0 != gcd_test_~b#1); {46#(<= (+ |ULTIMATE.start_main1_~x~0#1| 1) 0)} is VALID [2022-02-20 19:34:42,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {46#(<= (+ |ULTIMATE.start_main1_~x~0#1| 1) 0)} gcd_test_#res#1 := gcd_test_~a#1; {46#(<= (+ |ULTIMATE.start_main1_~x~0#1| 1) 0)} is VALID [2022-02-20 19:34:42,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {46#(<= (+ |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; {46#(<= (+ |ULTIMATE.start_main1_~x~0#1| 1) 0)} is VALID [2022-02-20 19:34:42,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {46#(<= (+ |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; {44#false} is VALID [2022-02-20 19:34:42,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} assume 0 == __VERIFIER_assert_~cond#1; {44#false} is VALID [2022-02-20 19:34:42,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-02-20 19:34:42,018 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:42,018 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:34:42,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225793989] [2022-02-20 19:34:42,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225793989] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:34:42,020 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:34:42,020 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 19:34:42,023 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579904228] [2022-02-20 19:34:42,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:34:42,028 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:42,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:34:42,031 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:42,049 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:42,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:34:42,051 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:34:42,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:34:42,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:34:42,075 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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:42,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:34:42,297 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2022-02-20 19:34:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:34:42,297 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:42,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:34:42,299 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:42,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2022-02-20 19:34:42,314 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:42,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2022-02-20 19:34:42,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 120 transitions. [2022-02-20 19:34:42,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:34:42,427 INFO L225 Difference]: With dead ends: 96 [2022-02-20 19:34:42,427 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 19:34:42,430 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:42,433 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 23 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 134 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:42,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 134 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:42,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 19:34:42,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2022-02-20 19:34:42,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:34:42,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:34:42,459 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:34:42,460 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:34:42,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:34:42,464 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-02-20 19:34:42,465 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-02-20 19:34:42,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:34:42,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:34:42,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 39 states. [2022-02-20 19:34:42,468 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 39 states. [2022-02-20 19:34:42,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:34:42,473 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-02-20 19:34:42,473 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-02-20 19:34:42,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:34:42,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:34:42,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:34:42,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:34:42,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:34:42,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-02-20 19:34:42,479 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2022-02-20 19:34:42,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:34:42,480 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-02-20 19:34:42,480 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:42,480 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-02-20 19:34:42,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 19:34:42,482 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:34:42,482 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:34:42,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:34:42,483 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:34:42,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:34:42,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1776235347, now seen corresponding path program 1 times [2022-02-20 19:34:42,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:34:42,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817459967] [2022-02-20 19:34:42,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:34:42,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:34:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:34:42,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {293#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); {293#true} is VALID [2022-02-20 19:34:42,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {293#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~ret16#1, main_#t~ret17#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647; {293#true} is VALID [2022-02-20 19:34:42,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {293#true} assume 0 != main_#t~nondet15#1;havoc main_#t~nondet15#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; {295#(= (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) |ULTIMATE.start_main1_~x~0#1|) 0)} is VALID [2022-02-20 19:34:42,562 INFO L290 TraceCheckUtils]: 3: Hoare triple {295#(= (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) |ULTIMATE.start_main1_~x~0#1|) 0)} assume !(gcd_test_~a#1 < 0); {295#(= (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) |ULTIMATE.start_main1_~x~0#1|) 0)} is VALID [2022-02-20 19:34:42,562 INFO L290 TraceCheckUtils]: 4: Hoare triple {295#(= (+ (* |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); {295#(= (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) |ULTIMATE.start_main1_~x~0#1|) 0)} is VALID [2022-02-20 19:34:42,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {295#(= (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) |ULTIMATE.start_main1_~x~0#1|) 0)} assume !(0 != gcd_test_~b#1); {295#(= (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) |ULTIMATE.start_main1_~x~0#1|) 0)} is VALID [2022-02-20 19:34:42,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {295#(= (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) |ULTIMATE.start_main1_~x~0#1|) 0)} gcd_test_#res#1 := gcd_test_~a#1; {296#(<= |ULTIMATE.start_gcd_test_#res#1| |ULTIMATE.start_main1_~x~0#1|)} is VALID [2022-02-20 19:34:42,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {296#(<= |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; {297#(<= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~x~0#1|)} is VALID [2022-02-20 19:34:42,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {297#(<= |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; {298#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 19:34:42,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {298#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {294#false} is VALID [2022-02-20 19:34:42,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {294#false} assume !false; {294#false} is VALID [2022-02-20 19:34:42,566 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:42,566 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:34:42,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817459967] [2022-02-20 19:34:42,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817459967] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:34:42,567 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:34:42,567 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:34:42,568 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081084556] [2022-02-20 19:34:42,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:34:42,569 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:42,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:34:42,569 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:42,579 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:42,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:34:42,580 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:34:42,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:34:42,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:34:42,581 INFO L87 Difference]: Start difference. First operand 32 states and 37 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:42,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:34:42,785 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-02-20 19:34:42,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:34:42,786 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:42,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:34:42,787 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:42,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-02-20 19:34:42,795 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:42,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-02-20 19:34:42,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-02-20 19:34:42,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:34:42,838 INFO L225 Difference]: With dead ends: 39 [2022-02-20 19:34:42,838 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 19:34:42,841 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:42,843 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 155 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:42,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 155 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:42,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 19:34:42,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-20 19:34:42,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:34:42,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:34:42,853 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:34:42,853 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:34:42,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:34:42,855 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-02-20 19:34:42,855 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-02-20 19:34:42,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:34:42,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:34:42,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-02-20 19:34:42,858 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-02-20 19:34:42,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:34:42,864 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-02-20 19:34:42,864 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-02-20 19:34:42,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:34:42,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:34:42,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:34:42,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:34:42,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:34:42,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-02-20 19:34:42,867 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2022-02-20 19:34:42,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:34:42,868 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-02-20 19:34:42,868 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:42,868 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-02-20 19:34:42,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 19:34:42,869 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:34:42,869 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:34:42,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:34:42,870 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:34:42,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:34:42,870 INFO L85 PathProgramCache]: Analyzing trace with hash 830014046, now seen corresponding path program 1 times [2022-02-20 19:34:42,870 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:34:42,871 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560069971] [2022-02-20 19:34:42,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:34:42,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:34:42,887 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 19:34:42,888 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [351507878] [2022-02-20 19:34:42,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:34:42,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:34:42,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:34:42,890 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:42,891 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:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:34:42,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 19:34:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:34:42,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:35:20,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {464#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); {464#true} is VALID [2022-02-20 19:35:20,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {464#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~ret16#1, main_#t~ret17#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647; {464#true} is VALID [2022-02-20 19:35:20,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {464#true} assume 0 != main_#t~nondet15#1;havoc main_#t~nondet15#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; {475#(= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|)} is VALID [2022-02-20 19:35:20,809 INFO L290 TraceCheckUtils]: 3: Hoare triple {475#(= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~x~0#1|)} assume !(gcd_test_~a#1 < 0); {479#(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:20,815 INFO L290 TraceCheckUtils]: 4: Hoare triple {479#(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); {483#(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:35:23,408 WARN L290 TraceCheckUtils]: 5: Hoare triple {483#(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; {487#(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 UNKNOWN [2022-02-20 19:35:23,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {487#(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); {491#(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:35:23,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {491#(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; {495#(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:35:23,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {495#(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; {499#(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:35:23,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {499#(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; {503#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 19:35:23,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {503#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {465#false} is VALID [2022-02-20 19:35:23,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {465#false} assume !false; {465#false} is VALID [2022-02-20 19:35:23,428 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:23,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:35:31,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {465#false} assume !false; {465#false} is VALID [2022-02-20 19:35:31,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {503#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {465#false} is VALID [2022-02-20 19:35:31,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {516#(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; {503#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 19:35:31,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {520#(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; {516#(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:31,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {524#(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; {520#(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:31,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {528#(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); {524#(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:31,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {532#(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; {528#(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:31,166 INFO L290 TraceCheckUtils]: 4: Hoare triple {536#(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); {532#(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 VALID [2022-02-20 19:35:31,167 INFO L290 TraceCheckUtils]: 3: Hoare triple {540#(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); {536#(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:31,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {464#true} assume 0 != main_#t~nondet15#1;havoc main_#t~nondet15#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; {540#(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:31,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {464#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~ret16#1, main_#t~ret17#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647; {464#true} is VALID [2022-02-20 19:35:31,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {464#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); {464#true} is VALID [2022-02-20 19:35:31,173 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:31,173 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:35:31,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560069971] [2022-02-20 19:35:31,173 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 19:35:31,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351507878] [2022-02-20 19:35:31,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351507878] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:35:31,174 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 19:35:31,174 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-02-20 19:35:31,174 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155554448] [2022-02-20 19:35:31,175 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 19:35:31,175 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:31,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:35:31,176 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:33,700 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:33,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-20 19:35:33,700 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:35:33,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-20 19:35:33,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=205, Unknown=13, NotChecked=0, Total=272 [2022-02-20 19:35:33,701 INFO L87 Difference]: Start difference. First operand 33 states and 38 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:37,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:35:37,309 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-02-20 19:35:37,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:35:37,309 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:37,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:35:37,309 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:37,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2022-02-20 19:35:37,311 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:37,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2022-02-20 19:35:37,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 51 transitions. [2022-02-20 19:35:40,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 50 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 19:35:40,098 INFO L225 Difference]: With dead ends: 45 [2022-02-20 19:35:40,098 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 19:35:40,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 43.5s TimeCoverageRelationStatistics Valid=74, Invalid=254, Unknown=14, NotChecked=0, Total=342 [2022-02-20 19:35:40,100 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:35:40,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 309 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 26 Unchecked, 0.0s Time] [2022-02-20 19:35:40,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 19:35:40,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2022-02-20 19:35:40,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:35:40,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:35:40,104 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:35:40,104 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:35:40,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:35:40,106 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-02-20 19:35:40,106 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-02-20 19:35:40,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:35:40,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:35:40,107 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-02-20 19:35:40,107 INFO L87 Difference]: Start difference. First operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-02-20 19:35:40,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:35:40,109 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-02-20 19:35:40,109 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-02-20 19:35:40,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:35:40,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:35:40,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:35:40,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:35:40,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:35:40,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-02-20 19:35:40,112 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 12 [2022-02-20 19:35:40,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:35:40,112 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-02-20 19:35:40,112 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:40,113 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-02-20 19:35:40,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 19:35:40,113 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:35:40,113 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:35:40,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 19:35:40,315 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:40,315 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:35:40,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:35:40,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1561924787, now seen corresponding path program 2 times [2022-02-20 19:35:40,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:35:40,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431258552] [2022-02-20 19:35:40,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:35:40,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:35:40,333 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 19:35:40,333 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [255588485] [2022-02-20 19:35:40,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 19:35:40,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:35:40,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:35:40,335 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:40,344 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:40,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 19:35:40,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 19:35:40,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 19:35:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:35:40,429 INFO L286 TraceCheckSpWp]: Computing forward predicates...