./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_2+newton_3_5.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_2+newton_3_5.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 3c7e4faaabab9b2f322684d2701654a5044e8a4a6ec20b8d467b524bec442165 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:32:47,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:32:47,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:32:47,795 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:32:47,796 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:32:47,796 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:32:47,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:32:47,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:32:47,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:32:47,800 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:32:47,801 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:32:47,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:32:47,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:32:47,809 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:32:47,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:32:47,813 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:32:47,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:32:47,815 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:32:47,819 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:32:47,820 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:32:47,822 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:32:47,823 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:32:47,824 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:32:47,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:32:47,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:32:47,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:32:47,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:32:47,831 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:32:47,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:32:47,832 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:32:47,832 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:32:47,833 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:32:47,834 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:32:47,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:32:47,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:32:47,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:32:47,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:32:47,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:32:47,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:32:47,836 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:32:47,837 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:32:47,838 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:32:47,857 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:32:47,857 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:32:47,858 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:32:47,858 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:32:47,859 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:32:47,859 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:32:47,859 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:32:47,859 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:32:47,859 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:32:47,860 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:32:47,860 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:32:47,860 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:32:47,860 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:32:47,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:32:47,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:32:47,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:32:47,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:32:47,861 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:32:47,861 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:32:47,861 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:32:47,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:32:47,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:32:47,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:32:47,862 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:32:47,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:32:47,862 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:32:47,862 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:32:47,862 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:32:47,863 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:32:47,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:32:47,864 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:32:47,864 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:32:47,864 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:32:47,864 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 -> 3c7e4faaabab9b2f322684d2701654a5044e8a4a6ec20b8d467b524bec442165 [2022-02-20 19:32:48,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:32:48,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:32:48,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:32:48,060 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:32:48,061 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:32:48,061 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_2+newton_3_5.i [2022-02-20 19:32:48,126 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b60663bc3/cf9226d1927845ff81ec8d08d226e670/FLAGbfebd1f64 [2022-02-20 19:32:48,456 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:32:48,456 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_3_5.i [2022-02-20 19:32:48,460 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b60663bc3/cf9226d1927845ff81ec8d08d226e670/FLAGbfebd1f64 [2022-02-20 19:32:48,893 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b60663bc3/cf9226d1927845ff81ec8d08d226e670 [2022-02-20 19:32:48,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:32:48,899 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:32:48,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:32:48,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:32:48,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:32:48,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:32:48" (1/1) ... [2022-02-20 19:32:48,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22e81a7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:32:48, skipping insertion in model container [2022-02-20 19:32:48,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:32:48" (1/1) ... [2022-02-20 19:32:48,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:32:48,925 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:32:49,001 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_2+newton_3_5.i[1226,1239] [2022-02-20 19:32:49,019 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_2+newton_3_5.i[2862,2875] [2022-02-20 19:32:49,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:32:49,026 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:32:49,033 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_2+newton_3_5.i[1226,1239] [2022-02-20 19:32:49,042 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_2+newton_3_5.i[2862,2875] [2022-02-20 19:32:49,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:32:49,051 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:32:49,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:32:49 WrapperNode [2022-02-20 19:32:49,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:32:49,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:32:49,053 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:32:49,053 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:32:49,058 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:32:49" (1/1) ... [2022-02-20 19:32:49,063 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:32:49" (1/1) ... [2022-02-20 19:32:49,079 INFO L137 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 82 [2022-02-20 19:32:49,081 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:32:49,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:32:49,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:32:49,082 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:32:49,114 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:32:49" (1/1) ... [2022-02-20 19:32:49,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:32:49" (1/1) ... [2022-02-20 19:32:49,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:32:49" (1/1) ... [2022-02-20 19:32:49,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:32:49" (1/1) ... [2022-02-20 19:32:49,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:32:49" (1/1) ... [2022-02-20 19:32:49,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:32:49" (1/1) ... [2022-02-20 19:32:49,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:32:49" (1/1) ... [2022-02-20 19:32:49,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:32:49,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:32:49,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:32:49,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:32:49,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:32:49" (1/1) ... [2022-02-20 19:32:49,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:32:49,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:32:49,158 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:32:49,178 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:32:49,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:32:49,187 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-02-20 19:32:49,187 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-02-20 19:32:49,187 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-02-20 19:32:49,187 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-02-20 19:32:49,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:32:49,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:32:49,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:32:49,233 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:32:49,234 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:32:49,426 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:32:49,431 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:32:49,431 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 19:32:49,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:32:49 BoogieIcfgContainer [2022-02-20 19:32:49,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:32:49,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:32:49,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:32:49,436 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:32:49,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:32:48" (1/3) ... [2022-02-20 19:32:49,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5824eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:32:49, skipping insertion in model container [2022-02-20 19:32:49,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:32:49" (2/3) ... [2022-02-20 19:32:49,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5824eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:32:49, skipping insertion in model container [2022-02-20 19:32:49,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:32:49" (3/3) ... [2022-02-20 19:32:49,438 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_3_5.i [2022-02-20 19:32:49,441 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:32:49,441 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:32:49,468 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:32:49,473 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:32:49,473 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:32:49,485 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:32:49,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 19:32:49,489 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:32:49,489 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:32:49,489 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:32:49,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:32:49,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-02-20 19:32:49,499 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:32:49,499 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607205604] [2022-02-20 19:32:49,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:32:49,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:32:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:32:49,627 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:32:49,627 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:32:49,628 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_main1_~y~0#1| |ULTIMATE.start_gcd_test_~b#1|)} is VALID [2022-02-20 19:32:49,629 INFO L290 TraceCheckUtils]: 3: Hoare triple {45#(<= |ULTIMATE.start_main1_~y~0#1| |ULTIMATE.start_gcd_test_~b#1|)} 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); {45#(<= |ULTIMATE.start_main1_~y~0#1| |ULTIMATE.start_gcd_test_~b#1|)} is VALID [2022-02-20 19:32:49,630 INFO L290 TraceCheckUtils]: 4: Hoare triple {45#(<= |ULTIMATE.start_main1_~y~0#1| |ULTIMATE.start_gcd_test_~b#1|)} 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_~y~0#1| 1) 0)} is VALID [2022-02-20 19:32:49,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {46#(<= (+ |ULTIMATE.start_main1_~y~0#1| 1) 0)} assume !(0 != gcd_test_~b#1); {46#(<= (+ |ULTIMATE.start_main1_~y~0#1| 1) 0)} is VALID [2022-02-20 19:32:49,631 INFO L290 TraceCheckUtils]: 6: Hoare triple {46#(<= (+ |ULTIMATE.start_main1_~y~0#1| 1) 0)} gcd_test_#res#1 := gcd_test_~a#1; {46#(<= (+ |ULTIMATE.start_main1_~y~0#1| 1) 0)} is VALID [2022-02-20 19:32:49,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {46#(<= (+ |ULTIMATE.start_main1_~y~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_~y~0#1| 1) 0)} is VALID [2022-02-20 19:32:49,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {46#(<= (+ |ULTIMATE.start_main1_~y~0#1| 1) 0)} assume main1_~y~0#1 > 0;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main1_~y~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:32:49,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} assume 0 == __VERIFIER_assert_~cond#1; {44#false} is VALID [2022-02-20 19:32:49,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-02-20 19:32:49,633 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:32:49,634 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:32:49,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607205604] [2022-02-20 19:32:49,634 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607205604] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:32:49,635 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:32:49,635 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 19:32:49,636 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083955432] [2022-02-20 19:32:49,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:32:49,639 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:32:49,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:32:49,642 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:32:49,653 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:32:49,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:32:49,653 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:32:49,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:32:49,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:32:49,668 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:32:49,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:32:49,827 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2022-02-20 19:32:49,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:32:49,828 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:32:49,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:32:49,829 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:32:49,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2022-02-20 19:32:49,843 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:32:49,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2022-02-20 19:32:49,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 121 transitions. [2022-02-20 19:32:49,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:32:49,957 INFO L225 Difference]: With dead ends: 96 [2022-02-20 19:32:49,958 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 19:32:49,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:32:49,965 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 29 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:32:49,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 122 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:32:49,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 19:32:49,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2022-02-20 19:32:49,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:32:49,986 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:32:49,986 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:32:49,987 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:32:49,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:32:49,989 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-02-20 19:32:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-02-20 19:32:49,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:32:49,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:32:49,990 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:32:49,990 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:32:49,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:32:49,993 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-02-20 19:32:49,993 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-02-20 19:32:49,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:32:49,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:32:49,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:32:49,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:32:49,994 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:32:49,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-02-20 19:32:49,996 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2022-02-20 19:32:49,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:32:49,996 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-02-20 19:32:49,997 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:32:49,997 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-02-20 19:32:49,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 19:32:49,997 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:32:49,998 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:32:49,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:32:49,998 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:32:50,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:32:50,009 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2022-02-20 19:32:50,010 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:32:50,010 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32287225] [2022-02-20 19:32:50,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:32:50,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:32:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:32:50,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {295#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); {295#true} is VALID [2022-02-20 19:32:50,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#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; {295#true} is VALID [2022-02-20 19:32:50,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {295#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; {297#(<= |ULTIMATE.start_main1_~y~0#1| |ULTIMATE.start_gcd_test_~b#1|)} is VALID [2022-02-20 19:32:50,055 INFO L290 TraceCheckUtils]: 3: Hoare triple {297#(<= |ULTIMATE.start_main1_~y~0#1| |ULTIMATE.start_gcd_test_~b#1|)} 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); {297#(<= |ULTIMATE.start_main1_~y~0#1| |ULTIMATE.start_gcd_test_~b#1|)} is VALID [2022-02-20 19:32:50,055 INFO L290 TraceCheckUtils]: 4: Hoare triple {297#(<= |ULTIMATE.start_main1_~y~0#1| |ULTIMATE.start_gcd_test_~b#1|)} assume !(gcd_test_~b#1 < 0); {297#(<= |ULTIMATE.start_main1_~y~0#1| |ULTIMATE.start_gcd_test_~b#1|)} is VALID [2022-02-20 19:32:50,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {297#(<= |ULTIMATE.start_main1_~y~0#1| |ULTIMATE.start_gcd_test_~b#1|)} assume !(0 != gcd_test_~b#1); {298#(<= |ULTIMATE.start_main1_~y~0#1| 0)} is VALID [2022-02-20 19:32:50,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {298#(<= |ULTIMATE.start_main1_~y~0#1| 0)} gcd_test_#res#1 := gcd_test_~a#1; {298#(<= |ULTIMATE.start_main1_~y~0#1| 0)} is VALID [2022-02-20 19:32:50,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {298#(<= |ULTIMATE.start_main1_~y~0#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; {298#(<= |ULTIMATE.start_main1_~y~0#1| 0)} is VALID [2022-02-20 19:32:50,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {298#(<= |ULTIMATE.start_main1_~y~0#1| 0)} assume main1_~y~0#1 > 0;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main1_~y~0#1 >= main1_~g~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {296#false} is VALID [2022-02-20 19:32:50,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {296#false} assume 0 == __VERIFIER_assert_~cond#1; {296#false} is VALID [2022-02-20 19:32:50,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {296#false} assume !false; {296#false} is VALID [2022-02-20 19:32:50,058 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:32:50,058 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:32:50,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32287225] [2022-02-20 19:32:50,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32287225] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:32:50,059 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:32:50,059 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 19:32:50,059 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116776657] [2022-02-20 19:32:50,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:32:50,060 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:32:50,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:32:50,060 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:32:50,068 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:32:50,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:32:50,069 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:32:50,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:32:50,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:32:50,069 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. 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:32:50,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:32:50,145 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-02-20 19:32:50,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:32:50,145 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:32:50,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:32:50,146 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:32:50,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-02-20 19:32:50,147 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:32:50,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-02-20 19:32:50,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 44 transitions. [2022-02-20 19:32:50,179 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:32:50,180 INFO L225 Difference]: With dead ends: 39 [2022-02-20 19:32:50,180 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 19:32:50,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:32:50,181 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:32:50,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 97 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:32:50,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 19:32:50,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-20 19:32:50,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:32:50,185 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:32:50,185 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:32:50,185 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:32:50,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:32:50,187 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-02-20 19:32:50,187 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-02-20 19:32:50,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:32:50,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:32:50,188 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:32:50,188 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:32:50,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:32:50,189 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-02-20 19:32:50,190 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-02-20 19:32:50,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:32:50,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:32:50,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:32:50,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:32:50,191 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:32:50,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-02-20 19:32:50,192 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2022-02-20 19:32:50,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:32:50,193 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-02-20 19:32:50,193 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:32:50,193 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-02-20 19:32:50,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 19:32:50,193 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:32:50,193 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:32:50,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:32:50,194 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:32:50,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:32:50,194 INFO L85 PathProgramCache]: Analyzing trace with hash -659390950, now seen corresponding path program 1 times [2022-02-20 19:32:50,195 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:32:50,195 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15988565] [2022-02-20 19:32:50,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:32:50,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:32:50,217 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 19:32:50,218 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [476426127] [2022-02-20 19:32:50,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:32:50,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:32:50,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:32:50,219 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:32:50,224 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:32:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:32:50,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:32:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:32:50,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:32:50,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {460#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); {460#true} is VALID [2022-02-20 19:32:50,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#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; {460#true} is VALID [2022-02-20 19:32:50,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#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; {471#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:32:50,469 INFO L290 TraceCheckUtils]: 3: Hoare triple {471#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} 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); {471#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:32:50,470 INFO L290 TraceCheckUtils]: 4: Hoare triple {471#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} assume !(gcd_test_~b#1 < 0); {471#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:32:50,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {471#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} 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; {481#(<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:32:50,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {481#(<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} assume !(0 != gcd_test_~b#1); {481#(<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:32:50,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {481#(<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} gcd_test_#res#1 := gcd_test_~a#1; {488#(<= |ULTIMATE.start_gcd_test_#res#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:32:50,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {488#(<= |ULTIMATE.start_gcd_test_#res#1| |ULTIMATE.start_main1_~y~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; {492#(<= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:32:50,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {492#(<= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~y~0#1|)} assume main1_~y~0#1 > 0;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main1_~y~0#1 >= main1_~g~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {496#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 19:32:50,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {496#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {461#false} is VALID [2022-02-20 19:32:50,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {461#false} assume !false; {461#false} is VALID [2022-02-20 19:32:50,478 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:32:50,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:32:50,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {461#false} assume !false; {461#false} is VALID [2022-02-20 19:32:50,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {496#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {461#false} is VALID [2022-02-20 19:32:50,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {492#(<= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~y~0#1|)} assume main1_~y~0#1 > 0;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main1_~y~0#1 >= main1_~g~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {496#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 19:32:50,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {488#(<= |ULTIMATE.start_gcd_test_#res#1| |ULTIMATE.start_main1_~y~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; {492#(<= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:32:50,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {481#(<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} gcd_test_#res#1 := gcd_test_~a#1; {488#(<= |ULTIMATE.start_gcd_test_#res#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:32:50,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {481#(<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} assume !(0 != gcd_test_~b#1); {481#(<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:32:50,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {471#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} 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; {481#(<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:32:50,628 INFO L290 TraceCheckUtils]: 4: Hoare triple {471#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} assume !(gcd_test_~b#1 < 0); {471#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:32:50,629 INFO L290 TraceCheckUtils]: 3: Hoare triple {471#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} 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); {471#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:32:50,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#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; {471#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:32:50,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#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; {460#true} is VALID [2022-02-20 19:32:50,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {460#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); {460#true} is VALID [2022-02-20 19:32:50,630 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:32:50,630 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:32:50,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15988565] [2022-02-20 19:32:50,630 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 19:32:50,631 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476426127] [2022-02-20 19:32:50,631 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476426127] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:32:50,631 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 19:32:50,631 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-02-20 19:32:50,631 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965486922] [2022-02-20 19:32:50,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 19:32:50,632 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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 [2022-02-20 19:32:50,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:32:50,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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) [2022-02-20 19:32:50,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:32:50,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:32:50,641 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:32:50,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:32:50,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:32:50,642 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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) [2022-02-20 19:32:50,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:32:50,835 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-02-20 19:32:50,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:32:50,835 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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 [2022-02-20 19:32:50,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:32:50,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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) [2022-02-20 19:32:50,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-02-20 19:32:50,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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) [2022-02-20 19:32:50,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-02-20 19:32:50,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2022-02-20 19:32:50,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:32:50,876 INFO L225 Difference]: With dead ends: 40 [2022-02-20 19:32:50,876 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 19:32:50,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:32:50,877 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:32:50,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 183 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:32:50,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 19:32:50,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-20 19:32:50,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:32:50,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 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:32:50,881 INFO L74 IsIncluded]: Start isIncluded. First operand 34 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:32:50,881 INFO L87 Difference]: Start difference. First operand 34 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:32:50,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:32:50,882 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-02-20 19:32:50,883 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-02-20 19:32:50,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:32:50,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:32:50,883 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 34 states. [2022-02-20 19:32:50,884 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 34 states. [2022-02-20 19:32:50,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:32:50,885 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-02-20 19:32:50,885 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-02-20 19:32:50,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:32:50,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:32:50,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:32:50,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:32:50,886 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:32:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-02-20 19:32:50,887 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 12 [2022-02-20 19:32:50,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:32:50,888 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-02-20 19:32:50,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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) [2022-02-20 19:32:50,888 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-02-20 19:32:50,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 19:32:50,888 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:32:50,888 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:32:50,922 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:32:51,095 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:32:51,096 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:32:51,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:32:51,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1659957129, now seen corresponding path program 2 times [2022-02-20 19:32:51,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:32:51,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943429149] [2022-02-20 19:32:51,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:32:51,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:32:51,109 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 19:32:51,109 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [569211544] [2022-02-20 19:32:51,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 19:32:51,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:32:51,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:32:51,111 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:32:51,112 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:32:51,153 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 19:32:51,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 19:32:51,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 19:32:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:32:51,165 INFO L286 TraceCheckSpWp]: Computing forward predicates...