./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound5.c --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/nla-digbench-scaling/fermat2-ll_unwindbound5.c -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 a8eb1c4cff73de825c0246f8cf2782e4a89e8227445b840b0a85ffef021d29c3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:25:05,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:25:05,388 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:25:05,421 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:25:05,422 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:25:05,424 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:25:05,425 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:25:05,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:25:05,429 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:25:05,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:25:05,433 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:25:05,434 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:25:05,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:25:05,436 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:25:05,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:25:05,439 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:25:05,440 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:25:05,440 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:25:05,442 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:25:05,446 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:25:05,447 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:25:05,448 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:25:05,449 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:25:05,450 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:25:05,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:25:05,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:25:05,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:25:05,456 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:25:05,457 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:25:05,457 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:25:05,457 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:25:05,458 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:25:05,459 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:25:05,460 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:25:05,461 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:25:05,461 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:25:05,462 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:25:05,462 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:25:05,462 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:25:05,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:25:05,464 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:25:05,464 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:25:05,487 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:25:05,487 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:25:05,488 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:25:05,488 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:25:05,489 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:25:05,489 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:25:05,489 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:25:05,489 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:25:05,489 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:25:05,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:25:05,490 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:25:05,490 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:25:05,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:25:05,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:25:05,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:25:05,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:25:05,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:25:05,491 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:25:05,491 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:25:05,492 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:25:05,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:25:05,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:25:05,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:25:05,492 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:25:05,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:25:05,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:25:05,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:25:05,493 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:25:05,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:25:05,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:25:05,494 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:25:05,494 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:25:05,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:25:05,494 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 -> a8eb1c4cff73de825c0246f8cf2782e4a89e8227445b840b0a85ffef021d29c3 [2022-02-20 17:25:05,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:25:05,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:25:05,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:25:05,715 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:25:05,716 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:25:05,717 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound5.c [2022-02-20 17:25:05,763 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8557782f/9d585235b739457cb409d422f3b2bba5/FLAG05dbebcaf [2022-02-20 17:25:06,127 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:25:06,127 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound5.c [2022-02-20 17:25:06,132 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8557782f/9d585235b739457cb409d422f3b2bba5/FLAG05dbebcaf [2022-02-20 17:25:06,144 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8557782f/9d585235b739457cb409d422f3b2bba5 [2022-02-20 17:25:06,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:25:06,148 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:25:06,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:25:06,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:25:06,154 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:25:06,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:25:06" (1/1) ... [2022-02-20 17:25:06,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3688c4f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:06, skipping insertion in model container [2022-02-20 17:25:06,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:25:06" (1/1) ... [2022-02-20 17:25:06,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:25:06,171 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:25:06,320 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/nla-digbench-scaling/fermat2-ll_unwindbound5.c[524,537] [2022-02-20 17:25:06,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:25:06,356 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:25:06,367 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/nla-digbench-scaling/fermat2-ll_unwindbound5.c[524,537] [2022-02-20 17:25:06,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:25:06,396 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:25:06,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:06 WrapperNode [2022-02-20 17:25:06,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:25:06,397 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:25:06,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:25:06,397 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:25:06,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:06" (1/1) ... [2022-02-20 17:25:06,406 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:06" (1/1) ... [2022-02-20 17:25:06,420 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2022-02-20 17:25:06,420 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:25:06,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:25:06,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:25:06,421 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:25:06,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:06" (1/1) ... [2022-02-20 17:25:06,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:06" (1/1) ... [2022-02-20 17:25:06,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:06" (1/1) ... [2022-02-20 17:25:06,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:06" (1/1) ... [2022-02-20 17:25:06,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:06" (1/1) ... [2022-02-20 17:25:06,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:06" (1/1) ... [2022-02-20 17:25:06,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:06" (1/1) ... [2022-02-20 17:25:06,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:25:06,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:25:06,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:25:06,440 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:25:06,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:06" (1/1) ... [2022-02-20 17:25:06,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:25:06,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:25:06,471 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 17:25:06,483 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 17:25:06,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:25:06,499 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:25:06,499 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:25:06,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:25:06,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:25:06,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:25:06,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:25:06,500 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:25:06,537 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:25:06,538 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:25:06,728 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:25:06,732 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:25:06,732 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:25:06,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:25:06 BoogieIcfgContainer [2022-02-20 17:25:06,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:25:06,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:25:06,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:25:06,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:25:06,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:25:06" (1/3) ... [2022-02-20 17:25:06,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc808dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:25:06, skipping insertion in model container [2022-02-20 17:25:06,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:06" (2/3) ... [2022-02-20 17:25:06,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc808dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:25:06, skipping insertion in model container [2022-02-20 17:25:06,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:25:06" (3/3) ... [2022-02-20 17:25:06,740 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound5.c [2022-02-20 17:25:06,758 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:25:06,759 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:25:06,804 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:25:06,823 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 17:25:06,824 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:25:06,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:25:06,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:25:06,854 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:25:06,854 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:25:06,856 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:25:06,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:25:06,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1086166160, now seen corresponding path program 1 times [2022-02-20 17:25:06,866 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:25:06,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347506213] [2022-02-20 17:25:06,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:06,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:25:06,976 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:25:06,977 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1758690459] [2022-02-20 17:25:06,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:06,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:25:06,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:25:06,979 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 17:25:06,983 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 17:25:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:07,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 17:25:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:07,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:25:07,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {28#true} is VALID [2022-02-20 17:25:07,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {28#true} is VALID [2022-02-20 17:25:07,124 INFO L272 TraceCheckUtils]: 2: Hoare triple {28#true} call assume_abort_if_not((if (main_~R~0#1 - 1) * (main_~R~0#1 - 1) < main_~A~0#1 then 1 else 0)); {28#true} is VALID [2022-02-20 17:25:07,124 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:25:07,125 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#true} assume 0 == ~cond;assume false; {29#false} is VALID [2022-02-20 17:25:07,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 17:25:07,125 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {29#false} {28#true} #56#return; {29#false} is VALID [2022-02-20 17:25:07,125 INFO L272 TraceCheckUtils]: 7: Hoare triple {29#false} call assume_abort_if_not((if 1 == (if main_~A~0#1 < 0 && 0 != main_~A~0#1 % 2 then main_~A~0#1 % 2 - 2 else main_~A~0#1 % 2) then 1 else 0)); {29#false} is VALID [2022-02-20 17:25:07,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-02-20 17:25:07,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} assume 0 == ~cond;assume false; {29#false} is VALID [2022-02-20 17:25:07,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 17:25:07,126 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {29#false} {29#false} #58#return; {29#false} is VALID [2022-02-20 17:25:07,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} main_~u~0#1 := 1 + 2 * main_~R~0#1;main_~v~0#1 := 1;main_~r~0#1 := main_~R~0#1 * main_~R~0#1 - main_~A~0#1; {29#false} is VALID [2022-02-20 17:25:07,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {29#false} assume !true; {29#false} is VALID [2022-02-20 17:25:07,127 INFO L272 TraceCheckUtils]: 14: Hoare triple {29#false} call __VERIFIER_assert((if 4 * main_~A~0#1 == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {29#false} is VALID [2022-02-20 17:25:07,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-02-20 17:25:07,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-02-20 17:25:07,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 17:25:07,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:25:07,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:25:07,128 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:25:07,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347506213] [2022-02-20 17:25:07,129 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:25:07,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758690459] [2022-02-20 17:25:07,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758690459] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:25:07,130 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:25:07,130 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:25:07,131 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565184292] [2022-02-20 17:25:07,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:25:07,135 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 17:25:07,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:25:07,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:25:07,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:07,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:25:07,154 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:25:07,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:25:07,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:25:07,168 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:25:07,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:07,200 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-02-20 17:25:07,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:25:07,201 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 17:25:07,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:25:07,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:25:07,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2022-02-20 17:25:07,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:25:07,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2022-02-20 17:25:07,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 64 transitions. [2022-02-20 17:25:07,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:07,265 INFO L225 Difference]: With dead ends: 47 [2022-02-20 17:25:07,266 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 17:25:07,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:25:07,271 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:25:07,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:25:07,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 17:25:07,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 17:25:07,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:25:07,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:07,294 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:07,295 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:07,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:07,299 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-20 17:25:07,299 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-20 17:25:07,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:07,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:07,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 21 states. [2022-02-20 17:25:07,302 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 21 states. [2022-02-20 17:25:07,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:07,307 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-20 17:25:07,307 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-20 17:25:07,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:07,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:07,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:25:07,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:25:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:07,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-02-20 17:25:07,314 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2022-02-20 17:25:07,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:25:07,314 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-02-20 17:25:07,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:25:07,315 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-20 17:25:07,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:25:07,316 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:25:07,316 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:25:07,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:25:07,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-02-20 17:25:07,532 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:25:07,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:25:07,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1345709874, now seen corresponding path program 1 times [2022-02-20 17:25:07,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:25:07,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050380077] [2022-02-20 17:25:07,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:07,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:25:07,546 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:25:07,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2127761883] [2022-02-20 17:25:07,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:07,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:25:07,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:25:07,553 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 17:25:07,578 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 17:25:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:07,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:25:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:07,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:25:07,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {215#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {220#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:07,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {220#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {220#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:07,724 INFO L272 TraceCheckUtils]: 2: Hoare triple {220#(<= ~counter~0 0)} call assume_abort_if_not((if (main_~R~0#1 - 1) * (main_~R~0#1 - 1) < main_~A~0#1 then 1 else 0)); {220#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:07,724 INFO L290 TraceCheckUtils]: 3: Hoare triple {220#(<= ~counter~0 0)} ~cond := #in~cond; {220#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:07,725 INFO L290 TraceCheckUtils]: 4: Hoare triple {220#(<= ~counter~0 0)} assume !(0 == ~cond); {220#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:07,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {220#(<= ~counter~0 0)} assume true; {220#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:07,726 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {220#(<= ~counter~0 0)} {220#(<= ~counter~0 0)} #56#return; {220#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:07,727 INFO L272 TraceCheckUtils]: 7: Hoare triple {220#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if main_~A~0#1 < 0 && 0 != main_~A~0#1 % 2 then main_~A~0#1 % 2 - 2 else main_~A~0#1 % 2) then 1 else 0)); {220#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:07,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {220#(<= ~counter~0 0)} ~cond := #in~cond; {220#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:07,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {220#(<= ~counter~0 0)} assume !(0 == ~cond); {220#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:07,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {220#(<= ~counter~0 0)} assume true; {220#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:07,729 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {220#(<= ~counter~0 0)} {220#(<= ~counter~0 0)} #58#return; {220#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:07,729 INFO L290 TraceCheckUtils]: 12: Hoare triple {220#(<= ~counter~0 0)} main_~u~0#1 := 1 + 2 * main_~R~0#1;main_~v~0#1 := 1;main_~r~0#1 := main_~R~0#1 * main_~R~0#1 - main_~A~0#1; {220#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:07,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {220#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {260#(<= |ULTIMATE.start_main_#t~post6#1| 0)} is VALID [2022-02-20 17:25:07,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {260#(<= |ULTIMATE.start_main_#t~post6#1| 0)} assume !(main_#t~post6#1 < 5);havoc main_#t~post6#1; {216#false} is VALID [2022-02-20 17:25:07,731 INFO L272 TraceCheckUtils]: 15: Hoare triple {216#false} call __VERIFIER_assert((if 4 * main_~A~0#1 == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {216#false} is VALID [2022-02-20 17:25:07,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {216#false} ~cond := #in~cond; {216#false} is VALID [2022-02-20 17:25:07,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {216#false} assume 0 == ~cond; {216#false} is VALID [2022-02-20 17:25:07,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {216#false} assume !false; {216#false} is VALID [2022-02-20 17:25:07,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:25:07,732 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:25:07,732 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:25:07,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050380077] [2022-02-20 17:25:07,732 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:25:07,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127761883] [2022-02-20 17:25:07,733 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127761883] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:25:07,733 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:25:07,733 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:25:07,734 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452683508] [2022-02-20 17:25:07,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:25:07,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:25:07,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:25:07,736 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), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:25:07,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:07,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:25:07,748 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:25:07,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:25:07,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:25:07,750 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:25:07,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:07,800 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-02-20 17:25:07,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:25:07,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:25:07,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:25:07,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:25:07,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-02-20 17:25:07,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:25:07,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-02-20 17:25:07,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2022-02-20 17:25:07,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:07,833 INFO L225 Difference]: With dead ends: 30 [2022-02-20 17:25:07,833 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 17:25:07,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:25:07,834 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:25:07,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:25:07,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 17:25:07,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 17:25:07,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:25:07,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:07,839 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:07,839 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:07,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:07,841 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 17:25:07,841 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 17:25:07,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:07,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:07,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 23 states. [2022-02-20 17:25:07,842 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 23 states. [2022-02-20 17:25:07,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:07,843 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 17:25:07,843 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 17:25:07,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:07,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:07,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:25:07,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:25:07,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:07,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-02-20 17:25:07,845 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2022-02-20 17:25:07,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:25:07,845 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-02-20 17:25:07,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:25:07,846 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 17:25:07,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:25:07,846 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:25:07,846 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:25:07,865 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-02-20 17:25:08,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-02-20 17:25:08,056 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:25:08,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:25:08,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1347497334, now seen corresponding path program 1 times [2022-02-20 17:25:08,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:25:08,056 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377436645] [2022-02-20 17:25:08,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:08,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:25:08,069 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:25:08,069 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2115457365] [2022-02-20 17:25:08,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:08,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:25:08,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:25:08,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-02-20 17:25:08,085 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-02-20 17:25:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:08,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:25:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:08,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:25:13,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {392#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {392#true} is VALID [2022-02-20 17:25:13,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {392#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {392#true} is VALID [2022-02-20 17:25:13,007 INFO L272 TraceCheckUtils]: 2: Hoare triple {392#true} call assume_abort_if_not((if (main_~R~0#1 - 1) * (main_~R~0#1 - 1) < main_~A~0#1 then 1 else 0)); {392#true} is VALID [2022-02-20 17:25:13,008 INFO L290 TraceCheckUtils]: 3: Hoare triple {392#true} ~cond := #in~cond; {392#true} is VALID [2022-02-20 17:25:13,008 INFO L290 TraceCheckUtils]: 4: Hoare triple {392#true} assume !(0 == ~cond); {392#true} is VALID [2022-02-20 17:25:13,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {392#true} assume true; {392#true} is VALID [2022-02-20 17:25:13,008 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {392#true} {392#true} #56#return; {392#true} is VALID [2022-02-20 17:25:13,008 INFO L272 TraceCheckUtils]: 7: Hoare triple {392#true} call assume_abort_if_not((if 1 == (if main_~A~0#1 < 0 && 0 != main_~A~0#1 % 2 then main_~A~0#1 % 2 - 2 else main_~A~0#1 % 2) then 1 else 0)); {392#true} is VALID [2022-02-20 17:25:13,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {392#true} ~cond := #in~cond; {392#true} is VALID [2022-02-20 17:25:13,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {392#true} assume !(0 == ~cond); {392#true} is VALID [2022-02-20 17:25:13,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {392#true} assume true; {392#true} is VALID [2022-02-20 17:25:13,009 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {392#true} {392#true} #58#return; {392#true} is VALID [2022-02-20 17:25:13,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {392#true} main_~u~0#1 := 1 + 2 * main_~R~0#1;main_~v~0#1 := 1;main_~r~0#1 := main_~R~0#1 * main_~R~0#1 - main_~A~0#1; {433#(and (= (mod (+ |ULTIMATE.start_main_~u~0#1| 1) 2) 0) (= |ULTIMATE.start_main_~v~0#1| 1) (= (+ (* (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2) (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2)) (* (- 1) |ULTIMATE.start_main_~A~0#1|)) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:25:13,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {433#(and (= (mod (+ |ULTIMATE.start_main_~u~0#1| 1) 2) 0) (= |ULTIMATE.start_main_~v~0#1| 1) (= (+ (* (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2) (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2)) (* (- 1) |ULTIMATE.start_main_~A~0#1|)) |ULTIMATE.start_main_~r~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {433#(and (= (mod (+ |ULTIMATE.start_main_~u~0#1| 1) 2) 0) (= |ULTIMATE.start_main_~v~0#1| 1) (= (+ (* (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2) (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2)) (* (- 1) |ULTIMATE.start_main_~A~0#1|)) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:25:13,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {433#(and (= (mod (+ |ULTIMATE.start_main_~u~0#1| 1) 2) 0) (= |ULTIMATE.start_main_~v~0#1| 1) (= (+ (* (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2) (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2)) (* (- 1) |ULTIMATE.start_main_~A~0#1|)) |ULTIMATE.start_main_~r~0#1|))} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {433#(and (= (mod (+ |ULTIMATE.start_main_~u~0#1| 1) 2) 0) (= |ULTIMATE.start_main_~v~0#1| 1) (= (+ (* (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2) (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2)) (* (- 1) |ULTIMATE.start_main_~A~0#1|)) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:25:14,224 INFO L272 TraceCheckUtils]: 15: Hoare triple {433#(and (= (mod (+ |ULTIMATE.start_main_~u~0#1| 1) 2) 0) (= |ULTIMATE.start_main_~v~0#1| 1) (= (+ (* (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2) (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2)) (* (- 1) |ULTIMATE.start_main_~A~0#1|)) |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if 4 * (main_~A~0#1 + main_~r~0#1) == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {443#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:25:14,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {443#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {447#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:25:14,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {447#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {393#false} is VALID [2022-02-20 17:25:14,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {393#false} assume !false; {393#false} is VALID [2022-02-20 17:25:14,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:25:14,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:25:14,226 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:25:14,226 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377436645] [2022-02-20 17:25:14,226 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:25:14,226 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115457365] [2022-02-20 17:25:14,226 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115457365] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:25:14,226 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:25:14,226 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:25:14,226 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097701171] [2022-02-20 17:25:14,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:25:14,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:25:14,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:25:14,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:25:16,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:16,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:25:16,185 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:25:16,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:25:16,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:25:16,186 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:25:19,243 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:25:19,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:19,300 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-02-20 17:25:19,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:25:19,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:25:19,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:25:19,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:25:19,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-02-20 17:25:19,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:25:19,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-02-20 17:25:19,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-02-20 17:25:23,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:23,519 INFO L225 Difference]: With dead ends: 35 [2022-02-20 17:25:23,519 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 17:25:23,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:25:23,520 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:25:23,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 75 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 17:25:23,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 17:25:23,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-02-20 17:25:23,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:25:23,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:25:23,527 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:25:23,527 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:25:23,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:23,529 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-02-20 17:25:23,529 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-02-20 17:25:23,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:23,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:23,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-02-20 17:25:23,530 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-02-20 17:25:23,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:23,531 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-02-20 17:25:23,531 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-02-20 17:25:23,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:23,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:23,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:25:23,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:25:23,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:25:23,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-02-20 17:25:23,533 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 19 [2022-02-20 17:25:23,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:25:23,534 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-02-20 17:25:23,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:25:23,534 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-02-20 17:25:23,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 17:25:23,534 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:25:23,535 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:25:23,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:25:23,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:25:23,740 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:25:23,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:25:23,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1636478750, now seen corresponding path program 1 times [2022-02-20 17:25:23,740 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:25:23,740 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238504212] [2022-02-20 17:25:23,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:23,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:25:23,749 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:25:23,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [89318075] [2022-02-20 17:25:23,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:23,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:25:23,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:25:23,750 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:25:23,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 17:25:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:23,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 17:25:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:23,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:25:23,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {611#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {611#true} is VALID [2022-02-20 17:25:23,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {611#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {611#true} is VALID [2022-02-20 17:25:23,950 INFO L272 TraceCheckUtils]: 2: Hoare triple {611#true} call assume_abort_if_not((if (main_~R~0#1 - 1) * (main_~R~0#1 - 1) < main_~A~0#1 then 1 else 0)); {611#true} is VALID [2022-02-20 17:25:23,950 INFO L290 TraceCheckUtils]: 3: Hoare triple {611#true} ~cond := #in~cond; {611#true} is VALID [2022-02-20 17:25:23,951 INFO L290 TraceCheckUtils]: 4: Hoare triple {611#true} assume !(0 == ~cond); {611#true} is VALID [2022-02-20 17:25:23,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {611#true} assume true; {611#true} is VALID [2022-02-20 17:25:23,953 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {611#true} {611#true} #56#return; {611#true} is VALID [2022-02-20 17:25:23,954 INFO L272 TraceCheckUtils]: 7: Hoare triple {611#true} call assume_abort_if_not((if 1 == (if main_~A~0#1 < 0 && 0 != main_~A~0#1 % 2 then main_~A~0#1 % 2 - 2 else main_~A~0#1 % 2) then 1 else 0)); {611#true} is VALID [2022-02-20 17:25:23,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {611#true} ~cond := #in~cond; {611#true} is VALID [2022-02-20 17:25:23,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {611#true} assume !(0 == ~cond); {611#true} is VALID [2022-02-20 17:25:23,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {611#true} assume true; {611#true} is VALID [2022-02-20 17:25:23,954 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {611#true} {611#true} #58#return; {611#true} is VALID [2022-02-20 17:25:23,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {611#true} main_~u~0#1 := 1 + 2 * main_~R~0#1;main_~v~0#1 := 1;main_~r~0#1 := main_~R~0#1 * main_~R~0#1 - main_~A~0#1; {611#true} is VALID [2022-02-20 17:25:23,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {611#true} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {611#true} is VALID [2022-02-20 17:25:23,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {611#true} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {611#true} is VALID [2022-02-20 17:25:23,957 INFO L272 TraceCheckUtils]: 15: Hoare triple {611#true} call __VERIFIER_assert((if 4 * (main_~A~0#1 + main_~r~0#1) == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {611#true} is VALID [2022-02-20 17:25:23,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {611#true} ~cond := #in~cond; {664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:25:23,957 INFO L290 TraceCheckUtils]: 17: Hoare triple {664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:25:23,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {668#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:25:23,959 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {668#(not (= |__VERIFIER_assert_#in~cond| 0))} {611#true} #60#return; {675#(= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~r~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|)))} is VALID [2022-02-20 17:25:23,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {675#(= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~r~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|)))} assume !(0 != main_~r~0#1); {679#(= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|)))} is VALID [2022-02-20 17:25:23,960 INFO L272 TraceCheckUtils]: 21: Hoare triple {679#(= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|)))} call __VERIFIER_assert((if 4 * main_~A~0#1 == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {683#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:25:23,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {683#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {687#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:25:23,961 INFO L290 TraceCheckUtils]: 23: Hoare triple {687#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {612#false} is VALID [2022-02-20 17:25:23,961 INFO L290 TraceCheckUtils]: 24: Hoare triple {612#false} assume !false; {612#false} is VALID [2022-02-20 17:25:23,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:25:23,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:25:24,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {612#false} assume !false; {612#false} is VALID [2022-02-20 17:25:24,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {687#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {612#false} is VALID [2022-02-20 17:25:24,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {683#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {687#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:25:24,324 INFO L272 TraceCheckUtils]: 21: Hoare triple {679#(= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|)))} call __VERIFIER_assert((if 4 * main_~A~0#1 == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {683#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:25:24,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {706#(or (not (= |ULTIMATE.start_main_~r~0#1| 0)) (= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|))))} assume !(0 != main_~r~0#1); {679#(= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|)))} is VALID [2022-02-20 17:25:24,325 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {668#(not (= |__VERIFIER_assert_#in~cond| 0))} {611#true} #60#return; {706#(or (not (= |ULTIMATE.start_main_~r~0#1| 0)) (= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|))))} is VALID [2022-02-20 17:25:24,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {668#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:25:24,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {719#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:25:24,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {611#true} ~cond := #in~cond; {719#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:25:24,327 INFO L272 TraceCheckUtils]: 15: Hoare triple {611#true} call __VERIFIER_assert((if 4 * (main_~A~0#1 + main_~r~0#1) == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {611#true} is VALID [2022-02-20 17:25:24,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {611#true} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {611#true} is VALID [2022-02-20 17:25:24,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {611#true} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {611#true} is VALID [2022-02-20 17:25:24,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {611#true} main_~u~0#1 := 1 + 2 * main_~R~0#1;main_~v~0#1 := 1;main_~r~0#1 := main_~R~0#1 * main_~R~0#1 - main_~A~0#1; {611#true} is VALID [2022-02-20 17:25:24,327 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {611#true} {611#true} #58#return; {611#true} is VALID [2022-02-20 17:25:24,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {611#true} assume true; {611#true} is VALID [2022-02-20 17:25:24,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {611#true} assume !(0 == ~cond); {611#true} is VALID [2022-02-20 17:25:24,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {611#true} ~cond := #in~cond; {611#true} is VALID [2022-02-20 17:25:24,328 INFO L272 TraceCheckUtils]: 7: Hoare triple {611#true} call assume_abort_if_not((if 1 == (if main_~A~0#1 < 0 && 0 != main_~A~0#1 % 2 then main_~A~0#1 % 2 - 2 else main_~A~0#1 % 2) then 1 else 0)); {611#true} is VALID [2022-02-20 17:25:24,328 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {611#true} {611#true} #56#return; {611#true} is VALID [2022-02-20 17:25:24,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {611#true} assume true; {611#true} is VALID [2022-02-20 17:25:24,328 INFO L290 TraceCheckUtils]: 4: Hoare triple {611#true} assume !(0 == ~cond); {611#true} is VALID [2022-02-20 17:25:24,330 INFO L290 TraceCheckUtils]: 3: Hoare triple {611#true} ~cond := #in~cond; {611#true} is VALID [2022-02-20 17:25:24,331 INFO L272 TraceCheckUtils]: 2: Hoare triple {611#true} call assume_abort_if_not((if (main_~R~0#1 - 1) * (main_~R~0#1 - 1) < main_~A~0#1 then 1 else 0)); {611#true} is VALID [2022-02-20 17:25:24,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {611#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {611#true} is VALID [2022-02-20 17:25:24,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {611#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {611#true} is VALID [2022-02-20 17:25:24,332 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:25:24,332 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:25:24,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238504212] [2022-02-20 17:25:24,332 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:25:24,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89318075] [2022-02-20 17:25:24,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89318075] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:25:24,332 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:25:24,332 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-02-20 17:25:24,332 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674023032] [2022-02-20 17:25:24,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:25:24,333 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 25 [2022-02-20 17:25:24,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:25:24,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:25:24,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:24,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:25:24,351 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:25:24,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:25:24,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:25:24,352 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:25:24,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:24,600 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-02-20 17:25:24,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:25:24,600 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 25 [2022-02-20 17:25:24,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:25:24,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:25:24,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-02-20 17:25:24,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:25:24,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-02-20 17:25:24,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2022-02-20 17:25:24,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:24,628 INFO L225 Difference]: With dead ends: 39 [2022-02-20 17:25:24,629 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 17:25:24,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:25:24,629 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:25:24,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 88 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:25:24,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 17:25:24,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2022-02-20 17:25:24,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:25:24,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 25 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:24,645 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 25 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:24,646 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 25 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:24,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:24,647 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-02-20 17:25:24,647 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-02-20 17:25:24,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:24,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:24,648 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-02-20 17:25:24,648 INFO L87 Difference]: Start difference. First operand has 25 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-02-20 17:25:24,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:24,649 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-02-20 17:25:24,649 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-02-20 17:25:24,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:24,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:24,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:25:24,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:25:24,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:24,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-02-20 17:25:24,651 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 25 [2022-02-20 17:25:24,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:25:24,651 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-02-20 17:25:24,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:25:24,651 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-02-20 17:25:24,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 17:25:24,652 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:25:24,652 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:25:24,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:25:24,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:25:24,867 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:25:24,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:25:24,868 INFO L85 PathProgramCache]: Analyzing trace with hash -126969667, now seen corresponding path program 1 times [2022-02-20 17:25:24,868 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:25:24,868 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398537978] [2022-02-20 17:25:24,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:24,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:25:24,883 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:25:24,884 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1589585446] [2022-02-20 17:25:24,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:24,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:25:24,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:25:24,885 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:25:24,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 17:25:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:24,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:25:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:24,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:25:25,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {927#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {932#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:25,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {932#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {932#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:25,020 INFO L272 TraceCheckUtils]: 2: Hoare triple {932#(<= ~counter~0 0)} call assume_abort_if_not((if (main_~R~0#1 - 1) * (main_~R~0#1 - 1) < main_~A~0#1 then 1 else 0)); {932#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:25,020 INFO L290 TraceCheckUtils]: 3: Hoare triple {932#(<= ~counter~0 0)} ~cond := #in~cond; {932#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:25,021 INFO L290 TraceCheckUtils]: 4: Hoare triple {932#(<= ~counter~0 0)} assume !(0 == ~cond); {932#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:25,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {932#(<= ~counter~0 0)} assume true; {932#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:25,021 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {932#(<= ~counter~0 0)} {932#(<= ~counter~0 0)} #56#return; {932#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:25,022 INFO L272 TraceCheckUtils]: 7: Hoare triple {932#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if main_~A~0#1 < 0 && 0 != main_~A~0#1 % 2 then main_~A~0#1 % 2 - 2 else main_~A~0#1 % 2) then 1 else 0)); {932#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:25,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {932#(<= ~counter~0 0)} ~cond := #in~cond; {932#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:25,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {932#(<= ~counter~0 0)} assume !(0 == ~cond); {932#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:25,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {932#(<= ~counter~0 0)} assume true; {932#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:25,029 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {932#(<= ~counter~0 0)} {932#(<= ~counter~0 0)} #58#return; {932#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:25,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {932#(<= ~counter~0 0)} main_~u~0#1 := 1 + 2 * main_~R~0#1;main_~v~0#1 := 1;main_~r~0#1 := main_~R~0#1 * main_~R~0#1 - main_~A~0#1; {932#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:25,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {932#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {972#(<= ~counter~0 1)} is VALID [2022-02-20 17:25:25,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {972#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {972#(<= ~counter~0 1)} is VALID [2022-02-20 17:25:25,042 INFO L272 TraceCheckUtils]: 15: Hoare triple {972#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (main_~A~0#1 + main_~r~0#1) == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {972#(<= ~counter~0 1)} is VALID [2022-02-20 17:25:25,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {972#(<= ~counter~0 1)} ~cond := #in~cond; {972#(<= ~counter~0 1)} is VALID [2022-02-20 17:25:25,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {972#(<= ~counter~0 1)} assume !(0 == ~cond); {972#(<= ~counter~0 1)} is VALID [2022-02-20 17:25:25,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {972#(<= ~counter~0 1)} assume true; {972#(<= ~counter~0 1)} is VALID [2022-02-20 17:25:25,044 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {972#(<= ~counter~0 1)} {972#(<= ~counter~0 1)} #60#return; {972#(<= ~counter~0 1)} is VALID [2022-02-20 17:25:25,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {972#(<= ~counter~0 1)} assume !!(0 != main_~r~0#1); {972#(<= ~counter~0 1)} is VALID [2022-02-20 17:25:25,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {972#(<= ~counter~0 1)} assume main_~r~0#1 > 0;main_~r~0#1 := main_~r~0#1 - main_~v~0#1;main_~v~0#1 := 2 + main_~v~0#1; {972#(<= ~counter~0 1)} is VALID [2022-02-20 17:25:25,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {972#(<= ~counter~0 1)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1000#(<= |ULTIMATE.start_main_#t~post6#1| 1)} is VALID [2022-02-20 17:25:25,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {1000#(<= |ULTIMATE.start_main_#t~post6#1| 1)} assume !(main_#t~post6#1 < 5);havoc main_#t~post6#1; {928#false} is VALID [2022-02-20 17:25:25,046 INFO L272 TraceCheckUtils]: 24: Hoare triple {928#false} call __VERIFIER_assert((if 4 * main_~A~0#1 == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {928#false} is VALID [2022-02-20 17:25:25,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {928#false} ~cond := #in~cond; {928#false} is VALID [2022-02-20 17:25:25,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {928#false} assume 0 == ~cond; {928#false} is VALID [2022-02-20 17:25:25,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {928#false} assume !false; {928#false} is VALID [2022-02-20 17:25:25,046 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:25:25,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:25:25,138 INFO L290 TraceCheckUtils]: 27: Hoare triple {928#false} assume !false; {928#false} is VALID [2022-02-20 17:25:25,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {928#false} assume 0 == ~cond; {928#false} is VALID [2022-02-20 17:25:25,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {928#false} ~cond := #in~cond; {928#false} is VALID [2022-02-20 17:25:25,139 INFO L272 TraceCheckUtils]: 24: Hoare triple {928#false} call __VERIFIER_assert((if 4 * main_~A~0#1 == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {928#false} is VALID [2022-02-20 17:25:25,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {1028#(< |ULTIMATE.start_main_#t~post6#1| 5)} assume !(main_#t~post6#1 < 5);havoc main_#t~post6#1; {928#false} is VALID [2022-02-20 17:25:25,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {1032#(< ~counter~0 5)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1028#(< |ULTIMATE.start_main_#t~post6#1| 5)} is VALID [2022-02-20 17:25:25,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {1032#(< ~counter~0 5)} assume main_~r~0#1 > 0;main_~r~0#1 := main_~r~0#1 - main_~v~0#1;main_~v~0#1 := 2 + main_~v~0#1; {1032#(< ~counter~0 5)} is VALID [2022-02-20 17:25:25,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {1032#(< ~counter~0 5)} assume !!(0 != main_~r~0#1); {1032#(< ~counter~0 5)} is VALID [2022-02-20 17:25:25,141 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {927#true} {1032#(< ~counter~0 5)} #60#return; {1032#(< ~counter~0 5)} is VALID [2022-02-20 17:25:25,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {927#true} assume true; {927#true} is VALID [2022-02-20 17:25:25,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {927#true} assume !(0 == ~cond); {927#true} is VALID [2022-02-20 17:25:25,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {927#true} ~cond := #in~cond; {927#true} is VALID [2022-02-20 17:25:25,141 INFO L272 TraceCheckUtils]: 15: Hoare triple {1032#(< ~counter~0 5)} call __VERIFIER_assert((if 4 * (main_~A~0#1 + main_~r~0#1) == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {927#true} is VALID [2022-02-20 17:25:25,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {1032#(< ~counter~0 5)} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {1032#(< ~counter~0 5)} is VALID [2022-02-20 17:25:25,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {1060#(< ~counter~0 4)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1032#(< ~counter~0 5)} is VALID [2022-02-20 17:25:25,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {1060#(< ~counter~0 4)} main_~u~0#1 := 1 + 2 * main_~R~0#1;main_~v~0#1 := 1;main_~r~0#1 := main_~R~0#1 * main_~R~0#1 - main_~A~0#1; {1060#(< ~counter~0 4)} is VALID [2022-02-20 17:25:25,143 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {927#true} {1060#(< ~counter~0 4)} #58#return; {1060#(< ~counter~0 4)} is VALID [2022-02-20 17:25:25,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {927#true} assume true; {927#true} is VALID [2022-02-20 17:25:25,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {927#true} assume !(0 == ~cond); {927#true} is VALID [2022-02-20 17:25:25,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {927#true} ~cond := #in~cond; {927#true} is VALID [2022-02-20 17:25:25,143 INFO L272 TraceCheckUtils]: 7: Hoare triple {1060#(< ~counter~0 4)} call assume_abort_if_not((if 1 == (if main_~A~0#1 < 0 && 0 != main_~A~0#1 % 2 then main_~A~0#1 % 2 - 2 else main_~A~0#1 % 2) then 1 else 0)); {927#true} is VALID [2022-02-20 17:25:25,144 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {927#true} {1060#(< ~counter~0 4)} #56#return; {1060#(< ~counter~0 4)} is VALID [2022-02-20 17:25:25,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {927#true} assume true; {927#true} is VALID [2022-02-20 17:25:25,144 INFO L290 TraceCheckUtils]: 4: Hoare triple {927#true} assume !(0 == ~cond); {927#true} is VALID [2022-02-20 17:25:25,144 INFO L290 TraceCheckUtils]: 3: Hoare triple {927#true} ~cond := #in~cond; {927#true} is VALID [2022-02-20 17:25:25,144 INFO L272 TraceCheckUtils]: 2: Hoare triple {1060#(< ~counter~0 4)} call assume_abort_if_not((if (main_~R~0#1 - 1) * (main_~R~0#1 - 1) < main_~A~0#1 then 1 else 0)); {927#true} is VALID [2022-02-20 17:25:25,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {1060#(< ~counter~0 4)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1060#(< ~counter~0 4)} is VALID [2022-02-20 17:25:25,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {927#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1060#(< ~counter~0 4)} is VALID [2022-02-20 17:25:25,146 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:25:25,146 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:25:25,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398537978] [2022-02-20 17:25:25,146 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:25:25,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589585446] [2022-02-20 17:25:25,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589585446] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:25:25,147 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:25:25,147 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-02-20 17:25:25,147 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549376718] [2022-02-20 17:25:25,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:25:25,147 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2022-02-20 17:25:25,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:25:25,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 17:25:25,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:25,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:25:25,179 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:25:25,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:25:25,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:25:25,180 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 17:25:25,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:25,320 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-02-20 17:25:25,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:25:25,320 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2022-02-20 17:25:25,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:25:25,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 17:25:25,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2022-02-20 17:25:25,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 17:25:25,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2022-02-20 17:25:25,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 63 transitions. [2022-02-20 17:25:25,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:25,368 INFO L225 Difference]: With dead ends: 57 [2022-02-20 17:25:25,368 INFO L226 Difference]: Without dead ends: 52 [2022-02-20 17:25:25,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:25:25,369 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:25:25,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 88 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:25:25,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-20 17:25:25,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-02-20 17:25:25,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:25:25,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:25:25,397 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:25:25,397 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:25:25,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:25,399 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-02-20 17:25:25,399 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-02-20 17:25:25,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:25,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:25,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 52 states. [2022-02-20 17:25:25,400 INFO L87 Difference]: Start difference. First operand has 52 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 52 states. [2022-02-20 17:25:25,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:25,402 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-02-20 17:25:25,402 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-02-20 17:25:25,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:25,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:25,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:25:25,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:25:25,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:25:25,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-02-20 17:25:25,404 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 28 [2022-02-20 17:25:25,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:25:25,404 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-02-20 17:25:25,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 17:25:25,405 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-02-20 17:25:25,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 17:25:25,405 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:25:25,406 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:25:25,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 17:25:25,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:25:25,623 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:25:25,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:25:25,624 INFO L85 PathProgramCache]: Analyzing trace with hash 972990450, now seen corresponding path program 2 times [2022-02-20 17:25:25,624 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:25:25,624 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448185484] [2022-02-20 17:25:25,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:25,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:25:25,634 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:25:25,634 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1055275554] [2022-02-20 17:25:25,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:25:25,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:25:25,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:25:25,635 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:25:25,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 17:25:25,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:25:25,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:25:25,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:25:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:25,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:25:25,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {1356#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1361#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:25,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {1361#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1361#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:25,928 INFO L272 TraceCheckUtils]: 2: Hoare triple {1361#(<= ~counter~0 0)} call assume_abort_if_not((if (main_~R~0#1 - 1) * (main_~R~0#1 - 1) < main_~A~0#1 then 1 else 0)); {1361#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:25,928 INFO L290 TraceCheckUtils]: 3: Hoare triple {1361#(<= ~counter~0 0)} ~cond := #in~cond; {1361#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:25,928 INFO L290 TraceCheckUtils]: 4: Hoare triple {1361#(<= ~counter~0 0)} assume !(0 == ~cond); {1361#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:25,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {1361#(<= ~counter~0 0)} assume true; {1361#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:25,929 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1361#(<= ~counter~0 0)} {1361#(<= ~counter~0 0)} #56#return; {1361#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:25,929 INFO L272 TraceCheckUtils]: 7: Hoare triple {1361#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if main_~A~0#1 < 0 && 0 != main_~A~0#1 % 2 then main_~A~0#1 % 2 - 2 else main_~A~0#1 % 2) then 1 else 0)); {1361#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:25,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {1361#(<= ~counter~0 0)} ~cond := #in~cond; {1361#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:25,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {1361#(<= ~counter~0 0)} assume !(0 == ~cond); {1361#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:25,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {1361#(<= ~counter~0 0)} assume true; {1361#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:25,931 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1361#(<= ~counter~0 0)} {1361#(<= ~counter~0 0)} #58#return; {1361#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:25,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {1361#(<= ~counter~0 0)} main_~u~0#1 := 1 + 2 * main_~R~0#1;main_~v~0#1 := 1;main_~r~0#1 := main_~R~0#1 * main_~R~0#1 - main_~A~0#1; {1361#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:25,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {1361#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1401#(<= ~counter~0 1)} is VALID [2022-02-20 17:25:25,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {1401#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {1401#(<= ~counter~0 1)} is VALID [2022-02-20 17:25:25,932 INFO L272 TraceCheckUtils]: 15: Hoare triple {1401#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (main_~A~0#1 + main_~r~0#1) == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {1401#(<= ~counter~0 1)} is VALID [2022-02-20 17:25:25,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {1401#(<= ~counter~0 1)} ~cond := #in~cond; {1401#(<= ~counter~0 1)} is VALID [2022-02-20 17:25:25,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {1401#(<= ~counter~0 1)} assume !(0 == ~cond); {1401#(<= ~counter~0 1)} is VALID [2022-02-20 17:25:25,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {1401#(<= ~counter~0 1)} assume true; {1401#(<= ~counter~0 1)} is VALID [2022-02-20 17:25:25,933 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1401#(<= ~counter~0 1)} {1401#(<= ~counter~0 1)} #60#return; {1401#(<= ~counter~0 1)} is VALID [2022-02-20 17:25:25,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {1401#(<= ~counter~0 1)} assume !!(0 != main_~r~0#1); {1401#(<= ~counter~0 1)} is VALID [2022-02-20 17:25:25,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {1401#(<= ~counter~0 1)} assume main_~r~0#1 > 0;main_~r~0#1 := main_~r~0#1 - main_~v~0#1;main_~v~0#1 := 2 + main_~v~0#1; {1401#(<= ~counter~0 1)} is VALID [2022-02-20 17:25:25,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {1401#(<= ~counter~0 1)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1429#(<= ~counter~0 2)} is VALID [2022-02-20 17:25:25,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {1429#(<= ~counter~0 2)} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {1429#(<= ~counter~0 2)} is VALID [2022-02-20 17:25:25,939 INFO L272 TraceCheckUtils]: 24: Hoare triple {1429#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (main_~A~0#1 + main_~r~0#1) == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {1429#(<= ~counter~0 2)} is VALID [2022-02-20 17:25:25,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {1429#(<= ~counter~0 2)} ~cond := #in~cond; {1429#(<= ~counter~0 2)} is VALID [2022-02-20 17:25:25,940 INFO L290 TraceCheckUtils]: 26: Hoare triple {1429#(<= ~counter~0 2)} assume !(0 == ~cond); {1429#(<= ~counter~0 2)} is VALID [2022-02-20 17:25:25,940 INFO L290 TraceCheckUtils]: 27: Hoare triple {1429#(<= ~counter~0 2)} assume true; {1429#(<= ~counter~0 2)} is VALID [2022-02-20 17:25:25,941 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1429#(<= ~counter~0 2)} {1429#(<= ~counter~0 2)} #60#return; {1429#(<= ~counter~0 2)} is VALID [2022-02-20 17:25:25,941 INFO L290 TraceCheckUtils]: 29: Hoare triple {1429#(<= ~counter~0 2)} assume !!(0 != main_~r~0#1); {1429#(<= ~counter~0 2)} is VALID [2022-02-20 17:25:25,941 INFO L290 TraceCheckUtils]: 30: Hoare triple {1429#(<= ~counter~0 2)} assume main_~r~0#1 > 0;main_~r~0#1 := main_~r~0#1 - main_~v~0#1;main_~v~0#1 := 2 + main_~v~0#1; {1429#(<= ~counter~0 2)} is VALID [2022-02-20 17:25:25,942 INFO L290 TraceCheckUtils]: 31: Hoare triple {1429#(<= ~counter~0 2)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1457#(<= ~counter~0 3)} is VALID [2022-02-20 17:25:25,942 INFO L290 TraceCheckUtils]: 32: Hoare triple {1457#(<= ~counter~0 3)} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {1457#(<= ~counter~0 3)} is VALID [2022-02-20 17:25:25,943 INFO L272 TraceCheckUtils]: 33: Hoare triple {1457#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (main_~A~0#1 + main_~r~0#1) == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {1457#(<= ~counter~0 3)} is VALID [2022-02-20 17:25:25,943 INFO L290 TraceCheckUtils]: 34: Hoare triple {1457#(<= ~counter~0 3)} ~cond := #in~cond; {1457#(<= ~counter~0 3)} is VALID [2022-02-20 17:25:25,943 INFO L290 TraceCheckUtils]: 35: Hoare triple {1457#(<= ~counter~0 3)} assume !(0 == ~cond); {1457#(<= ~counter~0 3)} is VALID [2022-02-20 17:25:25,943 INFO L290 TraceCheckUtils]: 36: Hoare triple {1457#(<= ~counter~0 3)} assume true; {1457#(<= ~counter~0 3)} is VALID [2022-02-20 17:25:25,949 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1457#(<= ~counter~0 3)} {1457#(<= ~counter~0 3)} #60#return; {1457#(<= ~counter~0 3)} is VALID [2022-02-20 17:25:25,952 INFO L290 TraceCheckUtils]: 38: Hoare triple {1457#(<= ~counter~0 3)} assume !!(0 != main_~r~0#1); {1457#(<= ~counter~0 3)} is VALID [2022-02-20 17:25:25,952 INFO L290 TraceCheckUtils]: 39: Hoare triple {1457#(<= ~counter~0 3)} assume main_~r~0#1 > 0;main_~r~0#1 := main_~r~0#1 - main_~v~0#1;main_~v~0#1 := 2 + main_~v~0#1; {1457#(<= ~counter~0 3)} is VALID [2022-02-20 17:25:25,953 INFO L290 TraceCheckUtils]: 40: Hoare triple {1457#(<= ~counter~0 3)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1485#(<= ~counter~0 4)} is VALID [2022-02-20 17:25:25,953 INFO L290 TraceCheckUtils]: 41: Hoare triple {1485#(<= ~counter~0 4)} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {1485#(<= ~counter~0 4)} is VALID [2022-02-20 17:25:25,954 INFO L272 TraceCheckUtils]: 42: Hoare triple {1485#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (main_~A~0#1 + main_~r~0#1) == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {1485#(<= ~counter~0 4)} is VALID [2022-02-20 17:25:25,954 INFO L290 TraceCheckUtils]: 43: Hoare triple {1485#(<= ~counter~0 4)} ~cond := #in~cond; {1485#(<= ~counter~0 4)} is VALID [2022-02-20 17:25:25,954 INFO L290 TraceCheckUtils]: 44: Hoare triple {1485#(<= ~counter~0 4)} assume !(0 == ~cond); {1485#(<= ~counter~0 4)} is VALID [2022-02-20 17:25:25,954 INFO L290 TraceCheckUtils]: 45: Hoare triple {1485#(<= ~counter~0 4)} assume true; {1485#(<= ~counter~0 4)} is VALID [2022-02-20 17:25:25,955 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1485#(<= ~counter~0 4)} {1485#(<= ~counter~0 4)} #60#return; {1485#(<= ~counter~0 4)} is VALID [2022-02-20 17:25:25,955 INFO L290 TraceCheckUtils]: 47: Hoare triple {1485#(<= ~counter~0 4)} assume !!(0 != main_~r~0#1); {1485#(<= ~counter~0 4)} is VALID [2022-02-20 17:25:25,956 INFO L290 TraceCheckUtils]: 48: Hoare triple {1485#(<= ~counter~0 4)} assume main_~r~0#1 > 0;main_~r~0#1 := main_~r~0#1 - main_~v~0#1;main_~v~0#1 := 2 + main_~v~0#1; {1485#(<= ~counter~0 4)} is VALID [2022-02-20 17:25:25,956 INFO L290 TraceCheckUtils]: 49: Hoare triple {1485#(<= ~counter~0 4)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1513#(<= |ULTIMATE.start_main_#t~post6#1| 4)} is VALID [2022-02-20 17:25:25,956 INFO L290 TraceCheckUtils]: 50: Hoare triple {1513#(<= |ULTIMATE.start_main_#t~post6#1| 4)} assume !(main_#t~post6#1 < 5);havoc main_#t~post6#1; {1357#false} is VALID [2022-02-20 17:25:25,956 INFO L272 TraceCheckUtils]: 51: Hoare triple {1357#false} call __VERIFIER_assert((if 4 * main_~A~0#1 == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {1357#false} is VALID [2022-02-20 17:25:25,957 INFO L290 TraceCheckUtils]: 52: Hoare triple {1357#false} ~cond := #in~cond; {1357#false} is VALID [2022-02-20 17:25:25,957 INFO L290 TraceCheckUtils]: 53: Hoare triple {1357#false} assume 0 == ~cond; {1357#false} is VALID [2022-02-20 17:25:25,957 INFO L290 TraceCheckUtils]: 54: Hoare triple {1357#false} assume !false; {1357#false} is VALID [2022-02-20 17:25:25,957 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:25:25,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:25:26,154 INFO L290 TraceCheckUtils]: 54: Hoare triple {1357#false} assume !false; {1357#false} is VALID [2022-02-20 17:25:26,154 INFO L290 TraceCheckUtils]: 53: Hoare triple {1357#false} assume 0 == ~cond; {1357#false} is VALID [2022-02-20 17:25:26,154 INFO L290 TraceCheckUtils]: 52: Hoare triple {1357#false} ~cond := #in~cond; {1357#false} is VALID [2022-02-20 17:25:26,154 INFO L272 TraceCheckUtils]: 51: Hoare triple {1357#false} call __VERIFIER_assert((if 4 * main_~A~0#1 == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {1357#false} is VALID [2022-02-20 17:25:26,155 INFO L290 TraceCheckUtils]: 50: Hoare triple {1513#(<= |ULTIMATE.start_main_#t~post6#1| 4)} assume !(main_#t~post6#1 < 5);havoc main_#t~post6#1; {1357#false} is VALID [2022-02-20 17:25:26,155 INFO L290 TraceCheckUtils]: 49: Hoare triple {1485#(<= ~counter~0 4)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1513#(<= |ULTIMATE.start_main_#t~post6#1| 4)} is VALID [2022-02-20 17:25:26,156 INFO L290 TraceCheckUtils]: 48: Hoare triple {1485#(<= ~counter~0 4)} assume main_~r~0#1 > 0;main_~r~0#1 := main_~r~0#1 - main_~v~0#1;main_~v~0#1 := 2 + main_~v~0#1; {1485#(<= ~counter~0 4)} is VALID [2022-02-20 17:25:26,156 INFO L290 TraceCheckUtils]: 47: Hoare triple {1485#(<= ~counter~0 4)} assume !!(0 != main_~r~0#1); {1485#(<= ~counter~0 4)} is VALID [2022-02-20 17:25:26,156 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1356#true} {1485#(<= ~counter~0 4)} #60#return; {1485#(<= ~counter~0 4)} is VALID [2022-02-20 17:25:26,157 INFO L290 TraceCheckUtils]: 45: Hoare triple {1356#true} assume true; {1356#true} is VALID [2022-02-20 17:25:26,157 INFO L290 TraceCheckUtils]: 44: Hoare triple {1356#true} assume !(0 == ~cond); {1356#true} is VALID [2022-02-20 17:25:26,157 INFO L290 TraceCheckUtils]: 43: Hoare triple {1356#true} ~cond := #in~cond; {1356#true} is VALID [2022-02-20 17:25:26,157 INFO L272 TraceCheckUtils]: 42: Hoare triple {1485#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (main_~A~0#1 + main_~r~0#1) == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {1356#true} is VALID [2022-02-20 17:25:26,157 INFO L290 TraceCheckUtils]: 41: Hoare triple {1485#(<= ~counter~0 4)} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {1485#(<= ~counter~0 4)} is VALID [2022-02-20 17:25:26,158 INFO L290 TraceCheckUtils]: 40: Hoare triple {1457#(<= ~counter~0 3)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1485#(<= ~counter~0 4)} is VALID [2022-02-20 17:25:26,158 INFO L290 TraceCheckUtils]: 39: Hoare triple {1457#(<= ~counter~0 3)} assume main_~r~0#1 > 0;main_~r~0#1 := main_~r~0#1 - main_~v~0#1;main_~v~0#1 := 2 + main_~v~0#1; {1457#(<= ~counter~0 3)} is VALID [2022-02-20 17:25:26,158 INFO L290 TraceCheckUtils]: 38: Hoare triple {1457#(<= ~counter~0 3)} assume !!(0 != main_~r~0#1); {1457#(<= ~counter~0 3)} is VALID [2022-02-20 17:25:26,159 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1356#true} {1457#(<= ~counter~0 3)} #60#return; {1457#(<= ~counter~0 3)} is VALID [2022-02-20 17:25:26,159 INFO L290 TraceCheckUtils]: 36: Hoare triple {1356#true} assume true; {1356#true} is VALID [2022-02-20 17:25:26,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {1356#true} assume !(0 == ~cond); {1356#true} is VALID [2022-02-20 17:25:26,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {1356#true} ~cond := #in~cond; {1356#true} is VALID [2022-02-20 17:25:26,159 INFO L272 TraceCheckUtils]: 33: Hoare triple {1457#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (main_~A~0#1 + main_~r~0#1) == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {1356#true} is VALID [2022-02-20 17:25:26,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {1457#(<= ~counter~0 3)} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {1457#(<= ~counter~0 3)} is VALID [2022-02-20 17:25:26,160 INFO L290 TraceCheckUtils]: 31: Hoare triple {1429#(<= ~counter~0 2)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1457#(<= ~counter~0 3)} is VALID [2022-02-20 17:25:26,160 INFO L290 TraceCheckUtils]: 30: Hoare triple {1429#(<= ~counter~0 2)} assume main_~r~0#1 > 0;main_~r~0#1 := main_~r~0#1 - main_~v~0#1;main_~v~0#1 := 2 + main_~v~0#1; {1429#(<= ~counter~0 2)} is VALID [2022-02-20 17:25:26,160 INFO L290 TraceCheckUtils]: 29: Hoare triple {1429#(<= ~counter~0 2)} assume !!(0 != main_~r~0#1); {1429#(<= ~counter~0 2)} is VALID [2022-02-20 17:25:26,165 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1356#true} {1429#(<= ~counter~0 2)} #60#return; {1429#(<= ~counter~0 2)} is VALID [2022-02-20 17:25:26,165 INFO L290 TraceCheckUtils]: 27: Hoare triple {1356#true} assume true; {1356#true} is VALID [2022-02-20 17:25:26,165 INFO L290 TraceCheckUtils]: 26: Hoare triple {1356#true} assume !(0 == ~cond); {1356#true} is VALID [2022-02-20 17:25:26,165 INFO L290 TraceCheckUtils]: 25: Hoare triple {1356#true} ~cond := #in~cond; {1356#true} is VALID [2022-02-20 17:25:26,166 INFO L272 TraceCheckUtils]: 24: Hoare triple {1429#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (main_~A~0#1 + main_~r~0#1) == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {1356#true} is VALID [2022-02-20 17:25:26,166 INFO L290 TraceCheckUtils]: 23: Hoare triple {1429#(<= ~counter~0 2)} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {1429#(<= ~counter~0 2)} is VALID [2022-02-20 17:25:26,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {1401#(<= ~counter~0 1)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1429#(<= ~counter~0 2)} is VALID [2022-02-20 17:25:26,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {1401#(<= ~counter~0 1)} assume main_~r~0#1 > 0;main_~r~0#1 := main_~r~0#1 - main_~v~0#1;main_~v~0#1 := 2 + main_~v~0#1; {1401#(<= ~counter~0 1)} is VALID [2022-02-20 17:25:26,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {1401#(<= ~counter~0 1)} assume !!(0 != main_~r~0#1); {1401#(<= ~counter~0 1)} is VALID [2022-02-20 17:25:26,167 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1356#true} {1401#(<= ~counter~0 1)} #60#return; {1401#(<= ~counter~0 1)} is VALID [2022-02-20 17:25:26,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {1356#true} assume true; {1356#true} is VALID [2022-02-20 17:25:26,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {1356#true} assume !(0 == ~cond); {1356#true} is VALID [2022-02-20 17:25:26,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {1356#true} ~cond := #in~cond; {1356#true} is VALID [2022-02-20 17:25:26,168 INFO L272 TraceCheckUtils]: 15: Hoare triple {1401#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (main_~A~0#1 + main_~r~0#1) == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {1356#true} is VALID [2022-02-20 17:25:26,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {1401#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {1401#(<= ~counter~0 1)} is VALID [2022-02-20 17:25:26,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {1361#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1401#(<= ~counter~0 1)} is VALID [2022-02-20 17:25:26,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {1361#(<= ~counter~0 0)} main_~u~0#1 := 1 + 2 * main_~R~0#1;main_~v~0#1 := 1;main_~r~0#1 := main_~R~0#1 * main_~R~0#1 - main_~A~0#1; {1361#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:26,169 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1356#true} {1361#(<= ~counter~0 0)} #58#return; {1361#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:26,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {1356#true} assume true; {1356#true} is VALID [2022-02-20 17:25:26,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {1356#true} assume !(0 == ~cond); {1356#true} is VALID [2022-02-20 17:25:26,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {1356#true} ~cond := #in~cond; {1356#true} is VALID [2022-02-20 17:25:26,170 INFO L272 TraceCheckUtils]: 7: Hoare triple {1361#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if main_~A~0#1 < 0 && 0 != main_~A~0#1 % 2 then main_~A~0#1 % 2 - 2 else main_~A~0#1 % 2) then 1 else 0)); {1356#true} is VALID [2022-02-20 17:25:26,170 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1356#true} {1361#(<= ~counter~0 0)} #56#return; {1361#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:26,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {1356#true} assume true; {1356#true} is VALID [2022-02-20 17:25:26,170 INFO L290 TraceCheckUtils]: 4: Hoare triple {1356#true} assume !(0 == ~cond); {1356#true} is VALID [2022-02-20 17:25:26,170 INFO L290 TraceCheckUtils]: 3: Hoare triple {1356#true} ~cond := #in~cond; {1356#true} is VALID [2022-02-20 17:25:26,170 INFO L272 TraceCheckUtils]: 2: Hoare triple {1361#(<= ~counter~0 0)} call assume_abort_if_not((if (main_~R~0#1 - 1) * (main_~R~0#1 - 1) < main_~A~0#1 then 1 else 0)); {1356#true} is VALID [2022-02-20 17:25:26,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {1361#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1361#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:26,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {1356#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1361#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:26,172 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-20 17:25:26,172 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:25:26,172 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448185484] [2022-02-20 17:25:26,172 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:25:26,172 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055275554] [2022-02-20 17:25:26,172 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055275554] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:25:26,172 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:25:26,172 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2022-02-20 17:25:26,172 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062705480] [2022-02-20 17:25:26,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:25:26,174 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 6 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 55 [2022-02-20 17:25:26,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:25:26,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 6 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-02-20 17:25:26,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:26,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:25:26,220 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:25:26,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:25:26,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:25:26,221 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 6 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-02-20 17:25:26,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:26,361 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2022-02-20 17:25:26,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:25:26,362 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 6 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 55 [2022-02-20 17:25:26,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:25:26,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 6 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-02-20 17:25:26,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2022-02-20 17:25:26,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 6 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-02-20 17:25:26,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2022-02-20 17:25:26,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 71 transitions. [2022-02-20 17:25:26,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:26,406 INFO L225 Difference]: With dead ends: 66 [2022-02-20 17:25:26,406 INFO L226 Difference]: Without dead ends: 61 [2022-02-20 17:25:26,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:25:26,407 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:25:26,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 101 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:25:26,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-02-20 17:25:26,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-02-20 17:25:26,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:25:26,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:25:26,422 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:25:26,422 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:25:26,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:26,424 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-02-20 17:25:26,424 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2022-02-20 17:25:26,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:26,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:26,425 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 61 states. [2022-02-20 17:25:26,425 INFO L87 Difference]: Start difference. First operand has 61 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 61 states. [2022-02-20 17:25:26,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:26,427 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-02-20 17:25:26,427 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2022-02-20 17:25:26,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:26,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:26,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:25:26,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:25:26,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:25:26,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2022-02-20 17:25:26,429 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 55 [2022-02-20 17:25:26,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:25:26,430 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2022-02-20 17:25:26,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 6 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-02-20 17:25:26,430 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2022-02-20 17:25:26,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 17:25:26,431 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:25:26,431 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:25:26,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 17:25:26,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:25:26,651 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:25:26,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:25:26,651 INFO L85 PathProgramCache]: Analyzing trace with hash -611143683, now seen corresponding path program 3 times [2022-02-20 17:25:26,651 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:25:26,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019158802] [2022-02-20 17:25:26,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:26,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:25:26,665 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:25:26,665 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [583630233] [2022-02-20 17:25:26,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:25:26,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:25:26,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:25:26,667 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:25:26,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 17:25:27,417 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-02-20 17:25:27,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-02-20 17:25:27,417 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:25:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:25:27,475 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 17:25:27,475 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:25:27,476 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:25:27,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 17:25:27,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:25:27,679 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-02-20 17:25:27,681 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:25:27,696 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); [2022-02-20 17:25:27,696 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 17:25:27,705 INFO L158 Benchmark]: Toolchain (without parser) took 21557.11ms. Allocated memory was 96.5MB in the beginning and 136.3MB in the end (delta: 39.8MB). Free memory was 64.8MB in the beginning and 72.1MB in the end (delta: -7.3MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. [2022-02-20 17:25:27,705 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 51.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:25:27,705 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.03ms. Allocated memory is still 96.5MB. Free memory was 64.6MB in the beginning and 70.6MB in the end (delta: -6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:25:27,705 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.84ms. Allocated memory is still 96.5MB. Free memory was 70.6MB in the beginning and 69.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:25:27,706 INFO L158 Benchmark]: Boogie Preprocessor took 19.21ms. Allocated memory is still 96.5MB. Free memory was 69.0MB in the beginning and 67.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:25:27,706 INFO L158 Benchmark]: RCFGBuilder took 293.76ms. Allocated memory is still 96.5MB. Free memory was 67.9MB in the beginning and 56.8MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:25:27,706 INFO L158 Benchmark]: TraceAbstraction took 20969.15ms. Allocated memory was 96.5MB in the beginning and 136.3MB in the end (delta: 39.8MB). Free memory was 56.4MB in the beginning and 72.1MB in the end (delta: -15.7MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2022-02-20 17:25:27,707 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 51.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.03ms. Allocated memory is still 96.5MB. Free memory was 64.6MB in the beginning and 70.6MB in the end (delta: -6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.84ms. Allocated memory is still 96.5MB. Free memory was 70.6MB in the beginning and 69.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.21ms. Allocated memory is still 96.5MB. Free memory was 69.0MB in the beginning and 67.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 293.76ms. Allocated memory is still 96.5MB. Free memory was 67.9MB in the beginning and 56.8MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 20969.15ms. Allocated memory was 96.5MB in the beginning and 136.3MB in the end (delta: 39.8MB). Free memory was 56.4MB in the beginning and 72.1MB in the end (delta: -15.7MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 17:25:27,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/nla-digbench-scaling/fermat2-ll_unwindbound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 a8eb1c4cff73de825c0246f8cf2782e4a89e8227445b840b0a85ffef021d29c3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:25:29,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:25:29,317 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:25:29,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:25:29,336 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:25:29,339 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:25:29,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:25:29,345 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:25:29,347 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:25:29,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:25:29,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:25:29,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:25:29,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:25:29,356 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:25:29,357 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:25:29,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:25:29,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:25:29,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:25:29,363 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:25:29,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:25:29,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:25:29,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:25:29,371 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:25:29,372 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:25:29,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:25:29,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:25:29,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:25:29,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:25:29,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:25:29,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:25:29,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:25:29,380 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:25:29,381 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:25:29,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:25:29,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:25:29,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:25:29,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:25:29,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:25:29,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:25:29,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:25:29,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:25:29,390 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 17:25:29,411 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:25:29,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:25:29,412 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:25:29,412 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:25:29,413 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:25:29,413 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:25:29,414 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:25:29,414 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:25:29,414 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:25:29,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:25:29,415 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:25:29,415 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:25:29,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:25:29,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:25:29,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:25:29,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:25:29,416 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 17:25:29,416 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 17:25:29,416 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 17:25:29,416 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:25:29,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:25:29,417 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:25:29,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:25:29,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:25:29,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:25:29,417 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:25:29,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:25:29,422 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:25:29,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:25:29,423 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:25:29,423 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 17:25:29,423 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 17:25:29,423 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:25:29,423 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:25:29,424 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:25:29,424 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 17:25:29,424 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> a8eb1c4cff73de825c0246f8cf2782e4a89e8227445b840b0a85ffef021d29c3 [2022-02-20 17:25:29,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:25:29,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:25:29,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:25:29,693 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:25:29,694 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:25:29,695 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound5.c [2022-02-20 17:25:29,759 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9ca7f4b9/95a60088226e4741b78e7110c7955862/FLAG46cb10207 [2022-02-20 17:25:30,094 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:25:30,095 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound5.c [2022-02-20 17:25:30,100 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9ca7f4b9/95a60088226e4741b78e7110c7955862/FLAG46cb10207 [2022-02-20 17:25:30,520 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9ca7f4b9/95a60088226e4741b78e7110c7955862 [2022-02-20 17:25:30,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:25:30,523 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:25:30,524 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:25:30,524 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:25:30,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:25:30,528 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:25:30" (1/1) ... [2022-02-20 17:25:30,529 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7567ff4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:30, skipping insertion in model container [2022-02-20 17:25:30,530 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:25:30" (1/1) ... [2022-02-20 17:25:30,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:25:30,546 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:25:30,652 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/nla-digbench-scaling/fermat2-ll_unwindbound5.c[524,537] [2022-02-20 17:25:30,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:25:30,697 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:25:30,713 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/nla-digbench-scaling/fermat2-ll_unwindbound5.c[524,537] [2022-02-20 17:25:30,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:25:30,750 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:25:30,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:30 WrapperNode [2022-02-20 17:25:30,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:25:30,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:25:30,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:25:30,751 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:25:30,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:30" (1/1) ... [2022-02-20 17:25:30,764 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:30" (1/1) ... [2022-02-20 17:25:30,783 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2022-02-20 17:25:30,784 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:25:30,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:25:30,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:25:30,785 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:25:30,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:30" (1/1) ... [2022-02-20 17:25:30,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:30" (1/1) ... [2022-02-20 17:25:30,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:30" (1/1) ... [2022-02-20 17:25:30,799 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:30" (1/1) ... [2022-02-20 17:25:30,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:30" (1/1) ... [2022-02-20 17:25:30,814 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:30" (1/1) ... [2022-02-20 17:25:30,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:30" (1/1) ... [2022-02-20 17:25:30,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:25:30,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:25:30,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:25:30,820 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:25:30,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:30" (1/1) ... [2022-02-20 17:25:30,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:25:30,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:25:30,842 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 17:25:30,850 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 17:25:30,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:25:30,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 17:25:30,872 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:25:30,873 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:25:30,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:25:30,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:25:30,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:25:30,873 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:25:30,912 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:25:30,913 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:25:31,112 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:25:31,116 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:25:31,116 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:25:31,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:25:31 BoogieIcfgContainer [2022-02-20 17:25:31,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:25:31,119 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:25:31,119 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:25:31,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:25:31,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:25:30" (1/3) ... [2022-02-20 17:25:31,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2e3f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:25:31, skipping insertion in model container [2022-02-20 17:25:31,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:30" (2/3) ... [2022-02-20 17:25:31,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2e3f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:25:31, skipping insertion in model container [2022-02-20 17:25:31,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:25:31" (3/3) ... [2022-02-20 17:25:31,123 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound5.c [2022-02-20 17:25:31,126 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:25:31,127 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:25:31,194 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:25:31,207 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 17:25:31,218 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:25:31,230 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:25:31,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:25:31,233 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:25:31,234 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:25:31,234 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:25:31,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:25:31,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1086166160, now seen corresponding path program 1 times [2022-02-20 17:25:31,245 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:25:31,245 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38428203] [2022-02-20 17:25:31,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:31,246 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:25:31,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:25:31,255 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:25:31,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 17:25:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:31,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 17:25:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:31,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:25:31,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {28#true} is VALID [2022-02-20 17:25:31,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {28#true} is VALID [2022-02-20 17:25:31,443 INFO L272 TraceCheckUtils]: 2: Hoare triple {28#true} call assume_abort_if_not((if ~bvslt64(~bvmul64(~bvsub64(~sign_extendFrom32To64(main_~R~0#1), 1bv64), ~bvsub64(~sign_extendFrom32To64(main_~R~0#1), 1bv64)), ~sign_extendFrom32To64(main_~A~0#1)) then 1bv32 else 0bv32)); {28#true} is VALID [2022-02-20 17:25:31,443 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:25:31,444 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#true} assume 0bv32 == ~cond;assume false; {28#true} is VALID [2022-02-20 17:25:31,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} assume true; {28#true} is VALID [2022-02-20 17:25:31,444 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {28#true} {28#true} #56#return; {28#true} is VALID [2022-02-20 17:25:31,444 INFO L272 TraceCheckUtils]: 7: Hoare triple {28#true} call assume_abort_if_not((if 1bv32 == ~bvsrem32(main_~A~0#1, 2bv32) then 1bv32 else 0bv32)); {28#true} is VALID [2022-02-20 17:25:31,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:25:31,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#true} assume 0bv32 == ~cond;assume false; {28#true} is VALID [2022-02-20 17:25:31,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#true} assume true; {28#true} is VALID [2022-02-20 17:25:31,445 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {28#true} {28#true} #58#return; {28#true} is VALID [2022-02-20 17:25:31,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {28#true} main_~u~0#1 := ~bvadd64(1bv64, ~bvmul64(2bv64, ~sign_extendFrom32To64(main_~R~0#1)));main_~v~0#1 := 1bv64;main_~r~0#1 := ~bvsub64(~bvmul64(~sign_extendFrom32To64(main_~R~0#1), ~sign_extendFrom32To64(main_~R~0#1)), ~sign_extendFrom32To64(main_~A~0#1)); {28#true} is VALID [2022-02-20 17:25:31,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-02-20 17:25:31,446 INFO L272 TraceCheckUtils]: 14: Hoare triple {29#false} call __VERIFIER_assert((if ~bvmul64(4bv64, ~sign_extendFrom32To64(main_~A~0#1)) == ~bvadd64(~bvsub64(~bvsub64(~bvmul64(main_~u~0#1, main_~u~0#1), ~bvmul64(main_~v~0#1, main_~v~0#1)), ~bvmul64(2bv64, main_~u~0#1)), ~bvmul64(2bv64, main_~v~0#1)) then 1bv32 else 0bv32)); {29#false} is VALID [2022-02-20 17:25:31,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-02-20 17:25:31,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {29#false} assume 0bv32 == ~cond; {29#false} is VALID [2022-02-20 17:25:31,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 17:25:31,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:25:31,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:25:31,448 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:25:31,448 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38428203] [2022-02-20 17:25:31,448 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38428203] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:25:31,449 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:25:31,449 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:25:31,450 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707702208] [2022-02-20 17:25:31,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:25:31,454 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 17:25:31,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:25:31,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:25:31,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:31,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:25:31,564 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:25:31,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:25:31,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:25:31,579 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:25:32,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:32,148 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-02-20 17:25:32,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:25:32,148 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 17:25:32,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:25:32,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:25:32,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2022-02-20 17:25:32,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:25:32,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2022-02-20 17:25:32,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 64 transitions. [2022-02-20 17:25:32,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:32,767 INFO L225 Difference]: With dead ends: 47 [2022-02-20 17:25:32,768 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 17:25:32,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:25:32,772 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:25:32,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:25:32,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 17:25:32,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 17:25:32,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:25:32,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:32,792 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:32,792 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:32,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:32,795 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-20 17:25:32,795 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-20 17:25:32,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:32,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:32,796 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 21 states. [2022-02-20 17:25:32,796 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 21 states. [2022-02-20 17:25:32,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:32,798 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-20 17:25:32,798 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-20 17:25:32,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:32,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:32,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:25:32,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:25:32,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:32,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-02-20 17:25:32,809 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2022-02-20 17:25:32,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:25:32,809 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-02-20 17:25:32,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:25:32,809 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-20 17:25:32,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:25:32,810 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:25:32,810 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:25:32,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:25:33,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:25:33,012 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:25:33,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:25:33,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1345709874, now seen corresponding path program 1 times [2022-02-20 17:25:33,014 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:25:33,015 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740696481] [2022-02-20 17:25:33,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:33,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:25:33,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:25:33,016 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:25:33,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 17:25:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:33,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:25:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:33,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:25:33,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {215#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {220#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:25:33,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {220#(= ~counter~0 (_ bv0 32))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {220#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:25:33,286 INFO L272 TraceCheckUtils]: 2: Hoare triple {220#(= ~counter~0 (_ bv0 32))} call assume_abort_if_not((if ~bvslt64(~bvmul64(~bvsub64(~sign_extendFrom32To64(main_~R~0#1), 1bv64), ~bvsub64(~sign_extendFrom32To64(main_~R~0#1), 1bv64)), ~sign_extendFrom32To64(main_~A~0#1)) then 1bv32 else 0bv32)); {220#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:25:33,287 INFO L290 TraceCheckUtils]: 3: Hoare triple {220#(= ~counter~0 (_ bv0 32))} ~cond := #in~cond; {220#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:25:33,287 INFO L290 TraceCheckUtils]: 4: Hoare triple {220#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == ~cond); {220#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:25:33,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {220#(= ~counter~0 (_ bv0 32))} assume true; {220#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:25:33,290 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {220#(= ~counter~0 (_ bv0 32))} {220#(= ~counter~0 (_ bv0 32))} #56#return; {220#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:25:33,291 INFO L272 TraceCheckUtils]: 7: Hoare triple {220#(= ~counter~0 (_ bv0 32))} call assume_abort_if_not((if 1bv32 == ~bvsrem32(main_~A~0#1, 2bv32) then 1bv32 else 0bv32)); {220#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:25:33,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {220#(= ~counter~0 (_ bv0 32))} ~cond := #in~cond; {220#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:25:33,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {220#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == ~cond); {220#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:25:33,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {220#(= ~counter~0 (_ bv0 32))} assume true; {220#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:25:33,293 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {220#(= ~counter~0 (_ bv0 32))} {220#(= ~counter~0 (_ bv0 32))} #58#return; {220#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:25:33,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {220#(= ~counter~0 (_ bv0 32))} main_~u~0#1 := ~bvadd64(1bv64, ~bvmul64(2bv64, ~sign_extendFrom32To64(main_~R~0#1)));main_~v~0#1 := 1bv64;main_~r~0#1 := ~bvsub64(~bvmul64(~sign_extendFrom32To64(main_~R~0#1), ~sign_extendFrom32To64(main_~R~0#1)), ~sign_extendFrom32To64(main_~A~0#1)); {220#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:25:33,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {220#(= ~counter~0 (_ bv0 32))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {260#(= |ULTIMATE.start_main_#t~post6#1| (_ bv0 32))} is VALID [2022-02-20 17:25:33,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {260#(= |ULTIMATE.start_main_#t~post6#1| (_ bv0 32))} assume !~bvslt32(main_#t~post6#1, 5bv32);havoc main_#t~post6#1; {216#false} is VALID [2022-02-20 17:25:33,295 INFO L272 TraceCheckUtils]: 15: Hoare triple {216#false} call __VERIFIER_assert((if ~bvmul64(4bv64, ~sign_extendFrom32To64(main_~A~0#1)) == ~bvadd64(~bvsub64(~bvsub64(~bvmul64(main_~u~0#1, main_~u~0#1), ~bvmul64(main_~v~0#1, main_~v~0#1)), ~bvmul64(2bv64, main_~u~0#1)), ~bvmul64(2bv64, main_~v~0#1)) then 1bv32 else 0bv32)); {216#false} is VALID [2022-02-20 17:25:33,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {216#false} ~cond := #in~cond; {216#false} is VALID [2022-02-20 17:25:33,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {216#false} assume 0bv32 == ~cond; {216#false} is VALID [2022-02-20 17:25:33,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {216#false} assume !false; {216#false} is VALID [2022-02-20 17:25:33,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:25:33,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:25:33,296 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:25:33,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740696481] [2022-02-20 17:25:33,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740696481] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:25:33,297 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:25:33,297 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:25:33,298 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502213464] [2022-02-20 17:25:33,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:25:33,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:25:33,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:25:33,303 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), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:25:33,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:33,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:25:33,429 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:25:33,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:25:33,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:25:33,430 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:25:35,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:35,232 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-02-20 17:25:35,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:25:35,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:25:35,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:25:35,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:25:35,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-02-20 17:25:35,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:25:35,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-02-20 17:25:35,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2022-02-20 17:25:35,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:35,506 INFO L225 Difference]: With dead ends: 30 [2022-02-20 17:25:35,506 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 17:25:35,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:25:35,507 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:25:35,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:25:35,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 17:25:35,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 17:25:35,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:25:35,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:35,513 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:35,514 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:35,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:35,515 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 17:25:35,516 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 17:25:35,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:35,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:35,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 23 states. [2022-02-20 17:25:35,517 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 23 states. [2022-02-20 17:25:35,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:35,519 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 17:25:35,519 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 17:25:35,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:35,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:35,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:25:35,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:25:35,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:35,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-02-20 17:25:35,521 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2022-02-20 17:25:35,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:25:35,522 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-02-20 17:25:35,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:25:35,522 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 17:25:35,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:25:35,523 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:25:35,523 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:25:35,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 17:25:35,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:25:35,732 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:25:35,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:25:35,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1347497334, now seen corresponding path program 1 times [2022-02-20 17:25:35,733 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:25:35,733 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101446000] [2022-02-20 17:25:35,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:35,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:25:35,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:25:35,739 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:25:35,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process