./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound20.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 49ad15a378f82eb46c5309a80aca8c6c5eb2b292a6d759bef0e14aac07d4d52c --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 05:20:54,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 05:20:54,511 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 05:20:54,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 05:20:54,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 05:20:54,536 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 05:20:54,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 05:20:54,539 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 05:20:54,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 05:20:54,541 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 05:20:54,542 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 05:20:54,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 05:20:54,544 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 05:20:54,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 05:20:54,545 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 05:20:54,546 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 05:20:54,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 05:20:54,548 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 05:20:54,549 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 05:20:54,551 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 05:20:54,552 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 05:20:54,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 05:20:54,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 05:20:54,561 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 05:20:54,563 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 05:20:54,566 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 05:20:54,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 05:20:54,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 05:20:54,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 05:20:54,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 05:20:54,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 05:20:54,571 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 05:20:54,572 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 05:20:54,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 05:20:54,574 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 05:20:54,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 05:20:54,578 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 05:20:54,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 05:20:54,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 05:20:54,579 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 05:20:54,579 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 05:20:54,581 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 05:20:54,583 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 05:20:54,614 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 05:20:54,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 05:20:54,614 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 05:20:54,615 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 05:20:54,615 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 05:20:54,615 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 05:20:54,615 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 05:20:54,616 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 05:20:54,616 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 05:20:54,616 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 05:20:54,616 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 05:20:54,616 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 05:20:54,616 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 05:20:54,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 05:20:54,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 05:20:54,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 05:20:54,616 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 05:20:54,616 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 05:20:54,617 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 05:20:54,617 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 05:20:54,617 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 05:20:54,617 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 05:20:54,617 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 05:20:54,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 05:20:54,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 05:20:54,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 05:20:54,617 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 05:20:54,617 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 05:20:54,618 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 05:20:54,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 05:20:54,618 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 05:20:54,618 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 05:20:54,618 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 05:20:54,618 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 -> 49ad15a378f82eb46c5309a80aca8c6c5eb2b292a6d759bef0e14aac07d4d52c [2022-07-12 05:20:54,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 05:20:54,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 05:20:54,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 05:20:54,878 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 05:20:54,879 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 05:20:54,880 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound20.c [2022-07-12 05:20:54,943 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f684e6454/756af586a8f9468e975d6fffcaa90a3a/FLAG49f8cc82e [2022-07-12 05:20:55,272 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 05:20:55,272 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound20.c [2022-07-12 05:20:55,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f684e6454/756af586a8f9468e975d6fffcaa90a3a/FLAG49f8cc82e [2022-07-12 05:20:55,287 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f684e6454/756af586a8f9468e975d6fffcaa90a3a [2022-07-12 05:20:55,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 05:20:55,291 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 05:20:55,294 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 05:20:55,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 05:20:55,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 05:20:55,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:20:55" (1/1) ... [2022-07-12 05:20:55,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1421c3d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:20:55, skipping insertion in model container [2022-07-12 05:20:55,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:20:55" (1/1) ... [2022-07-12 05:20:55,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 05:20:55,311 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 05:20:55,449 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/prodbin-ll_unwindbound20.c[537,550] [2022-07-12 05:20:55,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 05:20:55,479 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 05:20:55,490 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/prodbin-ll_unwindbound20.c[537,550] [2022-07-12 05:20:55,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 05:20:55,512 INFO L208 MainTranslator]: Completed translation [2022-07-12 05:20:55,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:20:55 WrapperNode [2022-07-12 05:20:55,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 05:20:55,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 05:20:55,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 05:20:55,514 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 05:20:55,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:20:55" (1/1) ... [2022-07-12 05:20:55,524 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:20:55" (1/1) ... [2022-07-12 05:20:55,538 INFO L137 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2022-07-12 05:20:55,538 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 05:20:55,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 05:20:55,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 05:20:55,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 05:20:55,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:20:55" (1/1) ... [2022-07-12 05:20:55,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:20:55" (1/1) ... [2022-07-12 05:20:55,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:20:55" (1/1) ... [2022-07-12 05:20:55,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:20:55" (1/1) ... [2022-07-12 05:20:55,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:20:55" (1/1) ... [2022-07-12 05:20:55,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:20:55" (1/1) ... [2022-07-12 05:20:55,558 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:20:55" (1/1) ... [2022-07-12 05:20:55,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 05:20:55,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 05:20:55,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 05:20:55,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 05:20:55,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:20:55" (1/1) ... [2022-07-12 05:20:55,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 05:20:55,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:20:55,593 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 05:20:55,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 05:20:55,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 05:20:55,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 05:20:55,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 05:20:55,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 05:20:55,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 05:20:55,622 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 05:20:55,665 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 05:20:55,666 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 05:20:55,765 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 05:20:55,770 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 05:20:55,770 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 05:20:55,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:20:55 BoogieIcfgContainer [2022-07-12 05:20:55,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 05:20:55,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 05:20:55,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 05:20:55,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 05:20:55,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 05:20:55" (1/3) ... [2022-07-12 05:20:55,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@508dfe1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:20:55, skipping insertion in model container [2022-07-12 05:20:55,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:20:55" (2/3) ... [2022-07-12 05:20:55,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@508dfe1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:20:55, skipping insertion in model container [2022-07-12 05:20:55,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:20:55" (3/3) ... [2022-07-12 05:20:55,801 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll_unwindbound20.c [2022-07-12 05:20:55,811 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 05:20:55,827 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 05:20:55,872 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 05:20:55,877 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@c6df576, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@68813be7 [2022-07-12 05:20:55,877 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 05:20:55,880 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 05:20:55,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 05:20:55,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:20:55,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:20:55,887 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:20:55,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:20:55,899 INFO L85 PathProgramCache]: Analyzing trace with hash -572597424, now seen corresponding path program 1 times [2022-07-12 05:20:55,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:20:55,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241335115] [2022-07-12 05:20:55,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:20:55,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:20:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:20:56,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 05:20:56,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:20:56,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241335115] [2022-07-12 05:20:56,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241335115] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:20:56,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:20:56,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 05:20:56,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21961724] [2022-07-12 05:20:56,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:20:56,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 05:20:56,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:20:56,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 05:20:56,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 05:20:56,069 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 05:20:56,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:20:56,083 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2022-07-12 05:20:56,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 05:20:56,085 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-12 05:20:56,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:20:56,098 INFO L225 Difference]: With dead ends: 39 [2022-07-12 05:20:56,098 INFO L226 Difference]: Without dead ends: 17 [2022-07-12 05:20:56,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-07-12 05:20:56,104 INFO L413 NwaCegarLoop]: 24 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, 24 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-07-12 05:20:56,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 05:20:56,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-12 05:20:56,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-12 05:20:56,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 05:20:56,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-07-12 05:20:56,141 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 9 [2022-07-12 05:20:56,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:20:56,141 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-07-12 05:20:56,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 05:20:56,142 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-07-12 05:20:56,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 05:20:56,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:20:56,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:20:56,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 05:20:56,143 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:20:56,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:20:56,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1986366499, now seen corresponding path program 1 times [2022-07-12 05:20:56,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:20:56,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926012049] [2022-07-12 05:20:56,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:20:56,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:20:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:20:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 05:20:56,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:20:56,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926012049] [2022-07-12 05:20:56,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926012049] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:20:56,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:20:56,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 05:20:56,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150043128] [2022-07-12 05:20:56,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:20:56,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 05:20:56,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:20:56,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 05:20:56,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 05:20:56,226 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 05:20:56,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:20:56,262 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-07-12 05:20:56,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 05:20:56,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 05:20:56,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:20:56,268 INFO L225 Difference]: With dead ends: 26 [2022-07-12 05:20:56,269 INFO L226 Difference]: Without dead ends: 19 [2022-07-12 05:20:56,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 05:20:56,270 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 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-07-12 05:20:56,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 05:20:56,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-12 05:20:56,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-12 05:20:56,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 05:20:56,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-07-12 05:20:56,289 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 10 [2022-07-12 05:20:56,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:20:56,289 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-07-12 05:20:56,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 05:20:56,290 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-07-12 05:20:56,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 05:20:56,290 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:20:56,290 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:20:56,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 05:20:56,290 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:20:56,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:20:56,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1984579039, now seen corresponding path program 1 times [2022-07-12 05:20:56,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:20:56,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311141047] [2022-07-12 05:20:56,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:20:56,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:20:56,306 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 05:20:56,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1234722538] [2022-07-12 05:20:56,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:20:56,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:20:56,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:20:56,310 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 05:20:56,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 05:20:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:20:56,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 05:20:56,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 05:20:56,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 05:20:56,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 05:20:56,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:20:56,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311141047] [2022-07-12 05:20:56,413 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 05:20:56,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234722538] [2022-07-12 05:20:56,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234722538] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:20:56,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:20:56,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 05:20:56,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097465737] [2022-07-12 05:20:56,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:20:56,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 05:20:56,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:20:56,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 05:20:56,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 05:20:56,418 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 05:20:56,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:20:56,471 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-07-12 05:20:56,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 05:20:56,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 05:20:56,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:20:56,473 INFO L225 Difference]: With dead ends: 30 [2022-07-12 05:20:56,474 INFO L226 Difference]: Without dead ends: 28 [2022-07-12 05:20:56,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-07-12 05:20:56,475 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 05:20:56,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 47 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 05:20:56,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-12 05:20:56,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-07-12 05:20:56,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 05:20:56,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-07-12 05:20:56,484 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 10 [2022-07-12 05:20:56,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:20:56,484 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-07-12 05:20:56,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 05:20:56,484 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-07-12 05:20:56,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 05:20:56,484 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:20:56,485 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:20:56,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 05:20:56,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:20:56,685 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:20:56,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:20:56,686 INFO L85 PathProgramCache]: Analyzing trace with hash 845350648, now seen corresponding path program 1 times [2022-07-12 05:20:56,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:20:56,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110959677] [2022-07-12 05:20:56,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:20:56,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:20:56,696 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 05:20:56,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [101696535] [2022-07-12 05:20:56,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:20:56,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:20:56,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:20:56,706 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 05:20:56,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 05:20:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:20:56,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 05:20:56,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 05:20:56,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 05:20:56,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 05:20:56,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:20:56,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110959677] [2022-07-12 05:20:56,778 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 05:20:56,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101696535] [2022-07-12 05:20:56,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101696535] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:20:56,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:20:56,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 05:20:56,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683515424] [2022-07-12 05:20:56,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:20:56,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 05:20:56,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:20:56,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 05:20:56,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 05:20:56,780 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 05:20:56,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:20:56,830 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-07-12 05:20:56,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 05:20:56,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-07-12 05:20:56,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:20:56,831 INFO L225 Difference]: With dead ends: 34 [2022-07-12 05:20:56,832 INFO L226 Difference]: Without dead ends: 27 [2022-07-12 05:20:56,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:20:56,834 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 05:20:56,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 38 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 05:20:56,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-12 05:20:56,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-07-12 05:20:56,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 05:20:56,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-07-12 05:20:56,846 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2022-07-12 05:20:56,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:20:56,847 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-07-12 05:20:56,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 05:20:56,847 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-07-12 05:20:56,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 05:20:56,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:20:56,848 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:20:56,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 05:20:57,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-12 05:20:57,061 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:20:57,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:20:57,061 INFO L85 PathProgramCache]: Analyzing trace with hash 905454657, now seen corresponding path program 1 times [2022-07-12 05:20:57,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:20:57,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118774283] [2022-07-12 05:20:57,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:20:57,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:20:57,068 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 05:20:57,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1678537951] [2022-07-12 05:20:57,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:20:57,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:20:57,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:20:57,070 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 05:20:57,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 05:20:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:20:57,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 05:20:57,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 05:20:57,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 05:20:57,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 05:20:57,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 05:20:57,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:20:57,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118774283] [2022-07-12 05:20:57,201 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 05:20:57,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678537951] [2022-07-12 05:20:57,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678537951] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 05:20:57,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 05:20:57,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-07-12 05:20:57,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033418742] [2022-07-12 05:20:57,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 05:20:57,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 05:20:57,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:20:57,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 05:20:57,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-12 05:20:57,205 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 05:20:57,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:20:57,273 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2022-07-12 05:20:57,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 05:20:57,273 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-07-12 05:20:57,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:20:57,275 INFO L225 Difference]: With dead ends: 62 [2022-07-12 05:20:57,275 INFO L226 Difference]: Without dead ends: 55 [2022-07-12 05:20:57,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 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-07-12 05:20:57,277 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 33 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 05:20:57,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 83 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 05:20:57,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-12 05:20:57,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2022-07-12 05:20:57,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 42 states have internal predecessors, (50), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 05:20:57,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-07-12 05:20:57,290 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 20 [2022-07-12 05:20:57,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:20:57,291 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-07-12 05:20:57,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 05:20:57,291 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-07-12 05:20:57,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 05:20:57,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:20:57,292 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:20:57,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-12 05:20:57,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:20:57,508 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:20:57,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:20:57,508 INFO L85 PathProgramCache]: Analyzing trace with hash 907242117, now seen corresponding path program 1 times [2022-07-12 05:20:57,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:20:57,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302797830] [2022-07-12 05:20:57,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:20:57,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:20:57,515 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 05:20:57,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [698583139] [2022-07-12 05:20:57,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:20:57,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:20:57,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:20:57,517 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-07-12 05:20:57,518 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-07-12 05:20:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:20:57,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-12 05:20:57,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 05:21:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 05:21:00,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 05:21:07,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 05:21:07,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:21:07,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302797830] [2022-07-12 05:21:07,521 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 05:21:07,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698583139] [2022-07-12 05:21:07,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698583139] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 05:21:07,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 05:21:07,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2022-07-12 05:21:07,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774897972] [2022-07-12 05:21:07,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 05:21:07,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 05:21:07,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:21:07,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 05:21:07,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-07-12 05:21:07,523 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 05:21:09,682 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-12 05:21:12,292 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-12 05:21:13,315 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-12 05:21:13,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:21:13,998 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2022-07-12 05:21:13,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 05:21:13,998 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-07-12 05:21:13,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:21:14,000 INFO L225 Difference]: With dead ends: 86 [2022-07-12 05:21:14,000 INFO L226 Difference]: Without dead ends: 84 [2022-07-12 05:21:14,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-07-12 05:21:14,001 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 29 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-12 05:21:14,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 93 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 166 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-07-12 05:21:14,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-12 05:21:14,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2022-07-12 05:21:14,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.2) internal successors, (72), 66 states have internal predecessors, (72), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-12 05:21:14,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2022-07-12 05:21:14,012 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 20 [2022-07-12 05:21:14,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:21:14,012 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2022-07-12 05:21:14,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 05:21:14,013 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2022-07-12 05:21:14,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 05:21:14,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:21:14,013 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:21:14,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-12 05:21:14,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:21:14,214 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:21:14,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:21:14,214 INFO L85 PathProgramCache]: Analyzing trace with hash 97895491, now seen corresponding path program 1 times [2022-07-12 05:21:14,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:21:14,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382652407] [2022-07-12 05:21:14,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:21:14,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:21:14,223 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 05:21:14,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2028997761] [2022-07-12 05:21:14,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:21:14,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:21:14,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:21:14,229 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-07-12 05:21:14,230 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-07-12 05:21:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:21:14,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 05:21:14,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 05:21:15,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 05:21:15,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 05:21:16,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 05:21:16,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:21:16,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382652407] [2022-07-12 05:21:16,268 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 05:21:16,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028997761] [2022-07-12 05:21:16,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028997761] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 05:21:16,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 05:21:16,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2022-07-12 05:21:16,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258230365] [2022-07-12 05:21:16,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 05:21:16,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 05:21:16,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:21:16,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 05:21:16,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-07-12 05:21:16,269 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 05:21:17,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:21:17,214 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2022-07-12 05:21:17,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 05:21:17,214 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-07-12 05:21:17,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:21:17,215 INFO L225 Difference]: With dead ends: 111 [2022-07-12 05:21:17,215 INFO L226 Difference]: Without dead ends: 102 [2022-07-12 05:21:17,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2022-07-12 05:21:17,216 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 75 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 05:21:17,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 86 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 05:21:17,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-12 05:21:17,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2022-07-12 05:21:17,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 76 states have internal predecessors, (86), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-12 05:21:17,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2022-07-12 05:21:17,223 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 20 [2022-07-12 05:21:17,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:21:17,223 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2022-07-12 05:21:17,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 05:21:17,223 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2022-07-12 05:21:17,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 05:21:17,223 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:21:17,223 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:21:17,243 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-07-12 05:21:17,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:21:17,435 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:21:17,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:21:17,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1470880860, now seen corresponding path program 1 times [2022-07-12 05:21:17,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:21:17,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415593791] [2022-07-12 05:21:17,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:21:17,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:21:17,442 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 05:21:17,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1939675695] [2022-07-12 05:21:17,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:21:17,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:21:17,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:21:17,446 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-07-12 05:21:17,446 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-07-12 05:21:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:21:17,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 05:21:17,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 05:21:17,525 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 05:21:17,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 05:21:17,580 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 05:21:17,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:21:17,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415593791] [2022-07-12 05:21:17,581 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 05:21:17,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939675695] [2022-07-12 05:21:17,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939675695] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 05:21:17,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 05:21:17,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-07-12 05:21:17,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931324592] [2022-07-12 05:21:17,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 05:21:17,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 05:21:17,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:21:17,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 05:21:17,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:21:17,582 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 05:21:19,586 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-12 05:21:19,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:21:19,644 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2022-07-12 05:21:19,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 05:21:19,644 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-07-12 05:21:19,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:21:19,645 INFO L225 Difference]: With dead ends: 104 [2022-07-12 05:21:19,645 INFO L226 Difference]: Without dead ends: 89 [2022-07-12 05:21:19,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-07-12 05:21:19,646 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-12 05:21:19,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 61 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-12 05:21:19,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-12 05:21:19,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2022-07-12 05:21:19,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.1428571428571428) internal successors, (80), 73 states have internal predecessors, (80), 9 states have call successors, (9), 8 states have call predecessors, (9), 8 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-12 05:21:19,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2022-07-12 05:21:19,652 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 26 [2022-07-12 05:21:19,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:21:19,652 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2022-07-12 05:21:19,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 05:21:19,653 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2022-07-12 05:21:19,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 05:21:19,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:21:19,653 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:21:19,673 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-07-12 05:21:19,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:21:19,871 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:21:19,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:21:19,871 INFO L85 PathProgramCache]: Analyzing trace with hash 103630759, now seen corresponding path program 1 times [2022-07-12 05:21:19,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:21:19,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566523960] [2022-07-12 05:21:19,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:21:19,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:21:19,877 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 05:21:19,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1266967024] [2022-07-12 05:21:19,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:21:19,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:21:19,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:21:19,882 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-07-12 05:21:19,882 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-07-12 05:21:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:21:19,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-12 05:21:19,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 05:21:28,257 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 05:21:28,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 05:21:32,786 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 05:21:32,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:21:32,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566523960] [2022-07-12 05:21:32,787 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 05:21:32,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266967024] [2022-07-12 05:21:32,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266967024] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 05:21:32,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 05:21:32,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 20 [2022-07-12 05:21:32,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454122277] [2022-07-12 05:21:32,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 05:21:32,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 05:21:32,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:21:32,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 05:21:32,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=305, Unknown=1, NotChecked=0, Total=380 [2022-07-12 05:21:32,789 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 18 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 05:21:35,909 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-12 05:21:38,277 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-12 05:21:39,550 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-07-12 05:21:44,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:21:44,654 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-07-12 05:21:44,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 05:21:44,655 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 18 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 30 [2022-07-12 05:21:44,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:21:44,655 INFO L225 Difference]: With dead ends: 110 [2022-07-12 05:21:44,655 INFO L226 Difference]: Without dead ends: 108 [2022-07-12 05:21:44,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=117, Invalid=482, Unknown=1, NotChecked=0, Total=600 [2022-07-12 05:21:44,656 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 39 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-07-12 05:21:44,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 121 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 169 Invalid, 0 Unknown, 28 Unchecked, 7.3s Time] [2022-07-12 05:21:44,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-12 05:21:44,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 70. [2022-07-12 05:21:44,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 58 states have internal predecessors, (65), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 05:21:44,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2022-07-12 05:21:44,662 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 30 [2022-07-12 05:21:44,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:21:44,662 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2022-07-12 05:21:44,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 18 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 05:21:44,663 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2022-07-12 05:21:44,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 05:21:44,665 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:21:44,665 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:21:44,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-12 05:21:44,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:21:44,879 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:21:44,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:21:44,880 INFO L85 PathProgramCache]: Analyzing trace with hash -957536403, now seen corresponding path program 2 times [2022-07-12 05:21:44,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:21:44,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551022791] [2022-07-12 05:21:44,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:21:44,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:21:44,886 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 05:21:44,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [797896425] [2022-07-12 05:21:44,886 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 05:21:44,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:21:44,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:21:44,888 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 05:21:44,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 05:21:44,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 05:21:44,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 05:21:44,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 05:21:44,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 05:21:45,010 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 05:21:45,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 05:21:45,087 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 05:21:45,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:21:45,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551022791] [2022-07-12 05:21:45,087 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 05:21:45,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797896425] [2022-07-12 05:21:45,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797896425] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 05:21:45,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 05:21:45,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-07-12 05:21:45,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122193462] [2022-07-12 05:21:45,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 05:21:45,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 05:21:45,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:21:45,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 05:21:45,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-07-12 05:21:45,088 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-12 05:21:45,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:21:45,211 INFO L93 Difference]: Finished difference Result 250 states and 287 transitions. [2022-07-12 05:21:45,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 05:21:45,212 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 50 [2022-07-12 05:21:45,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:21:45,213 INFO L225 Difference]: With dead ends: 250 [2022-07-12 05:21:45,213 INFO L226 Difference]: Without dead ends: 243 [2022-07-12 05:21:45,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-07-12 05:21:45,214 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 114 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 05:21:45,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 146 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 05:21:45,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-07-12 05:21:45,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 233. [2022-07-12 05:21:45,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 185 states have (on average 1.1405405405405404) internal successors, (211), 192 states have internal predecessors, (211), 24 states have call successors, (24), 23 states have call predecessors, (24), 23 states have return successors, (23), 17 states have call predecessors, (23), 23 states have call successors, (23) [2022-07-12 05:21:45,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 258 transitions. [2022-07-12 05:21:45,234 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 258 transitions. Word has length 50 [2022-07-12 05:21:45,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:21:45,234 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 258 transitions. [2022-07-12 05:21:45,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-12 05:21:45,234 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 258 transitions. [2022-07-12 05:21:45,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 05:21:45,235 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:21:45,236 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-12 05:21:45,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 05:21:45,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-12 05:21:45,456 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:21:45,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:21:45,456 INFO L85 PathProgramCache]: Analyzing trace with hash 535727021, now seen corresponding path program 2 times [2022-07-12 05:21:45,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:21:45,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746181410] [2022-07-12 05:21:45,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:21:45,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:21:45,462 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 05:21:45,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1785790311] [2022-07-12 05:21:45,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 05:21:45,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:21:45,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:21:45,463 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 05:21:45,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 05:21:45,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 05:21:45,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 05:21:45,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-12 05:21:45,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 05:21:52,920 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 18 proven. 50 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 05:21:52,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 05:21:58,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:21:58,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746181410] [2022-07-12 05:21:58,450 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 05:21:58,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785790311] [2022-07-12 05:21:58,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785790311] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 05:21:58,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-12 05:21:58,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-07-12 05:21:58,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780430508] [2022-07-12 05:21:58,450 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-12 05:21:58,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 05:21:58,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:21:58,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 05:21:58,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2022-07-12 05:21:58,451 INFO L87 Difference]: Start difference. First operand 233 states and 258 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 05:22:00,974 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-12 05:22:03,240 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-12 05:22:04,594 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-12 05:22:07,136 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-12 05:22:08,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:22:08,467 INFO L93 Difference]: Finished difference Result 379 states and 438 transitions. [2022-07-12 05:22:08,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 05:22:08,468 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 50 [2022-07-12 05:22:08,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:22:08,470 INFO L225 Difference]: With dead ends: 379 [2022-07-12 05:22:08,470 INFO L226 Difference]: Without dead ends: 377 [2022-07-12 05:22:08,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=225, Invalid=1181, Unknown=0, NotChecked=0, Total=1406 [2022-07-12 05:22:08,471 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 56 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-07-12 05:22:08,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 205 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 303 Invalid, 1 Unknown, 27 Unchecked, 9.1s Time] [2022-07-12 05:22:08,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-07-12 05:22:08,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 239. [2022-07-12 05:22:08,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 190 states have (on average 1.1421052631578947) internal successors, (217), 197 states have internal predecessors, (217), 25 states have call successors, (25), 23 states have call predecessors, (25), 23 states have return successors, (24), 18 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-12 05:22:08,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 266 transitions. [2022-07-12 05:22:08,485 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 266 transitions. Word has length 50 [2022-07-12 05:22:08,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:22:08,486 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 266 transitions. [2022-07-12 05:22:08,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 05:22:08,486 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 266 transitions. [2022-07-12 05:22:08,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 05:22:08,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:22:08,487 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:22:08,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-12 05:22:08,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:22:08,703 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:22:08,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:22:08,704 INFO L85 PathProgramCache]: Analyzing trace with hash 26253931, now seen corresponding path program 3 times [2022-07-12 05:22:08,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:22:08,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994950551] [2022-07-12 05:22:08,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:22:08,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:22:08,711 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 05:22:08,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1031306274] [2022-07-12 05:22:08,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 05:22:08,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:22:08,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:22:08,715 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 05:22:08,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 05:22:08,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-12 05:22:08,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 05:22:08,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-12 05:22:08,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 05:22:09,773 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 16 proven. 49 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 05:22:09,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 05:22:14,626 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 34 proven. 31 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 05:22:14,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:22:14,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994950551] [2022-07-12 05:22:14,627 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 05:22:14,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031306274] [2022-07-12 05:22:14,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031306274] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 05:22:14,627 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 05:22:14,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 29 [2022-07-12 05:22:14,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320389930] [2022-07-12 05:22:14,627 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 05:22:14,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-12 05:22:14,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:22:14,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-12 05:22:14,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=636, Unknown=1, NotChecked=0, Total=812 [2022-07-12 05:22:14,629 INFO L87 Difference]: Start difference. First operand 239 states and 266 transitions. Second operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-12 05:22:18,273 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-12 05:22:27,056 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-12 05:22:31,530 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-12 05:22:32,561 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-12 05:22:41,797 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-12 05:22:43,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:22:43,043 INFO L93 Difference]: Finished difference Result 266 states and 297 transitions. [2022-07-12 05:22:43,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 05:22:43,044 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 50 [2022-07-12 05:22:43,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:22:43,046 INFO L225 Difference]: With dead ends: 266 [2022-07-12 05:22:43,046 INFO L226 Difference]: Without dead ends: 262 [2022-07-12 05:22:43,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=623, Invalid=1926, Unknown=1, NotChecked=0, Total=2550 [2022-07-12 05:22:43,048 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 118 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 91 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2022-07-12 05:22:43,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 125 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 305 Invalid, 3 Unknown, 0 Unchecked, 14.2s Time] [2022-07-12 05:22:43,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-12 05:22:43,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 111. [2022-07-12 05:22:43,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 89 states have internal predecessors, (100), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 05:22:43,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2022-07-12 05:22:43,060 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 50 [2022-07-12 05:22:43,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:22:43,061 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2022-07-12 05:22:43,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-12 05:22:43,061 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2022-07-12 05:22:43,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-12 05:22:43,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:22:43,064 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:22:43,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 05:22:43,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-12 05:22:43,280 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:22:43,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:22:43,280 INFO L85 PathProgramCache]: Analyzing trace with hash -401903931, now seen corresponding path program 3 times [2022-07-12 05:22:43,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:22:43,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071159591] [2022-07-12 05:22:43,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:22:43,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:22:43,287 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 05:22:43,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2019860149] [2022-07-12 05:22:43,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 05:22:43,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:22:43,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:22:43,289 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 05:22:43,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 05:22:43,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-12 05:22:43,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 05:22:43,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 05:22:43,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 05:22:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 05:22:43,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 05:22:43,729 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-12 05:22:43,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:22:43,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071159591] [2022-07-12 05:22:43,730 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 05:22:43,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019860149] [2022-07-12 05:22:43,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019860149] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 05:22:43,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 05:22:43,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2022-07-12 05:22:43,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615042255] [2022-07-12 05:22:43,730 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 05:22:43,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 05:22:43,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:22:43,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 05:22:43,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-07-12 05:22:43,732 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand has 24 states, 24 states have (on average 5.958333333333333) internal successors, (143), 24 states have internal predecessors, (143), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-07-12 05:22:44,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:22:44,081 INFO L93 Difference]: Finished difference Result 216 states and 245 transitions. [2022-07-12 05:22:44,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-12 05:22:44,082 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.958333333333333) internal successors, (143), 24 states have internal predecessors, (143), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) Word has length 110 [2022-07-12 05:22:44,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:22:44,083 INFO L225 Difference]: With dead ends: 216 [2022-07-12 05:22:44,083 INFO L226 Difference]: Without dead ends: 211 [2022-07-12 05:22:44,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2022-07-12 05:22:44,085 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 187 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 05:22:44,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 236 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 05:22:44,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-12 05:22:44,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2022-07-12 05:22:44,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 169 states have (on average 1.1242603550295858) internal successors, (190), 169 states have internal predecessors, (190), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-07-12 05:22:44,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 231 transitions. [2022-07-12 05:22:44,097 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 231 transitions. Word has length 110 [2022-07-12 05:22:44,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:22:44,097 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 231 transitions. [2022-07-12 05:22:44,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.958333333333333) internal successors, (143), 24 states have internal predecessors, (143), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-07-12 05:22:44,098 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 231 transitions. [2022-07-12 05:22:44,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-07-12 05:22:44,099 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:22:44,100 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:22:44,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 05:22:44,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 05:22:44,315 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:22:44,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:22:44,316 INFO L85 PathProgramCache]: Analyzing trace with hash 141809069, now seen corresponding path program 4 times [2022-07-12 05:22:44,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:22:44,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484416398] [2022-07-12 05:22:44,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:22:44,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:22:44,326 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 05:22:44,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1862618298] [2022-07-12 05:22:44,326 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 05:22:44,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:22:44,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:22:44,327 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 05:22:44,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 05:22:45,411 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 05:22:45,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-12 05:22:45,411 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 05:22:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 05:22:45,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 05:22:45,769 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 05:22:45,770 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 05:22:45,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 05:22:45,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-12 05:22:45,974 INFO L356 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:22:45,976 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 05:22:46,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 05:22:46 BoogieIcfgContainer [2022-07-12 05:22:46,069 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 05:22:46,070 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 05:22:46,070 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 05:22:46,070 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 05:22:46,070 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:20:55" (3/4) ... [2022-07-12 05:22:46,071 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 05:22:46,174 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 05:22:46,175 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 05:22:46,175 INFO L158 Benchmark]: Toolchain (without parser) took 110884.27ms. Allocated memory was 81.8MB in the beginning and 123.7MB in the end (delta: 41.9MB). Free memory was 48.5MB in the beginning and 67.7MB in the end (delta: -19.2MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2022-07-12 05:22:46,175 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 81.8MB. Free memory was 61.0MB in the beginning and 60.9MB in the end (delta: 28.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 05:22:46,175 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.58ms. Allocated memory was 81.8MB in the beginning and 102.8MB in the end (delta: 21.0MB). Free memory was 48.3MB in the beginning and 78.5MB in the end (delta: -30.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 05:22:46,176 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.72ms. Allocated memory is still 102.8MB. Free memory was 78.5MB in the beginning and 77.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 05:22:46,176 INFO L158 Benchmark]: Boogie Preprocessor took 23.50ms. Allocated memory is still 102.8MB. Free memory was 77.1MB in the beginning and 76.4MB in the end (delta: 679.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 05:22:46,176 INFO L158 Benchmark]: RCFGBuilder took 231.57ms. Allocated memory is still 102.8MB. Free memory was 75.9MB in the beginning and 66.9MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 05:22:46,176 INFO L158 Benchmark]: TraceAbstraction took 110273.40ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 66.4MB in the beginning and 76.0MB in the end (delta: -9.6MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2022-07-12 05:22:46,176 INFO L158 Benchmark]: Witness Printer took 104.93ms. Allocated memory is still 123.7MB. Free memory was 76.0MB in the beginning and 67.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 05:22:46,177 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 81.8MB. Free memory was 61.0MB in the beginning and 60.9MB in the end (delta: 28.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.58ms. Allocated memory was 81.8MB in the beginning and 102.8MB in the end (delta: 21.0MB). Free memory was 48.3MB in the beginning and 78.5MB in the end (delta: -30.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.72ms. Allocated memory is still 102.8MB. Free memory was 78.5MB in the beginning and 77.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.50ms. Allocated memory is still 102.8MB. Free memory was 77.1MB in the beginning and 76.4MB in the end (delta: 679.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 231.57ms. Allocated memory is still 102.8MB. Free memory was 75.9MB in the beginning and 66.9MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 110273.40ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 66.4MB in the beginning and 76.0MB in the end (delta: -9.6MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * Witness Printer took 104.93ms. Allocated memory is still 123.7MB. Free memory was 76.0MB in the beginning and 67.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L20] int counter = 0; VAL [counter=0] [L22] int a, b; [L23] long long x, y, z; [L25] a = __VERIFIER_nondet_int() [L26] b = __VERIFIER_nondet_int() [L27] CALL assume_abort_if_not(b >= 1) [L10] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L27] RET assume_abort_if_not(b >= 1) [L29] x = a [L30] y = b [L31] z = 0 VAL [a=-5, b=2097151, counter=0, x=-5, y=2097151, z=0] [L33] EXPR counter++ VAL [a=-5, b=2097151, counter=1, counter++=0, x=-5, y=2097151, z=0] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(cond)=1, counter=1] [L13] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert(z + x * y == (long long) a * b) VAL [a=-5, b=2097151, counter=1, x=-5, y=2097151, z=0] [L35] COND FALSE !(!(y != 0)) VAL [a=-5, b=2097151, counter=1, x=-5, y=2097151, z=0] [L38] COND TRUE y % 2 == 1 [L39] z = z + x [L40] y = y - 1 VAL [a=-5, b=2097151, counter=1, x=-5, y=2097150, z=-5] [L42] x = 2 * x [L43] y = y / 2 VAL [a=-5, b=2097151, counter=1, x=-10, y=1048575, z=-5] [L33] EXPR counter++ VAL [a=-5, b=2097151, counter=2, counter++=1, x=-10, y=1048575, z=-5] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(cond)=1, counter=2] [L13] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert(z + x * y == (long long) a * b) VAL [a=-5, b=2097151, counter=2, x=-10, y=1048575, z=-5] [L35] COND FALSE !(!(y != 0)) VAL [a=-5, b=2097151, counter=2, x=-10, y=1048575, z=-5] [L38] COND TRUE y % 2 == 1 [L39] z = z + x [L40] y = y - 1 VAL [a=-5, b=2097151, counter=2, x=-10, y=1048574, z=-15] [L42] x = 2 * x [L43] y = y / 2 VAL [a=-5, b=2097151, counter=2, x=-20, y=524287, z=-15] [L33] EXPR counter++ VAL [a=-5, b=2097151, counter=3, counter++=2, x=-20, y=524287, z=-15] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(cond)=1, counter=3] [L13] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert(z + x * y == (long long) a * b) VAL [a=-5, b=2097151, counter=3, x=-20, y=524287, z=-15] [L35] COND FALSE !(!(y != 0)) VAL [a=-5, b=2097151, counter=3, x=-20, y=524287, z=-15] [L38] COND TRUE y % 2 == 1 [L39] z = z + x [L40] y = y - 1 VAL [a=-5, b=2097151, counter=3, x=-20, y=524286, z=-35] [L42] x = 2 * x [L43] y = y / 2 VAL [a=-5, b=2097151, counter=3, x=-40, y=262143, z=-35] [L33] EXPR counter++ VAL [a=-5, b=2097151, counter=4, counter++=3, x=-40, y=262143, z=-35] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(cond)=1, counter=4] [L13] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert(z + x * y == (long long) a * b) VAL [a=-5, b=2097151, counter=4, x=-40, y=262143, z=-35] [L35] COND FALSE !(!(y != 0)) VAL [a=-5, b=2097151, counter=4, x=-40, y=262143, z=-35] [L38] COND TRUE y % 2 == 1 [L39] z = z + x [L40] y = y - 1 VAL [a=-5, b=2097151, counter=4, x=-40, y=262142, z=-75] [L42] x = 2 * x [L43] y = y / 2 VAL [a=-5, b=2097151, counter=4, x=-80, y=131071, z=-75] [L33] EXPR counter++ VAL [a=-5, b=2097151, counter=5, counter++=4, x=-80, y=131071, z=-75] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(cond)=1, counter=5] [L13] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert(z + x * y == (long long) a * b) VAL [a=-5, b=2097151, counter=5, x=-80, y=131071, z=-75] [L35] COND FALSE !(!(y != 0)) VAL [a=-5, b=2097151, counter=5, x=-80, y=131071, z=-75] [L38] COND TRUE y % 2 == 1 [L39] z = z + x [L40] y = y - 1 VAL [a=-5, b=2097151, counter=5, x=-80, y=131070, z=-155] [L42] x = 2 * x [L43] y = y / 2 VAL [a=-5, b=2097151, counter=5, x=-160, y=65535, z=-155] [L33] EXPR counter++ VAL [a=-5, b=2097151, counter=6, counter++=5, x=-160, y=65535, z=-155] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(cond)=1, counter=6] [L13] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert(z + x * y == (long long) a * b) VAL [a=-5, b=2097151, counter=6, x=-160, y=65535, z=-155] [L35] COND FALSE !(!(y != 0)) VAL [a=-5, b=2097151, counter=6, x=-160, y=65535, z=-155] [L38] COND TRUE y % 2 == 1 [L39] z = z + x [L40] y = y - 1 VAL [a=-5, b=2097151, counter=6, x=-160, y=65534, z=-315] [L42] x = 2 * x [L43] y = y / 2 VAL [a=-5, b=2097151, counter=6, x=-320, y=32767, z=-315] [L33] EXPR counter++ VAL [a=-5, b=2097151, counter=7, counter++=6, x=-320, y=32767, z=-315] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(cond)=1, counter=7] [L13] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert(z + x * y == (long long) a * b) VAL [a=-5, b=2097151, counter=7, x=-320, y=32767, z=-315] [L35] COND FALSE !(!(y != 0)) VAL [a=-5, b=2097151, counter=7, x=-320, y=32767, z=-315] [L38] COND TRUE y % 2 == 1 [L39] z = z + x [L40] y = y - 1 VAL [a=-5, b=2097151, counter=7, x=-320, y=32766, z=-635] [L42] x = 2 * x [L43] y = y / 2 VAL [a=-5, b=2097151, counter=7, x=-640, y=16383, z=-635] [L33] EXPR counter++ VAL [a=-5, b=2097151, counter=8, counter++=7, x=-640, y=16383, z=-635] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(cond)=1, counter=8] [L13] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert(z + x * y == (long long) a * b) VAL [a=-5, b=2097151, counter=8, x=-640, y=16383, z=-635] [L35] COND FALSE !(!(y != 0)) VAL [a=-5, b=2097151, counter=8, x=-640, y=16383, z=-635] [L38] COND TRUE y % 2 == 1 [L39] z = z + x [L40] y = y - 1 VAL [a=-5, b=2097151, counter=8, x=-640, y=16382, z=-1275] [L42] x = 2 * x [L43] y = y / 2 VAL [a=-5, b=2097151, counter=8, x=-1280, y=8191, z=-1275] [L33] EXPR counter++ VAL [a=-5, b=2097151, counter=9, counter++=8, x=-1280, y=8191, z=-1275] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(cond)=1, counter=9] [L13] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert(z + x * y == (long long) a * b) VAL [a=-5, b=2097151, counter=9, x=-1280, y=8191, z=-1275] [L35] COND FALSE !(!(y != 0)) VAL [a=-5, b=2097151, counter=9, x=-1280, y=8191, z=-1275] [L38] COND TRUE y % 2 == 1 [L39] z = z + x [L40] y = y - 1 VAL [a=-5, b=2097151, counter=9, x=-1280, y=8190, z=-2555] [L42] x = 2 * x [L43] y = y / 2 VAL [a=-5, b=2097151, counter=9, x=-2560, y=4095, z=-2555] [L33] EXPR counter++ VAL [a=-5, b=2097151, counter=10, counter++=9, x=-2560, y=4095, z=-2555] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(cond)=1, counter=10] [L13] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert(z + x * y == (long long) a * b) VAL [a=-5, b=2097151, counter=10, x=-2560, y=4095, z=-2555] [L35] COND FALSE !(!(y != 0)) VAL [a=-5, b=2097151, counter=10, x=-2560, y=4095, z=-2555] [L38] COND TRUE y % 2 == 1 [L39] z = z + x [L40] y = y - 1 VAL [a=-5, b=2097151, counter=10, x=-2560, y=4094, z=-5115] [L42] x = 2 * x [L43] y = y / 2 VAL [a=-5, b=2097151, counter=10, x=-5120, y=2047, z=-5115] [L33] EXPR counter++ VAL [a=-5, b=2097151, counter=11, counter++=10, x=-5120, y=2047, z=-5115] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(cond)=1, counter=11] [L13] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert(z + x * y == (long long) a * b) VAL [a=-5, b=2097151, counter=11, x=-5120, y=2047, z=-5115] [L35] COND FALSE !(!(y != 0)) VAL [a=-5, b=2097151, counter=11, x=-5120, y=2047, z=-5115] [L38] COND TRUE y % 2 == 1 [L39] z = z + x [L40] y = y - 1 VAL [a=-5, b=2097151, counter=11, x=-5120, y=2046, z=-10235] [L42] x = 2 * x [L43] y = y / 2 VAL [a=-5, b=2097151, counter=11, x=-10240, y=1023, z=-10235] [L33] EXPR counter++ VAL [a=-5, b=2097151, counter=12, counter++=11, x=-10240, y=1023, z=-10235] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(cond)=1, counter=12] [L13] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert(z + x * y == (long long) a * b) VAL [a=-5, b=2097151, counter=12, x=-10240, y=1023, z=-10235] [L35] COND FALSE !(!(y != 0)) VAL [a=-5, b=2097151, counter=12, x=-10240, y=1023, z=-10235] [L38] COND TRUE y % 2 == 1 [L39] z = z + x [L40] y = y - 1 VAL [a=-5, b=2097151, counter=12, x=-10240, y=1022, z=-20475] [L42] x = 2 * x [L43] y = y / 2 VAL [a=-5, b=2097151, counter=12, x=-20480, y=511, z=-20475] [L33] EXPR counter++ VAL [a=-5, b=2097151, counter=13, counter++=12, x=-20480, y=511, z=-20475] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(cond)=1, counter=13] [L13] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L34] RET __VERIFIER_assert(z + x * y == (long long) a * b) VAL [a=-5, b=2097151, counter=13, x=-20480, y=511, z=-20475] [L35] COND FALSE !(!(y != 0)) VAL [a=-5, b=2097151, counter=13, x=-20480, y=511, z=-20475] [L38] COND TRUE y % 2 == 1 [L39] z = z + x [L40] y = y - 1 VAL [a=-5, b=2097151, counter=13, x=-20480, y=510, z=-40955] [L42] x = 2 * x [L43] y = y / 2 VAL [a=-5, b=2097151, counter=13, x=-40960, y=255, z=-40955] [L33] EXPR counter++ VAL [a=-5, b=2097151, counter=14, counter++=13, x=-40960, y=255, z=-40955] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(cond)=1, counter=14] [L13] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert(z + x * y == (long long) a * b) VAL [a=-5, b=2097151, counter=14, x=-40960, y=255, z=-40955] [L35] COND FALSE !(!(y != 0)) VAL [a=-5, b=2097151, counter=14, x=-40960, y=255, z=-40955] [L38] COND TRUE y % 2 == 1 [L39] z = z + x [L40] y = y - 1 VAL [a=-5, b=2097151, counter=14, x=-40960, y=254, z=-81915] [L42] x = 2 * x [L43] y = y / 2 VAL [a=-5, b=2097151, counter=14, x=-81920, y=127, z=-81915] [L33] EXPR counter++ VAL [a=-5, b=2097151, counter=15, counter++=14, x=-81920, y=127, z=-81915] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(cond)=1, counter=15] [L13] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L34] RET __VERIFIER_assert(z + x * y == (long long) a * b) VAL [a=-5, b=2097151, counter=15, x=-81920, y=127, z=-81915] [L35] COND FALSE !(!(y != 0)) VAL [a=-5, b=2097151, counter=15, x=-81920, y=127, z=-81915] [L38] COND TRUE y % 2 == 1 [L39] z = z + x [L40] y = y - 1 VAL [a=-5, b=2097151, counter=15, x=-81920, y=126, z=-163835] [L42] x = 2 * x [L43] y = y / 2 VAL [a=-5, b=2097151, counter=15, x=-163840, y=63, z=-163835] [L33] EXPR counter++ VAL [a=-5, b=2097151, counter=16, counter++=15, x=-163840, y=63, z=-163835] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(cond)=1, counter=16] [L13] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert(z + x * y == (long long) a * b) VAL [a=-5, b=2097151, counter=16, x=-163840, y=63, z=-163835] [L35] COND FALSE !(!(y != 0)) VAL [a=-5, b=2097151, counter=16, x=-163840, y=63, z=-163835] [L38] COND TRUE y % 2 == 1 [L39] z = z + x [L40] y = y - 1 VAL [a=-5, b=2097151, counter=16, x=-163840, y=62, z=-327675] [L42] x = 2 * x [L43] y = y / 2 VAL [a=-5, b=2097151, counter=16, x=-327680, y=31, z=-327675] [L33] EXPR counter++ VAL [a=-5, b=2097151, counter=17, counter++=16, x=-327680, y=31, z=-327675] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(cond)=1, counter=17] [L13] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert(z + x * y == (long long) a * b) VAL [a=-5, b=2097151, counter=17, x=-327680, y=31, z=-327675] [L35] COND FALSE !(!(y != 0)) VAL [a=-5, b=2097151, counter=17, x=-327680, y=31, z=-327675] [L38] COND TRUE y % 2 == 1 [L39] z = z + x [L40] y = y - 1 VAL [a=-5, b=2097151, counter=17, x=-327680, y=30, z=-655355] [L42] x = 2 * x [L43] y = y / 2 VAL [a=-5, b=2097151, counter=17, x=-655360, y=15, z=-655355] [L33] EXPR counter++ VAL [a=-5, b=2097151, counter=18, counter++=17, x=-655360, y=15, z=-655355] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(cond)=1, counter=18] [L13] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L34] RET __VERIFIER_assert(z + x * y == (long long) a * b) VAL [a=-5, b=2097151, counter=18, x=-655360, y=15, z=-655355] [L35] COND FALSE !(!(y != 0)) VAL [a=-5, b=2097151, counter=18, x=-655360, y=15, z=-655355] [L38] COND TRUE y % 2 == 1 [L39] z = z + x [L40] y = y - 1 VAL [a=-5, b=2097151, counter=18, x=-655360, y=14, z=-1310715] [L42] x = 2 * x [L43] y = y / 2 VAL [a=-5, b=2097151, counter=18, x=-1310720, y=7, z=-1310715] [L33] EXPR counter++ VAL [a=-5, b=2097151, counter=19, counter++=18, x=-1310720, y=7, z=-1310715] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(cond)=1, counter=19] [L13] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L34] RET __VERIFIER_assert(z + x * y == (long long) a * b) VAL [a=-5, b=2097151, counter=19, x=-1310720, y=7, z=-1310715] [L35] COND FALSE !(!(y != 0)) VAL [a=-5, b=2097151, counter=19, x=-1310720, y=7, z=-1310715] [L38] COND TRUE y % 2 == 1 [L39] z = z + x [L40] y = y - 1 VAL [a=-5, b=2097151, counter=19, x=-1310720, y=6, z=-2621435] [L42] x = 2 * x [L43] y = y / 2 VAL [a=-5, b=2097151, counter=19, x=-2621440, y=3, z=-2621435] [L33] EXPR counter++ VAL [a=-5, b=2097151, counter=20, counter++=19, x=-2621440, y=3, z=-2621435] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(cond)=1, counter=20] [L13] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert(z + x * y == (long long) a * b) VAL [a=-5, b=2097151, counter=20, x=-2621440, y=3, z=-2621435] [L35] COND FALSE !(!(y != 0)) VAL [a=-5, b=2097151, counter=20, x=-2621440, y=3, z=-2621435] [L38] COND TRUE y % 2 == 1 [L39] z = z + x [L40] y = y - 1 VAL [a=-5, b=2097151, counter=20, x=-2621440, y=2, z=-5242875] [L42] x = 2 * x [L43] y = y / 2 VAL [a=-5, b=2097151, counter=20, x=-5242880, y=1, z=-5242875] [L33] EXPR counter++ VAL [a=-5, b=2097151, counter=21, counter++=20, x=-5242880, y=1, z=-5242875] [L33] COND FALSE !(counter++<20) [L45] CALL __VERIFIER_assert(z == (long long) a * b) VAL [\old(cond)=0, counter=21] [L13] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=21] [L15] reach_error() VAL [\old(cond)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 110.1s, OverallIterations: 14, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 60.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 709 SdHoareTripleChecker+Valid, 39.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 705 mSDsluCounter, 1313 SdHoareTripleChecker+Invalid, 39.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 55 IncrementalHoareTripleChecker+Unchecked, 1058 mSDsCounter, 275 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1471 IncrementalHoareTripleChecker+Invalid, 1807 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 275 mSolverCounterUnsat, 255 mSDtfsCounter, 1471 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 829 GetRequests, 574 SyntacticMatches, 12 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1528 ImplicationChecksByTransitivity, 49.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=239occurred in iteration=11, InterpolantAutomatonStates: 188, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 364 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 44.5s InterpolantComputationTime, 631 NumberOfCodeBlocks, 631 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 726 ConstructedInterpolants, 4 QuantifiedInterpolants, 5371 SizeOfPredicates, 51 NumberOfNonLiveVariables, 1303 ConjunctsInSsa, 207 ConjunctsInUnsatCore, 21 InterpolantComputations, 4 PerfectInterpolantSequences, 426/1466 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-12 05:22:46,227 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE