./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_1+newton_3_4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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_1+newton_3_4.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 605f47223f627b5d6ab9bc7372537ce49861197321d9038cf5b3c12fa8fcd03f --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 19:22:34,545 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 19:22:34,547 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 19:22:34,592 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 19:22:34,593 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 19:22:34,594 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 19:22:34,595 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 19:22:34,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 19:22:34,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 19:22:34,599 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 19:22:34,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 19:22:34,600 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 19:22:34,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 19:22:34,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 19:22:34,603 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 19:22:34,604 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 19:22:34,605 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 19:22:34,605 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 19:22:34,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 19:22:34,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 19:22:34,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 19:22:34,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 19:22:34,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 19:22:34,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 19:22:34,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 19:22:34,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 19:22:34,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 19:22:34,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 19:22:34,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 19:22:34,631 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 19:22:34,632 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 19:22:34,632 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 19:22:34,633 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 19:22:34,634 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 19:22:34,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 19:22:34,635 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 19:22:34,635 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 19:22:34,636 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 19:22:34,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 19:22:34,637 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 19:22:34,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 19:22:34,638 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 19:22:34,657 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 19:22:34,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 19:22:34,658 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 19:22:34,658 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 19:22:34,659 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 19:22:34,659 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 19:22:34,659 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 19:22:34,659 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 19:22:34,660 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 19:22:34,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 19:22:34,660 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 19:22:34,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 19:22:34,661 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 19:22:34,661 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 19:22:34,661 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 19:22:34,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 19:22:34,661 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 19:22:34,661 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 19:22:34,662 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 19:22:34,662 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 19:22:34,662 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 19:22:34,662 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 19:22:34,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 19:22:34,663 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 19:22:34,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 19:22:34,663 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 19:22:34,663 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 19:22:34,663 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 19:22:34,664 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 19:22:34,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 19:22:34,664 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 19:22:34,664 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 19:22:34,664 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 19:22:34,665 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 19:22:34,665 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 -> 605f47223f627b5d6ab9bc7372537ce49861197321d9038cf5b3c12fa8fcd03f [2021-12-17 19:22:34,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 19:22:34,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 19:22:34,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 19:22:34,895 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 19:22:34,896 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 19:22:34,897 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_1+newton_3_4.i [2021-12-17 19:22:34,966 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c1719a03/66b50ef9e5764db0aedb25e5f7f74226/FLAG779f91b31 [2021-12-17 19:22:35,357 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 19:22:35,360 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_1+newton_3_4.i [2021-12-17 19:22:35,371 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c1719a03/66b50ef9e5764db0aedb25e5f7f74226/FLAG779f91b31 [2021-12-17 19:22:35,772 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c1719a03/66b50ef9e5764db0aedb25e5f7f74226 [2021-12-17 19:22:35,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 19:22:35,775 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 19:22:35,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 19:22:35,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 19:22:35,782 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 19:22:35,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:22:35" (1/1) ... [2021-12-17 19:22:35,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11ffbee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:22:35, skipping insertion in model container [2021-12-17 19:22:35,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:22:35" (1/1) ... [2021-12-17 19:22:35,789 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 19:22:35,807 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 19:22:35,925 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_1+newton_3_4.i[1226,1239] [2021-12-17 19:22:35,948 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_1+newton_3_4.i[2828,2841] [2021-12-17 19:22:35,949 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 19:22:35,956 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 19:22:35,965 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_1+newton_3_4.i[1226,1239] [2021-12-17 19:22:35,977 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_1+newton_3_4.i[2828,2841] [2021-12-17 19:22:35,978 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 19:22:35,989 INFO L208 MainTranslator]: Completed translation [2021-12-17 19:22:35,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:22:35 WrapperNode [2021-12-17 19:22:35,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 19:22:35,991 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 19:22:35,991 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 19:22:35,991 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 19:22:35,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:22:35" (1/1) ... [2021-12-17 19:22:36,004 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:22:35" (1/1) ... [2021-12-17 19:22:36,022 INFO L137 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 82 [2021-12-17 19:22:36,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 19:22:36,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 19:22:36,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 19:22:36,023 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 19:22:36,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:22:35" (1/1) ... [2021-12-17 19:22:36,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:22:35" (1/1) ... [2021-12-17 19:22:36,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:22:35" (1/1) ... [2021-12-17 19:22:36,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:22:35" (1/1) ... [2021-12-17 19:22:36,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:22:35" (1/1) ... [2021-12-17 19:22:36,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:22:35" (1/1) ... [2021-12-17 19:22:36,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:22:35" (1/1) ... [2021-12-17 19:22:36,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 19:22:36,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 19:22:36,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 19:22:36,071 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 19:22:36,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:22:35" (1/1) ... [2021-12-17 19:22:36,078 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 19:22:36,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:22:36,096 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) [2021-12-17 19:22:36,098 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 [2021-12-17 19:22:36,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 19:22:36,130 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2021-12-17 19:22:36,130 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2021-12-17 19:22:36,130 INFO L130 BoogieDeclarations]: Found specification of procedure f [2021-12-17 19:22:36,132 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2021-12-17 19:22:36,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 19:22:36,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 19:22:36,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 19:22:36,199 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 19:22:36,200 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 19:22:36,348 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 19:22:36,353 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 19:22:36,353 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 19:22:36,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:22:36 BoogieIcfgContainer [2021-12-17 19:22:36,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 19:22:36,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 19:22:36,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 19:22:36,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 19:22:36,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 07:22:35" (1/3) ... [2021-12-17 19:22:36,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753ac5e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:22:36, skipping insertion in model container [2021-12-17 19:22:36,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:22:35" (2/3) ... [2021-12-17 19:22:36,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753ac5e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:22:36, skipping insertion in model container [2021-12-17 19:22:36,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:22:36" (3/3) ... [2021-12-17 19:22:36,375 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd_1+newton_3_4.i [2021-12-17 19:22:36,380 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 19:22:36,380 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-17 19:22:36,434 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 19:22:36,443 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 [2021-12-17 19:22:36,444 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-17 19:22:36,468 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) [2021-12-17 19:22:36,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 19:22:36,471 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:22:36,472 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 19:22:36,472 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:22:36,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:22:36,477 INFO L85 PathProgramCache]: Analyzing trace with hash -247750664, now seen corresponding path program 1 times [2021-12-17 19:22:36,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:22:36,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837653039] [2021-12-17 19:22:36,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:22:36,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:22:36,551 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 19:22:36,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [314834993] [2021-12-17 19:22:36,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:22:36,552 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:22:36,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:22:36,554 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) [2021-12-17 19:22:36,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 19:22:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:22:36,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-17 19:22:36,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:22:36,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 19:22:36,651 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 19:22:36,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:22:36,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837653039] [2021-12-17 19:22:36,651 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 19:22:36,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314834993] [2021-12-17 19:22:36,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314834993] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 19:22:36,652 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 19:22:36,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 19:22:36,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321893173] [2021-12-17 19:22:36,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 19:22:36,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 19:22:36,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:22:36,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 19:22:36,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 19:22:36,691 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 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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) [2021-12-17 19:22:36,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:22:36,705 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2021-12-17 19:22:36,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 19:22:36,707 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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 [2021-12-17 19:22:36,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:22:36,712 INFO L225 Difference]: With dead ends: 72 [2021-12-17 19:22:36,712 INFO L226 Difference]: Without dead ends: 32 [2021-12-17 19:22:36,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 19:22:36,717 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 19:22:36,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 19:22:36,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-17 19:22:36,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-12-17 19:22:36,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 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) [2021-12-17 19:22:36,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2021-12-17 19:22:36,748 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 11 [2021-12-17 19:22:36,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:22:36,749 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2021-12-17 19:22:36,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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) [2021-12-17 19:22:36,749 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2021-12-17 19:22:36,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 19:22:36,750 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:22:36,750 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 19:22:36,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-17 19:22:36,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2021-12-17 19:22:36,960 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:22:36,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:22:36,961 INFO L85 PathProgramCache]: Analyzing trace with hash -251444748, now seen corresponding path program 1 times [2021-12-17 19:22:36,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:22:36,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823997646] [2021-12-17 19:22:36,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:22:36,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:22:36,976 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 19:22:36,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [369449722] [2021-12-17 19:22:36,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:22:36,979 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:22:36,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:22:36,980 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) [2021-12-17 19:22:36,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 19:22:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:22:37,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-17 19:22:37,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:22:37,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 19:22:37,073 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 19:22:37,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:22:37,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823997646] [2021-12-17 19:22:37,074 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 19:22:37,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369449722] [2021-12-17 19:22:37,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369449722] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 19:22:37,074 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 19:22:37,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 19:22:37,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548352679] [2021-12-17 19:22:37,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 19:22:37,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 19:22:37,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:22:37,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 19:22:37,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 19:22:37,077 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2021-12-17 19:22:37,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:22:37,089 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2021-12-17 19:22:37,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 19:22:37,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 [2021-12-17 19:22:37,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:22:37,090 INFO L225 Difference]: With dead ends: 39 [2021-12-17 19:22:37,090 INFO L226 Difference]: Without dead ends: 33 [2021-12-17 19:22:37,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 19:22:37,092 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 19:22:37,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 19:22:37,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-17 19:22:37,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-12-17 19:22:37,098 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) [2021-12-17 19:22:37,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2021-12-17 19:22:37,099 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2021-12-17 19:22:37,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:22:37,099 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2021-12-17 19:22:37,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2021-12-17 19:22:37,100 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2021-12-17 19:22:37,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-17 19:22:37,101 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:22:37,101 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 19:22:37,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 19:22:37,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-12-17 19:22:37,316 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:22:37,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:22:37,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1673157840, now seen corresponding path program 1 times [2021-12-17 19:22:37,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:22:37,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370316301] [2021-12-17 19:22:37,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:22:37,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:22:37,326 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 19:22:37,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1935182917] [2021-12-17 19:22:37,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:22:37,329 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:22:37,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:22:37,330 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 19:22:37,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 19:22:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:22:37,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-17 19:22:37,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:22:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 19:22:37,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 19:22:37,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 19:22:37,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:22:37,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370316301] [2021-12-17 19:22:37,513 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 19:22:37,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935182917] [2021-12-17 19:22:37,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935182917] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 19:22:37,514 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 19:22:37,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2021-12-17 19:22:37,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102628607] [2021-12-17 19:22:37,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 19:22:37,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 19:22:37,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:22:37,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 19:22:37,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 19:22:37,516 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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) [2021-12-17 19:22:37,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:22:37,587 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2021-12-17 19:22:37,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 19:22:37,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 [2021-12-17 19:22:37,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:22:37,589 INFO L225 Difference]: With dead ends: 39 [2021-12-17 19:22:37,590 INFO L226 Difference]: Without dead ends: 34 [2021-12-17 19:22:37,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-17 19:22:37,594 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 19:22:37,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 153 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 19:22:37,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-17 19:22:37,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-12-17 19:22:37,613 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) [2021-12-17 19:22:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2021-12-17 19:22:37,614 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 12 [2021-12-17 19:22:37,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:22:37,616 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2021-12-17 19:22:37,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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) [2021-12-17 19:22:37,618 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2021-12-17 19:22:37,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-17 19:22:37,620 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:22:37,620 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 19:22:37,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 19:22:37,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:22:37,836 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:22:37,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:22:37,836 INFO L85 PathProgramCache]: Analyzing trace with hash -276630798, now seen corresponding path program 2 times [2021-12-17 19:22:37,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:22:37,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312471155] [2021-12-17 19:22:37,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:22:37,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:22:37,850 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 19:22:37,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [301904732] [2021-12-17 19:22:37,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 19:22:37,854 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:22:37,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:22:37,855 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 19:22:37,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 19:22:42,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 19:22:42,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 19:22:42,766 WARN L261 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-17 19:22:42,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:23:41,727 WARN L838 $PredicateComparison]: unable to prove that (and (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod (mod (* |v_ULTIMATE.start_gcd_test_~a#1_12| 255) 256) |c_ULTIMATE.start_main1_~y~0#1|) 256)) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_12| 128)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_main1_~y~0#1|)))) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) is different from false [2021-12-17 19:23:53,976 WARN L838 $PredicateComparison]: unable to prove that (and (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (= 0 (mod (mod |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod (mod (* |v_ULTIMATE.start_gcd_test_~a#1_12| 255) 256) |c_ULTIMATE.start_main1_~y~0#1|) 256)) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_12| 128)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_main1_~y~0#1|)))) (not (= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) is different from false [2021-12-17 19:24:14,557 WARN L838 $PredicateComparison]: unable to prove that (and (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse0 (mod (mod (mod (* |v_ULTIMATE.start_gcd_test_~a#1_12| 255) 256) |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (not (= 0 .cse0)) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_12| 128)) (= 0 (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse0) 256)) (= |c_ULTIMATE.start_gcd_test_#res#1| .cse0) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_main1_~y~0#1|)))))) is different from false [2021-12-17 19:24:56,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-17 19:24:56,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 19:27:13,417 WARN L227 SmtUtils]: Spent 1.72m on a formula simplification. DAG size of input: 92 DAG size of output: 88 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 19:27:34,519 WARN L227 SmtUtils]: Spent 15.31s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 19:28:00,620 WARN L860 $PredicateComparison]: unable to prove that (or (let ((.cse1 (mod (* |c_ULTIMATE.start_main1_~x~0#1| 255) 256))) (and (let ((.cse0 (mod (mod .cse1 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (not (= 0 (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse0) 256))) (< 127 .cse1) (= 0 .cse0))) (let ((.cse2 (mod (+ .cse1 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (<= .cse1 127) (not (= 0 (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (mod (+ (* |c_ULTIMATE.start_main1_~y~0#1| 255) .cse2) 256) (- 256))) 256))) (= 0 .cse2))))) (<= |c_ULTIMATE.start_main1_~y~0#1| 0) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|) (not (= 0 (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|)))) is different from true [2021-12-17 19:28:58,579 WARN L227 SmtUtils]: Spent 5.04s on a formula simplification. DAG size of input: 7 DAG size of output: 1 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 19:29:30,107 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main1_~y~0#1_6| Int) (|v_ULTIMATE.start_main1_~x~0#1_5| Int)) (let ((.cse1 (mod (* |v_ULTIMATE.start_main1_~x~0#1_5| 255) 256))) (let ((.cse0 (mod (mod .cse1 |v_ULTIMATE.start_main1_~y~0#1_6|) 256))) (or (<= |v_ULTIMATE.start_main1_~y~0#1_6| 0) (< (+ |v_ULTIMATE.start_main1_~x~0#1_5| 128) 0) (not (= 0 (mod (mod |v_ULTIMATE.start_main1_~y~0#1_6| .cse0) 256))) (<= 0 |v_ULTIMATE.start_main1_~x~0#1_5|) (= 0 .cse0) (< 127 .cse1) (not (= 0 (mod |v_ULTIMATE.start_main1_~x~0#1_5| |v_ULTIMATE.start_main1_~y~0#1_6|))))))) is different from false [2021-12-17 19:29:32,110 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main1_~y~0#1_6| Int) (|v_ULTIMATE.start_main1_~x~0#1_5| Int)) (let ((.cse1 (mod (* |v_ULTIMATE.start_main1_~x~0#1_5| 255) 256))) (let ((.cse0 (mod (mod .cse1 |v_ULTIMATE.start_main1_~y~0#1_6|) 256))) (or (<= |v_ULTIMATE.start_main1_~y~0#1_6| 0) (< (+ |v_ULTIMATE.start_main1_~x~0#1_5| 128) 0) (not (= 0 (mod (mod |v_ULTIMATE.start_main1_~y~0#1_6| .cse0) 256))) (<= 0 |v_ULTIMATE.start_main1_~x~0#1_5|) (= 0 .cse0) (< 127 .cse1) (not (= 0 (mod |v_ULTIMATE.start_main1_~x~0#1_5| |v_ULTIMATE.start_main1_~y~0#1_6|))))))) is different from true [2021-12-17 19:30:24,088 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main1_~y~0#1_6| Int) (|v_ULTIMATE.start_main1_~x~0#1_5| Int)) (let ((.cse0 (mod (mod (mod (* |v_ULTIMATE.start_main1_~x~0#1_5| 255) 256) |v_ULTIMATE.start_main1_~y~0#1_6|) 256))) (or (<= |v_ULTIMATE.start_main1_~y~0#1_6| 0) (< (+ |v_ULTIMATE.start_main1_~x~0#1_5| 128) 0) (not (= 0 (mod (mod |v_ULTIMATE.start_main1_~y~0#1_6| .cse0) 256))) (<= 0 |v_ULTIMATE.start_main1_~x~0#1_5|) (= 0 .cse0) (not (= 0 (mod |v_ULTIMATE.start_main1_~x~0#1_5| |v_ULTIMATE.start_main1_~y~0#1_6|)))))) is different from false [2021-12-17 19:30:26,092 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main1_~y~0#1_6| Int) (|v_ULTIMATE.start_main1_~x~0#1_5| Int)) (let ((.cse0 (mod (mod (mod (* |v_ULTIMATE.start_main1_~x~0#1_5| 255) 256) |v_ULTIMATE.start_main1_~y~0#1_6|) 256))) (or (<= |v_ULTIMATE.start_main1_~y~0#1_6| 0) (< (+ |v_ULTIMATE.start_main1_~x~0#1_5| 128) 0) (not (= 0 (mod (mod |v_ULTIMATE.start_main1_~y~0#1_6| .cse0) 256))) (<= 0 |v_ULTIMATE.start_main1_~x~0#1_5|) (= 0 .cse0) (not (= 0 (mod |v_ULTIMATE.start_main1_~x~0#1_5| |v_ULTIMATE.start_main1_~y~0#1_6|)))))) is different from true [2021-12-17 19:30:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 19:30:26,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:30:26,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312471155] [2021-12-17 19:30:26,093 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 19:30:26,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301904732] [2021-12-17 19:30:26,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301904732] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 19:30:26,093 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 19:30:26,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 20 [2021-12-17 19:30:26,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89401018] [2021-12-17 19:30:26,093 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 19:30:26,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-17 19:30:26,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:30:26,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-17 19:30:26,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=143, Unknown=15, NotChecked=174, Total=380 [2021-12-17 19:30:26,095 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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) [2021-12-17 19:31:24,747 WARN L227 SmtUtils]: Spent 48.32s on a formula simplification. DAG size of input: 44 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 19:33:12,710 WARN L227 SmtUtils]: Spent 1.56m on a formula simplification. DAG size of input: 140 DAG size of output: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 19:33:14,298 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 19:33:16,304 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 19:33:18,311 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 19:33:20,485 WARN L838 $PredicateComparison]: unable to prove that (and (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 (+ |c_ULTIMATE.start_main1_~x~0#1| 128)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (or (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (let ((.cse2 (+ |c_ULTIMATE.start_main1_~y~0#1| 256)) (.cse0 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (and (or (= 0 .cse0) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (let ((.cse1 (mod (+ (* |c_ULTIMATE.start_gcd_test_~b#1| 255) .cse0) 256))) (and (or (= .cse1 .cse2) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse1 (- 256))) 256))) (<= .cse1 127)) (or (= 0 .cse1) (= .cse1 |c_ULTIMATE.start_main1_~y~0#1|) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse1) 256))) (< 127 .cse1))))) (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (let ((.cse3 (mod .cse0 256))) (and (or (< 127 .cse3) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse3) 256))) (= 0 .cse3) (= .cse3 |c_ULTIMATE.start_main1_~y~0#1|)) (or (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse3 (- 256))) 256))) (<= .cse3 127) (= .cse3 .cse2)))))))) (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (= |c_ULTIMATE.start_gcd_test_~b#1| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (let ((.cse4 (mod (* |v_ULTIMATE.start_gcd_test_~a#1_12| 255) 256))) (or (and (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse4) (< 127 .cse4)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| .cse4) (<= .cse4 127)))) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_12| 128)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_main1_~y~0#1|))))) is different from false [2021-12-17 19:33:22,585 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse8 (mod .cse10 256))) (let ((.cse6 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse7 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse3 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse1 (+ |c_ULTIMATE.start_main1_~y~0#1| 256)) (.cse9 (= 0 .cse8))) (and (or (let ((.cse4 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (and (let ((.cse2 (mod (+ .cse4 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (let ((.cse0 (mod (+ .cse2 .cse3) 256))) (and (or (= 0 .cse0) (< 127 .cse0) (= .cse0 |c_ULTIMATE.start_main1_~y~0#1|)) (or (= .cse0 .cse1) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse0 (- 256))) 256))) (<= .cse0 127)))) (= 0 .cse2) (<= .cse4 127))) (or (< 127 .cse4) (let ((.cse5 (mod (mod .cse4 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (and (or (< 127 .cse5) (= 0 .cse5) (= .cse5 |c_ULTIMATE.start_main1_~y~0#1|) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse5) 256)))) (or (<= .cse5 127) (= .cse5 .cse1))))))) .cse6 .cse7) (<= 0 (+ |c_ULTIMATE.start_main1_~x~0#1| 128)) (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (and (or (< 127 .cse8) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse8) 256))) .cse9 (= .cse8 |c_ULTIMATE.start_main1_~y~0#1|)) (or (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse8 (- 256))) 256))) (<= .cse8 127) (= .cse8 .cse1)))) (or (= 0 .cse10) .cse6 (let ((.cse18 (<= 0 |c_ULTIMATE.start_gcd_test_~b#1|)) (.cse19 (mod (+ |c_ULTIMATE.start_gcd_test_~b#1| .cse10) 256))) (let ((.cse13 (or .cse18 (= .cse19 |c_ULTIMATE.start_main1_~y~0#1|) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19) 256))) (= 0 .cse19))) (.cse11 (< 127 .cse19)) (.cse14 (<= .cse19 127)) (.cse15 (or .cse18 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse19 (- 256))) 256))) (= .cse19 .cse1))) (.cse16 (mod (+ .cse3 .cse10) 256))) (and (or (let ((.cse12 (or (= .cse16 .cse1) .cse7 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse16 (- 256))) 256)))))) (and (or .cse11 (and .cse12 .cse13)) (or .cse14 (and .cse15 .cse12)))) (<= .cse16 127)) (or (let ((.cse17 (or (= 0 .cse16) (= .cse16 |c_ULTIMATE.start_main1_~y~0#1|) .cse7 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse16) 256)))))) (and (or (and .cse17 .cse13) .cse11) (or .cse14 (and .cse15 .cse17)))) (< 127 .cse16)))))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (or (= 0 |c_ULTIMATE.start_gcd_test_~b#1|) (= |c_ULTIMATE.start_gcd_test_~b#1| |c_ULTIMATE.start_main1_~y~0#1|) (< (+ |c_ULTIMATE.start_gcd_test_~b#1| 128) 0) (not .cse9) (< 127 |c_ULTIMATE.start_gcd_test_~b#1|)))))) is different from false [2021-12-17 19:33:24,592 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse10 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse8 (mod .cse10 256))) (let ((.cse6 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse7 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse3 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse1 (+ |c_ULTIMATE.start_main1_~y~0#1| 256)) (.cse9 (= 0 .cse8))) (and (or (let ((.cse4 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (and (let ((.cse2 (mod (+ .cse4 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (let ((.cse0 (mod (+ .cse2 .cse3) 256))) (and (or (= 0 .cse0) (< 127 .cse0) (= .cse0 |c_ULTIMATE.start_main1_~y~0#1|)) (or (= .cse0 .cse1) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse0 (- 256))) 256))) (<= .cse0 127)))) (= 0 .cse2) (<= .cse4 127))) (or (< 127 .cse4) (let ((.cse5 (mod (mod .cse4 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (and (or (< 127 .cse5) (= 0 .cse5) (= .cse5 |c_ULTIMATE.start_main1_~y~0#1|) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse5) 256)))) (or (<= .cse5 127) (= .cse5 .cse1))))))) .cse6 .cse7) (<= 0 (+ |c_ULTIMATE.start_main1_~x~0#1| 128)) (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (and (or (< 127 .cse8) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse8) 256))) .cse9 (= .cse8 |c_ULTIMATE.start_main1_~y~0#1|)) (or (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse8 (- 256))) 256))) (<= .cse8 127) (= .cse8 .cse1)))) (or (= 0 .cse10) .cse6 (let ((.cse18 (<= 0 |c_ULTIMATE.start_gcd_test_~b#1|)) (.cse19 (mod (+ |c_ULTIMATE.start_gcd_test_~b#1| .cse10) 256))) (let ((.cse13 (or .cse18 (= .cse19 |c_ULTIMATE.start_main1_~y~0#1|) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19) 256))) (= 0 .cse19))) (.cse11 (< 127 .cse19)) (.cse14 (<= .cse19 127)) (.cse15 (or .cse18 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse19 (- 256))) 256))) (= .cse19 .cse1))) (.cse16 (mod (+ .cse3 .cse10) 256))) (and (or (let ((.cse12 (or (= .cse16 .cse1) .cse7 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse16 (- 256))) 256)))))) (and (or .cse11 (and .cse12 .cse13)) (or .cse14 (and .cse15 .cse12)))) (<= .cse16 127)) (or (let ((.cse17 (or (= 0 .cse16) (= .cse16 |c_ULTIMATE.start_main1_~y~0#1|) .cse7 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse16) 256)))))) (and (or (and .cse17 .cse13) .cse11) (or .cse14 (and .cse15 .cse17)))) (< 127 .cse16)))))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (or (= 0 |c_ULTIMATE.start_gcd_test_~b#1|) (= |c_ULTIMATE.start_gcd_test_~b#1| |c_ULTIMATE.start_main1_~y~0#1|) (< (+ |c_ULTIMATE.start_gcd_test_~b#1| 128) 0) (not .cse9) (< 127 |c_ULTIMATE.start_gcd_test_~b#1|)))))) is different from true [2021-12-17 19:33:26,597 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main1_~y~0#1| 256)) (.cse2 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (and (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (let ((.cse0 (mod .cse2 256))) (and (or (< 127 .cse0) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse0) 256))) (= 0 .cse0) (= .cse0 |c_ULTIMATE.start_main1_~y~0#1|)) (or (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse0 (- 256))) 256))) (<= .cse0 127) (= .cse0 .cse1))))) (or (= 0 .cse2) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (let ((.cse11 (<= 0 |c_ULTIMATE.start_gcd_test_~b#1|)) (.cse12 (mod (+ |c_ULTIMATE.start_gcd_test_~b#1| .cse2) 256))) (let ((.cse5 (or .cse11 (= .cse12 |c_ULTIMATE.start_main1_~y~0#1|) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse12) 256))) (= 0 .cse12))) (.cse3 (< 127 .cse12)) (.cse6 (<= .cse12 127)) (.cse7 (or .cse11 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse12 (- 256))) 256))) (= .cse12 .cse1))) (.cse9 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse8 (mod (+ (* |c_ULTIMATE.start_gcd_test_~b#1| 255) .cse2) 256))) (and (or (let ((.cse4 (or (= .cse8 .cse1) .cse9 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse8 (- 256))) 256)))))) (and (or .cse3 (and .cse4 .cse5)) (or .cse6 (and .cse7 .cse4)))) (<= .cse8 127)) (or (let ((.cse10 (or (= 0 .cse8) (= .cse8 |c_ULTIMATE.start_main1_~y~0#1|) .cse9 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse8) 256)))))) (and (or (and .cse10 .cse5) .cse3) (or .cse6 (and .cse7 .cse10)))) (< 127 .cse8)))))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (= |c_ULTIMATE.start_gcd_test_~b#1| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (let ((.cse13 (mod (* |v_ULTIMATE.start_gcd_test_~a#1_12| 255) 256))) (or (and (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse13) (< 127 .cse13)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| .cse13) (<= .cse13 127)))) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_12| 128)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_main1_~y~0#1|)))))) is different from false [2021-12-17 19:34:08,612 WARN L227 SmtUtils]: Spent 34.51s on a formula simplification. DAG size of input: 43 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 19:34:10,823 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 19:34:12,831 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 19:34:16,061 WARN L838 $PredicateComparison]: unable to prove that (and (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (or (= |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_main1_~y~0#1|) (< 127 |c_ULTIMATE.start_gcd_test_~a#1|) (not (= 0 |c_ULTIMATE.start_gcd_test_~b#1|)) (< (+ |c_ULTIMATE.start_gcd_test_~a#1| 128) 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod (mod (* |v_ULTIMATE.start_gcd_test_~a#1_12| 255) 256) |c_ULTIMATE.start_main1_~y~0#1|) 256)) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_12| 128)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_main1_~y~0#1|)))) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) is different from false [2021-12-17 19:34:18,069 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 19:34:19,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:34:19,990 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2021-12-17 19:34:19,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 19:34:19,991 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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 13 [2021-12-17 19:34:19,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:34:19,992 INFO L225 Difference]: With dead ends: 47 [2021-12-17 19:34:19,992 INFO L226 Difference]: Without dead ends: 39 [2021-12-17 19:34:19,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 382.7s TimeCoverageRelationStatistics Valid=97, Invalid=294, Unknown=29, NotChecked=450, Total=870 [2021-12-17 19:34:19,993 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2021-12-17 19:34:19,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 303 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 5 Unknown, 142 Unchecked, 14.4s Time] [2021-12-17 19:34:19,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-12-17 19:34:19,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2021-12-17 19:34:19,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 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) [2021-12-17 19:34:19,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2021-12-17 19:34:19,999 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 13 [2021-12-17 19:34:20,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:34:20,000 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2021-12-17 19:34:20,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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) [2021-12-17 19:34:20,000 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2021-12-17 19:34:20,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-17 19:34:20,001 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:34:20,001 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 19:34:20,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 19:34:20,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:34:20,201 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:34:20,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:34:20,202 INFO L85 PathProgramCache]: Analyzing trace with hash 66034544, now seen corresponding path program 3 times [2021-12-17 19:34:20,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:34:20,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166538587] [2021-12-17 19:34:20,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:34:20,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:34:20,210 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 19:34:20,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2068329936] [2021-12-17 19:34:20,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 19:34:20,210 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:34:20,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:34:20,211 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 19:34:20,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 19:34:22,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-17 19:34:22,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 19:34:22,620 WARN L261 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-17 19:34:22,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:35:18,440 WARN L227 SmtUtils]: Spent 5.74s on a formula simplification. DAG size of input: 7 DAG size of output: 1 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 19:36:55,111 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (and (< |v_ULTIMATE.start_gcd_test_~a#1_19| 0) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_19| 128)) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |v_ULTIMATE.start_gcd_test_~a#1_21|)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod (mod (* |v_ULTIMATE.start_gcd_test_~a#1_19| 255) 256) |v_ULTIMATE.start_gcd_test_~a#1_21|) 256)) (< 0 |v_ULTIMATE.start_gcd_test_~a#1_21|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~a#1|) 256)))) (not (= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) is different from false Killed by 15