./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_3+newton_3_6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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_3+newton_3_6.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cefb3bae89bbacb2fe493d14201bba1802fb381afd861fd412b13151077489a8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 20:08:01,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 20:08:01,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 20:08:01,439 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 20:08:01,439 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 20:08:01,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 20:08:01,443 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 20:08:01,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 20:08:01,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 20:08:01,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 20:08:01,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 20:08:01,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 20:08:01,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 20:08:01,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 20:08:01,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 20:08:01,461 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 20:08:01,462 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 20:08:01,463 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 20:08:01,465 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 20:08:01,470 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 20:08:01,472 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 20:08:01,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 20:08:01,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 20:08:01,474 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 20:08:01,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 20:08:01,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 20:08:01,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 20:08:01,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 20:08:01,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 20:08:01,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 20:08:01,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 20:08:01,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 20:08:01,494 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 20:08:01,495 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 20:08:01,496 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 20:08:01,497 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 20:08:01,498 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 20:08:01,498 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 20:08:01,498 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 20:08:01,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 20:08:01,499 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 20:08:01,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 20:08:01,502 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 20:08:01,534 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 20:08:01,535 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 20:08:01,535 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 20:08:01,536 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 20:08:01,536 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 20:08:01,537 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 20:08:01,537 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 20:08:01,537 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 20:08:01,538 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 20:08:01,538 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 20:08:01,539 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 20:08:01,539 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 20:08:01,539 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 20:08:01,539 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 20:08:01,540 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 20:08:01,540 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 20:08:01,540 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 20:08:01,540 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 20:08:01,541 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 20:08:01,542 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 20:08:01,542 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 20:08:01,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 20:08:01,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 20:08:01,543 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 20:08:01,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 20:08:01,546 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 20:08:01,546 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 20:08:01,546 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 20:08:01,547 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 20:08:01,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 20:08:01,547 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 20:08:01,547 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 20:08:01,547 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 20:08:01,548 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 -> cefb3bae89bbacb2fe493d14201bba1802fb381afd861fd412b13151077489a8 [2022-07-22 20:08:01,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 20:08:01,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 20:08:01,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 20:08:01,834 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 20:08:01,835 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 20:08:01,836 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_3+newton_3_6.i [2022-07-22 20:08:01,902 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/299e70cd7/a71ed58c03cd473fb218bc3dfc72d20a/FLAG0216fea66 [2022-07-22 20:08:02,366 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 20:08:02,369 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_3_6.i [2022-07-22 20:08:02,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/299e70cd7/a71ed58c03cd473fb218bc3dfc72d20a/FLAG0216fea66 [2022-07-22 20:08:02,750 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/299e70cd7/a71ed58c03cd473fb218bc3dfc72d20a [2022-07-22 20:08:02,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 20:08:02,753 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 20:08:02,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 20:08:02,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 20:08:02,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 20:08:02,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 08:08:02" (1/1) ... [2022-07-22 20:08:02,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b446ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:08:02, skipping insertion in model container [2022-07-22 20:08:02,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 08:08:02" (1/1) ... [2022-07-22 20:08:02,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 20:08:02,787 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 20:08:02,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_3_6.i[1226,1239] [2022-07-22 20:08:02,923 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_3_6.i[2862,2875] [2022-07-22 20:08:02,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 20:08:02,930 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 20:08:02,940 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_3_6.i[1226,1239] [2022-07-22 20:08:02,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_3_6.i[2862,2875] [2022-07-22 20:08:02,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 20:08:02,961 INFO L208 MainTranslator]: Completed translation [2022-07-22 20:08:02,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:08:02 WrapperNode [2022-07-22 20:08:02,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 20:08:02,962 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 20:08:02,962 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 20:08:02,962 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 20:08:02,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:08:02" (1/1) ... [2022-07-22 20:08:02,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:08:02" (1/1) ... [2022-07-22 20:08:02,989 INFO L137 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 82 [2022-07-22 20:08:02,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 20:08:02,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 20:08:02,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 20:08:02,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 20:08:02,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:08:02" (1/1) ... [2022-07-22 20:08:02,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:08:02" (1/1) ... [2022-07-22 20:08:03,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:08:02" (1/1) ... [2022-07-22 20:08:03,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:08:02" (1/1) ... [2022-07-22 20:08:03,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:08:02" (1/1) ... [2022-07-22 20:08:03,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:08:02" (1/1) ... [2022-07-22 20:08:03,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:08:02" (1/1) ... [2022-07-22 20:08:03,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 20:08:03,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 20:08:03,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 20:08:03,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 20:08:03,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:08:02" (1/1) ... [2022-07-22 20:08:03,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 20:08:03,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:08:03,048 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-07-22 20:08:03,050 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-07-22 20:08:03,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 20:08:03,083 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-07-22 20:08:03,083 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-07-22 20:08:03,083 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-07-22 20:08:03,088 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-07-22 20:08:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 20:08:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 20:08:03,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 20:08:03,157 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 20:08:03,158 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 20:08:03,362 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 20:08:03,368 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 20:08:03,368 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 20:08:03,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 08:08:03 BoogieIcfgContainer [2022-07-22 20:08:03,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 20:08:03,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 20:08:03,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 20:08:03,375 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 20:08:03,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 08:08:02" (1/3) ... [2022-07-22 20:08:03,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1362ae12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 08:08:03, skipping insertion in model container [2022-07-22 20:08:03,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:08:02" (2/3) ... [2022-07-22 20:08:03,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1362ae12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 08:08:03, skipping insertion in model container [2022-07-22 20:08:03,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 08:08:03" (3/3) ... [2022-07-22 20:08:03,392 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_3_6.i [2022-07-22 20:08:03,406 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 20:08:03,406 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-22 20:08:03,448 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 20:08:03,454 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1336de82, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2fbf0cff [2022-07-22 20:08:03,454 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-22 20:08:03,472 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-07-22 20:08:03,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-22 20:08:03,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:08:03,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:08:03,479 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:08:03,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:08:03,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-07-22 20:08:03,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:08:03,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545421885] [2022-07-22 20:08:03,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:08:03,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:08:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:08:03,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:08:03,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:08:03,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545421885] [2022-07-22 20:08:03,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545421885] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:08:03,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:08:03,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 20:08:03,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064254572] [2022-07-22 20:08:03,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:08:03,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 20:08:03,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:08:03,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 20:08:03,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 20:08:03,820 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-07-22 20:08:03,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:08:03,903 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2022-07-22 20:08:03,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 20:08:03,908 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-07-22 20:08:03,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:08:03,924 INFO L225 Difference]: With dead ends: 96 [2022-07-22 20:08:03,925 INFO L226 Difference]: Without dead ends: 39 [2022-07-22 20:08:03,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 20:08:03,931 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 23 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 20:08:03,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 134 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 20:08:03,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-22 20:08:03,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2022-07-22 20:08:03,974 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-07-22 20:08:03,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-07-22 20:08:03,976 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2022-07-22 20:08:03,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:08:03,977 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-07-22 20:08:03,977 INFO L496 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-07-22 20:08:03,977 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-07-22 20:08:03,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-22 20:08:03,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:08:03,978 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:08:03,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 20:08:03,979 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:08:03,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:08:03,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1776235347, now seen corresponding path program 1 times [2022-07-22 20:08:03,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:08:03,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767454050] [2022-07-22 20:08:03,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:08:03,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:08:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:08:04,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:08:04,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:08:04,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767454050] [2022-07-22 20:08:04,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767454050] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:08:04,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:08:04,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 20:08:04,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294851829] [2022-07-22 20:08:04,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:08:04,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 20:08:04,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:08:04,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 20:08:04,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 20:08:04,108 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 20:08:04,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:08:04,202 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-07-22 20:08:04,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 20:08:04,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-22 20:08:04,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:08:04,205 INFO L225 Difference]: With dead ends: 39 [2022-07-22 20:08:04,205 INFO L226 Difference]: Without dead ends: 33 [2022-07-22 20:08:04,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-22 20:08:04,208 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 20:08:04,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 155 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 20:08:04,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-22 20:08:04,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-22 20:08:04,221 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-07-22 20:08:04,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-07-22 20:08:04,224 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2022-07-22 20:08:04,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:08:04,224 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-07-22 20:08:04,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 20:08:04,225 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-07-22 20:08:04,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-22 20:08:04,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:08:04,229 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:08:04,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 20:08:04,230 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:08:04,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:08:04,235 INFO L85 PathProgramCache]: Analyzing trace with hash 830014046, now seen corresponding path program 1 times [2022-07-22 20:08:04,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:08:04,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058901334] [2022-07-22 20:08:04,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:08:04,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:08:04,257 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 20:08:04,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1161777035] [2022-07-22 20:08:04,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:08:04,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:08:04,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:08:04,263 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-07-22 20:08:04,264 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-07-22 20:08:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:08:04,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-22 20:08:04,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:08:27,609 WARN L233 SmtUtils]: Spent 20.40s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 20:08:45,070 WARN L233 SmtUtils]: Spent 8.83s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 20:09:14,404 WARN L233 SmtUtils]: Spent 19.90s on a formula simplification. DAG size of input: 40 DAG size of output: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 20:09:31,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:09:31,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 20:09:42,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:09:42,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:09:42,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058901334] [2022-07-22 20:09:42,151 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 20:09:42,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161777035] [2022-07-22 20:09:42,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161777035] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 20:09:42,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 20:09:42,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-07-22 20:09:42,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058475044] [2022-07-22 20:09:42,152 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 20:09:42,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 20:09:42,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:09:42,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 20:09:42,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=202, Unknown=16, NotChecked=0, Total=272 [2022-07-22 20:09:42,154 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 20:09:42,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:09:42,482 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-07-22 20:09:42,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 20:09:42,482 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-22 20:09:42,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:09:42,483 INFO L225 Difference]: With dead ends: 41 [2022-07-22 20:09:42,483 INFO L226 Difference]: Without dead ends: 35 [2022-07-22 20:09:42,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 94.4s TimeCoverageRelationStatistics Valid=63, Invalid=227, Unknown=16, NotChecked=0, Total=306 [2022-07-22 20:09:42,485 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 20:09:42,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 291 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 19 Unchecked, 0.0s Time] [2022-07-22 20:09:42,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-22 20:09:42,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-07-22 20:09:42,489 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-07-22 20:09:42,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-07-22 20:09:42,490 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 12 [2022-07-22 20:09:42,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:09:42,490 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-07-22 20:09:42,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 20:09:42,491 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-07-22 20:09:42,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-22 20:09:42,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:09:42,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:09:42,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 20:09:42,692 WARN L477 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-07-22 20:09:42,693 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:09:42,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:09:42,693 INFO L85 PathProgramCache]: Analyzing trace with hash 20667420, now seen corresponding path program 1 times [2022-07-22 20:09:42,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:09:42,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222502000] [2022-07-22 20:09:42,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:09:42,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:09:42,704 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 20:09:42,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1106502891] [2022-07-22 20:09:42,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:09:42,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:09:42,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:09:42,706 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-07-22 20:09:42,712 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-07-22 20:09:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:09:42,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-22 20:09:42,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:09:59,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:09:59,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 20:10:11,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:10:11,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:10:11,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222502000] [2022-07-22 20:10:11,216 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 20:10:11,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106502891] [2022-07-22 20:10:11,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106502891] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 20:10:11,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 20:10:11,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2022-07-22 20:10:11,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587649656] [2022-07-22 20:10:11,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 20:10:11,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-22 20:10:11,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:10:11,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-22 20:10:11,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=179, Unknown=8, NotChecked=0, Total=240 [2022-07-22 20:10:11,218 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 20:10:11,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:10:11,849 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2022-07-22 20:10:11,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 20:10:11,850 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-22 20:10:11,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:10:11,850 INFO L225 Difference]: With dead ends: 46 [2022-07-22 20:10:11,850 INFO L226 Difference]: Without dead ends: 37 [2022-07-22 20:10:11,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 27.2s TimeCoverageRelationStatistics Valid=62, Invalid=202, Unknown=8, NotChecked=0, Total=272 [2022-07-22 20:10:11,852 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 20:10:11,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 281 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 36 Unchecked, 0.2s Time] [2022-07-22 20:10:11,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-22 20:10:11,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2022-07-22 20:10:11,856 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) [2022-07-22 20:10:11,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-07-22 20:10:11,857 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 12 [2022-07-22 20:10:11,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:10:11,857 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-07-22 20:10:11,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 20:10:11,857 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-07-22 20:10:11,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-22 20:10:11,858 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:10:11,858 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 20:10:11,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 20:10:12,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-22 20:10:12,059 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:10:12,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:10:12,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1518646018, now seen corresponding path program 2 times [2022-07-22 20:10:12,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:10:12,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575021136] [2022-07-22 20:10:12,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:10:12,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:10:12,069 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 20:10:12,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [262426588] [2022-07-22 20:10:12,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 20:10:12,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:10:12,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:10:12,071 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) [2022-07-22 20:10:12,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 20:10:12,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 20:10:12,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 20:10:12,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-22 20:10:12,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:10:21,157 WARN L233 SmtUtils]: Spent 5.98s on a formula simplification. DAG size of input: 67 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 20:10:36,173 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse3 (not (< |c_ULTIMATE.start_gcd_test_~a#1| 0)))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_17| Int) (|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse2 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_17|) 256))) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse2)) (.cse1 (mod .cse2 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse0 256)) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse1) 256) 127) (not (<= (mod (+ .cse0 (* 255 .cse2)) 256) 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_15| 0)) (<= .cse2 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse1 256)) (<= |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_main1_~x~0#1|))))) .cse3) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_17| Int) (|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse6 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_17|) 256))) (let ((.cse4 (+ (- 256) .cse6))) (let ((.cse5 (mod .cse4 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_15| 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse4) 256)) (<= |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_main1_~x~0#1|) (= .cse5 0) (= (mod .cse5 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (<= .cse6 127))))))) .cse3) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_17| Int)) (let ((.cse8 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_17|) 256))) (let ((.cse7 (mod (+ (- 256) .cse8) |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse7 0)) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse7) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse7 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) 256))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_15| 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| (+ (- 256) (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_17|) 256))) 256)) (<= |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_main1_~x~0#1|))) (<= (mod .cse7 256) 127) (not (<= .cse8 127)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_17| Int)) (let ((.cse12 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_17|) 256))) (let ((.cse9 (mod (+ (- 256) .cse12) |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse9 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse11 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_17|) 256))) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_15| (+ (- 256) .cse11)))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_15| 0)) (not (<= (mod (+ .cse10 (* 255 .cse11)) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse10 256)) (<= |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_main1_~x~0#1|))))) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse9) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse9 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) 256))) (<= (mod .cse9 256) 127) (not (<= .cse12 127))))))) .cse3) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_17| Int) (|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse15 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_17|) 256))) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse15)) (.cse14 (mod .cse15 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse13 256)) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse14) 256) 127) (not (< |v_ULTIMATE.start_gcd_test_~a#1_15| 0)) (<= .cse15 127) (not (<= (mod (+ .cse13 .cse15) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse14 256)) (<= |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_main1_~x~0#1|))))) .cse3) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_17| Int) (|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse18 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_17|) 256))) (let ((.cse17 (+ (- 256) .cse18))) (let ((.cse16 (mod .cse17 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_15| 0)) (not (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse16) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse17) 256)) (<= |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_main1_~x~0#1|) (= |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse16 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) 256))) (not (<= .cse18 127))))))) .cse3) (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_17| Int) (|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse20 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_17|) 256))) (let ((.cse22 (+ (- 256) .cse20))) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse22)) (.cse21 (mod .cse22 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_15| 0)) (not (<= (mod (+ .cse19 (* 255 .cse20)) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse19 256)) (<= |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_main1_~x~0#1|) (= .cse21 0) (= (mod .cse21 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (<= .cse20 127)))))))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-07-22 20:10:52,538 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (let ((.cse7 (not .cse0))) (or (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_17| Int) (|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse3 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_17|) 256))) (let ((.cse4 (+ (- 256) .cse3))) (let ((.cse2 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse4) 256))) (let ((.cse1 (mod .cse4 .cse2))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (+ (mod (+ .cse1 (* 255 .cse2)) 256) (- 256))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_15| 0)) (not (= .cse2 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse2 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (<= (mod (+ .cse1 .cse2) 256) 127)) (<= |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_main1_~x~0#1|) (not (<= .cse3 127))))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_17| Int) (|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse6 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_17|) 256))) (let ((.cse5 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse6) 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse5 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_15| 0)) (<= .cse6 127) (<= |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_main1_~x~0#1|) (not (= .cse5 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse6 .cse5) 256)))))) .cse7) (and .cse0 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_17| Int) (|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse11 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_17|) 256))) (let ((.cse12 (+ (- 256) .cse11))) (let ((.cse9 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse12) 256))) (let ((.cse8 (mod .cse12 .cse9)) (.cse10 (mod .cse9 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse8 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (+ (mod (+ .cse8 (* 255 .cse9)) 256) (- 256))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_15| 0)) (not (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse10) 256) 127)) (<= (mod (+ .cse8 .cse9) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse10 256)) (<= |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_main1_~x~0#1|) (not (<= .cse11 127)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_17| Int) (|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse16 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_17|) 256))) (let ((.cse18 (+ (- 256) .cse16))) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse18))) (let ((.cse14 (mod .cse15 256))) (let ((.cse13 (mod .cse18 .cse14)) (.cse17 (mod .cse14 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse13 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (+ (mod (+ .cse13 (* 255 .cse14)) 256) (- 256))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_15| 0)) (not (<= (mod (+ .cse15 (* 255 .cse16)) 256) 127)) (not (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse17) 256) 127)) (<= (mod (+ .cse13 .cse14) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse17 256)) (<= |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_main1_~x~0#1|) (not (<= .cse16 127))))))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_17| Int) (|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse20 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_17|) 256))) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse20))) (let ((.cse19 (mod .cse21 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse19 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_15| 0)) (<= .cse20 127) (not (<= (mod (+ .cse21 .cse20) 256) 127)) (<= |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_main1_~x~0#1|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse20 .cse19) 256))))))) .cse7)))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-07-22 20:10:58,697 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (let ((.cse5 (not .cse0))) (or (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_17| Int) (|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse3 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_17|) 256))) (let ((.cse4 (+ (- 256) .cse3))) (let ((.cse2 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse4) 256))) (let ((.cse1 (mod .cse4 .cse2))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (+ (mod (+ .cse1 (* 255 .cse2)) 256) (- 256))) (= (mod (mod .cse2 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_15| 0)) (not (= .cse2 0)) (not (<= (mod (+ .cse1 .cse2) 256) 127)) (<= |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_main1_~x~0#1|) (not (<= .cse3 127))))))))) (and .cse5 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_17| Int) (|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse7 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_17|) 256))) (let ((.cse6 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse7) 256))) (and (= 0 (mod (mod .cse6 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_15| 0)) (<= .cse7 127) (<= |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_main1_~x~0#1|) (not (= .cse6 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse7 .cse6) 256))))))) (and .cse0 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_17| Int) (|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse12 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_17|) 256))) (let ((.cse13 (+ (- 256) .cse12))) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse13))) (let ((.cse9 (mod .cse11 256))) (let ((.cse10 (mod .cse9 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse8 (mod .cse13 .cse9))) (and (not (= .cse8 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (+ (mod (+ .cse8 (* 255 .cse9)) 256) (- 256))) (= (mod .cse10 256) 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_15| 0)) (not (<= (mod (+ .cse11 (* 255 .cse12)) 256) 127)) (not (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse10) 256) 127)) (<= (mod (+ .cse8 .cse9) 256) 127) (<= |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_main1_~x~0#1|) (not (<= .cse12 127))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_17| Int) (|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse17 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_17|) 256))) (let ((.cse18 (+ (- 256) .cse17))) (let ((.cse15 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse18) 256))) (let ((.cse16 (mod .cse15 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse14 (mod .cse18 .cse15))) (and (not (= .cse14 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (+ (mod (+ .cse14 (* 255 .cse15)) 256) (- 256))) (= (mod .cse16 256) 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_15| 0)) (not (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse16) 256) 127)) (<= (mod (+ .cse14 .cse15) 256) 127) (<= |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_main1_~x~0#1|) (not (<= .cse17 127)))))))))) (and .cse5 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_17| Int) (|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse20 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_17|) 256))) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse20))) (let ((.cse19 (mod .cse21 256))) (and (= 0 (mod (mod .cse19 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_15| 0)) (<= .cse20 127) (not (<= (mod (+ .cse21 .cse20) 256) 127)) (<= |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_main1_~x~0#1|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse20 .cse19) 256))))))))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-07-22 20:11:37,482 WARN L233 SmtUtils]: Spent 28.67s on a formula simplification. DAG size of input: 80 DAG size of output: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 20:11:51,756 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification. DAG size of input: 61 DAG size of output: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 20:11:55,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-07-22 20:11:55,779 INFO L328 TraceCheckSpWp]: Computing backward predicates...