./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 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-791161d [2022-07-22 16:40:57,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 16:40:57,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 16:40:57,470 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 16:40:57,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 16:40:57,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 16:40:57,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 16:40:57,474 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 16:40:57,475 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 16:40:57,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 16:40:57,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 16:40:57,478 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 16:40:57,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 16:40:57,479 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 16:40:57,480 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 16:40:57,481 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 16:40:57,482 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 16:40:57,483 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 16:40:57,484 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 16:40:57,485 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 16:40:57,487 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 16:40:57,487 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 16:40:57,490 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 16:40:57,491 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 16:40:57,492 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 16:40:57,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 16:40:57,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 16:40:57,501 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 16:40:57,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 16:40:57,502 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 16:40:57,503 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 16:40:57,503 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 16:40:57,504 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 16:40:57,505 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 16:40:57,506 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 16:40:57,507 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 16:40:57,507 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 16:40:57,508 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 16:40:57,508 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 16:40:57,508 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 16:40:57,509 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 16:40:57,510 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 16:40:57,511 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 16:40:57,535 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 16:40:57,535 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 16:40:57,536 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 16:40:57,536 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 16:40:57,537 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 16:40:57,537 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 16:40:57,538 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 16:40:57,539 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 16:40:57,539 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 16:40:57,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 16:40:57,540 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 16:40:57,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 16:40:57,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 16:40:57,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 16:40:57,541 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 16:40:57,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 16:40:57,541 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 16:40:57,541 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 16:40:57,541 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 16:40:57,541 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 16:40:57,542 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 16:40:57,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 16:40:57,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 16:40:57,543 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 16:40:57,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 16:40:57,544 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 16:40:57,544 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 16:40:57,544 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 16:40:57,544 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 16:40:57,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 16:40:57,545 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 16:40:57,545 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 16:40:57,545 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 16:40:57,545 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-22 16:40:57,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 16:40:57,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 16:40:57,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 16:40:57,764 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 16:40:57,765 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 16:40:57,766 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-22 16:40:57,825 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e1813eb5/300231e75a914467a7ff16e41f505bf4/FLAG3cce4afb9 [2022-07-22 16:40:58,241 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 16:40:58,241 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound20.c [2022-07-22 16:40:58,246 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e1813eb5/300231e75a914467a7ff16e41f505bf4/FLAG3cce4afb9 [2022-07-22 16:40:58,664 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e1813eb5/300231e75a914467a7ff16e41f505bf4 [2022-07-22 16:40:58,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 16:40:58,667 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 16:40:58,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 16:40:58,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 16:40:58,674 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 16:40:58,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 04:40:58" (1/1) ... [2022-07-22 16:40:58,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aa5c7c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:40:58, skipping insertion in model container [2022-07-22 16:40:58,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 04:40:58" (1/1) ... [2022-07-22 16:40:58,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 16:40:58,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 16:40:58,808 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-22 16:40:58,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 16:40:58,828 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 16:40:58,837 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-22 16:40:58,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 16:40:58,850 INFO L208 MainTranslator]: Completed translation [2022-07-22 16:40:58,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:40:58 WrapperNode [2022-07-22 16:40:58,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 16:40:58,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 16:40:58,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 16:40:58,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 16:40:58,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:40:58" (1/1) ... [2022-07-22 16:40:58,866 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:40:58" (1/1) ... [2022-07-22 16:40:58,882 INFO L137 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2022-07-22 16:40:58,883 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 16:40:58,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 16:40:58,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 16:40:58,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 16:40:58,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:40:58" (1/1) ... [2022-07-22 16:40:58,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:40:58" (1/1) ... [2022-07-22 16:40:58,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:40:58" (1/1) ... [2022-07-22 16:40:58,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:40:58" (1/1) ... [2022-07-22 16:40:58,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:40:58" (1/1) ... [2022-07-22 16:40:58,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:40:58" (1/1) ... [2022-07-22 16:40:58,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:40:58" (1/1) ... [2022-07-22 16:40:58,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 16:40:58,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 16:40:58,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 16:40:58,899 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 16:40:58,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:40:58" (1/1) ... [2022-07-22 16:40:58,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 16:40:58,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 16:40:58,944 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 16:40:58,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 16:40:58,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 16:40:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 16:40:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 16:40:58,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 16:40:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-22 16:40:58,983 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-22 16:40:59,034 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 16:40:59,036 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 16:40:59,120 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 16:40:59,125 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 16:40:59,125 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 16:40:59,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 04:40:59 BoogieIcfgContainer [2022-07-22 16:40:59,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 16:40:59,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 16:40:59,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 16:40:59,131 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 16:40:59,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 04:40:58" (1/3) ... [2022-07-22 16:40:59,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21e4ee75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 04:40:59, skipping insertion in model container [2022-07-22 16:40:59,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:40:58" (2/3) ... [2022-07-22 16:40:59,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21e4ee75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 04:40:59, skipping insertion in model container [2022-07-22 16:40:59,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 04:40:59" (3/3) ... [2022-07-22 16:40:59,134 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll_unwindbound20.c [2022-07-22 16:40:59,146 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 16:40:59,146 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 16:40:59,182 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 16:40:59,188 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@46d058f6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@65883e1b [2022-07-22 16:40:59,188 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 16:40:59,191 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-22 16:40:59,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 16:40:59,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:40:59,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 16:40:59,198 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:40:59,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:40:59,203 INFO L85 PathProgramCache]: Analyzing trace with hash -572597424, now seen corresponding path program 1 times [2022-07-22 16:40:59,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 16:40:59,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943182564] [2022-07-22 16:40:59,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:40:59,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 16:40:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 16:40:59,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 16:40:59,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 16:40:59,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943182564] [2022-07-22 16:40:59,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943182564] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 16:40:59,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 16:40:59,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 16:40:59,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794638327] [2022-07-22 16:40:59,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 16:40:59,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 16:40:59,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 16:40:59,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 16:40:59,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 16:40:59,342 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-22 16:40:59,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 16:40:59,360 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2022-07-22 16:40:59,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 16:40:59,363 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-22 16:40:59,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 16:40:59,379 INFO L225 Difference]: With dead ends: 39 [2022-07-22 16:40:59,379 INFO L226 Difference]: Without dead ends: 17 [2022-07-22 16:40:59,383 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-22 16:40:59,386 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-22 16:40:59,387 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-22 16:40:59,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-22 16:40:59,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-22 16:40:59,416 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-22 16:40:59,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-07-22 16:40:59,418 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 9 [2022-07-22 16:40:59,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 16:40:59,419 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-07-22 16:40:59,419 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-22 16:40:59,419 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-07-22 16:40:59,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-22 16:40:59,420 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:40:59,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 16:40:59,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 16:40:59,421 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:40:59,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:40:59,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1986366499, now seen corresponding path program 1 times [2022-07-22 16:40:59,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 16:40:59,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94997224] [2022-07-22 16:40:59,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:40:59,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 16:40:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 16:40:59,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 16:40:59,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 16:40:59,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94997224] [2022-07-22 16:40:59,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94997224] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 16:40:59,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 16:40:59,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 16:40:59,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253031392] [2022-07-22 16:40:59,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 16:40:59,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 16:40:59,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 16:40:59,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 16:40:59,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 16:40:59,501 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-22 16:40:59,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 16:40:59,515 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-07-22 16:40:59,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 16:40:59,516 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-22 16:40:59,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 16:40:59,517 INFO L225 Difference]: With dead ends: 26 [2022-07-22 16:40:59,517 INFO L226 Difference]: Without dead ends: 19 [2022-07-22 16:40:59,518 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-22 16:40:59,519 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-22 16:40:59,520 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-22 16:40:59,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-22 16:40:59,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-22 16:40:59,523 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-22 16:40:59,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-07-22 16:40:59,524 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 10 [2022-07-22 16:40:59,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 16:40:59,525 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-07-22 16:40:59,525 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-22 16:40:59,525 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-07-22 16:40:59,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-22 16:40:59,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:40:59,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 16:40:59,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 16:40:59,526 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:40:59,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:40:59,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1984579039, now seen corresponding path program 1 times [2022-07-22 16:40:59,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 16:40:59,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106987925] [2022-07-22 16:40:59,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:40:59,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 16:40:59,542 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 16:40:59,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1188217301] [2022-07-22 16:40:59,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:40:59,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 16:40:59,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 16:40:59,545 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 16:40:59,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 16:40:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 16:40:59,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 16:40:59,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 16:40:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 16:40:59,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 16:40:59,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 16:40:59,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106987925] [2022-07-22 16:40:59,717 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 16:40:59,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188217301] [2022-07-22 16:40:59,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188217301] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 16:40:59,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 16:40:59,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 16:40:59,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198561214] [2022-07-22 16:40:59,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 16:40:59,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 16:40:59,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 16:40:59,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 16:40:59,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 16:40:59,720 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-22 16:40:59,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 16:40:59,775 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-07-22 16:40:59,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 16:40:59,776 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-22 16:40:59,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 16:40:59,777 INFO L225 Difference]: With dead ends: 30 [2022-07-22 16:40:59,777 INFO L226 Difference]: Without dead ends: 28 [2022-07-22 16:40:59,778 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-22 16:40:59,779 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-22 16:40:59,779 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-22 16:40:59,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-22 16:40:59,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-07-22 16:40:59,784 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-22 16:40:59,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-07-22 16:40:59,785 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 10 [2022-07-22 16:40:59,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 16:40:59,786 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-07-22 16:40:59,786 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-22 16:40:59,786 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-07-22 16:40:59,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 16:40:59,787 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:40:59,787 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 16:40:59,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 16:41:00,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 16:41:00,008 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:41:00,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:41:00,009 INFO L85 PathProgramCache]: Analyzing trace with hash 845350648, now seen corresponding path program 1 times [2022-07-22 16:41:00,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 16:41:00,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393934394] [2022-07-22 16:41:00,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:41:00,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 16:41:00,035 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 16:41:00,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [552092342] [2022-07-22 16:41:00,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:41:00,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 16:41:00,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 16:41:00,038 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 16:41:00,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 16:41:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 16:41:00,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 16:41:00,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 16:41:00,169 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-22 16:41:00,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 16:41:00,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 16:41:00,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393934394] [2022-07-22 16:41:00,172 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 16:41:00,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552092342] [2022-07-22 16:41:00,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552092342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 16:41:00,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 16:41:00,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 16:41:00,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209098981] [2022-07-22 16:41:00,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 16:41:00,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 16:41:00,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 16:41:00,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 16:41:00,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 16:41:00,176 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-22 16:41:00,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 16:41:00,258 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-07-22 16:41:00,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 16:41:00,260 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-22 16:41:00,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 16:41:00,261 INFO L225 Difference]: With dead ends: 34 [2022-07-22 16:41:00,261 INFO L226 Difference]: Without dead ends: 27 [2022-07-22 16:41:00,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-22 16:41:00,263 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-22 16:41:00,265 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-22 16:41:00,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-22 16:41:00,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-07-22 16:41:00,274 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-22 16:41:00,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-07-22 16:41:00,276 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2022-07-22 16:41:00,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 16:41:00,276 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-07-22 16:41:00,277 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-22 16:41:00,277 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-07-22 16:41:00,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 16:41:00,278 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:41:00,279 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-22 16:41:00,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-22 16:41:00,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-22 16:41:00,480 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:41:00,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:41:00,481 INFO L85 PathProgramCache]: Analyzing trace with hash 905454657, now seen corresponding path program 1 times [2022-07-22 16:41:00,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 16:41:00,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184924304] [2022-07-22 16:41:00,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:41:00,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 16:41:00,492 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 16:41:00,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1580880709] [2022-07-22 16:41:00,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:41:00,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 16:41:00,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 16:41:00,503 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 16:41:00,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 16:41:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 16:41:00,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 16:41:00,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 16:41:00,612 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-22 16:41:00,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 16:41:00,675 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-22 16:41:00,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 16:41:00,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184924304] [2022-07-22 16:41:00,681 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 16:41:00,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580880709] [2022-07-22 16:41:00,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580880709] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 16:41:00,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 16:41:00,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-07-22 16:41:00,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710202606] [2022-07-22 16:41:00,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 16:41:00,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 16:41:00,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 16:41:00,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 16:41:00,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-22 16:41:00,685 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-22 16:41:00,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 16:41:00,755 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2022-07-22 16:41:00,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 16:41:00,756 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-22 16:41:00,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 16:41:00,757 INFO L225 Difference]: With dead ends: 62 [2022-07-22 16:41:00,757 INFO L226 Difference]: Without dead ends: 55 [2022-07-22 16:41:00,758 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-22 16:41:00,758 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-22 16:41:00,759 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-22 16:41:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-22 16:41:00,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2022-07-22 16:41:00,765 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-22 16:41:00,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-07-22 16:41:00,767 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 20 [2022-07-22 16:41:00,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 16:41:00,767 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-07-22 16:41:00,767 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-22 16:41:00,768 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-07-22 16:41:00,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 16:41:00,768 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:41:00,768 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 16:41:00,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 16:41:00,987 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-22 16:41:00,988 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:41:00,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:41:00,988 INFO L85 PathProgramCache]: Analyzing trace with hash 907242117, now seen corresponding path program 1 times [2022-07-22 16:41:00,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 16:41:00,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151891775] [2022-07-22 16:41:00,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:41:00,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 16:41:01,001 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 16:41:01,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [402588050] [2022-07-22 16:41:01,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:41:01,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 16:41:01,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 16:41:01,005 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-22 16:41:01,006 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-22 16:41:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 16:41:01,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-22 16:41:01,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 16:41:01,698 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-22 16:41:01,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 16:41:05,925 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-22 16:41:05,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 16:41:05,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151891775] [2022-07-22 16:41:05,926 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 16:41:05,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402588050] [2022-07-22 16:41:05,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402588050] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 16:41:05,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 16:41:05,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2022-07-22 16:41:05,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136197270] [2022-07-22 16:41:05,927 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 16:41:05,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 16:41:05,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 16:41:05,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 16:41:05,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=166, Unknown=1, NotChecked=0, Total=210 [2022-07-22 16:41:05,929 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-22 16:41:09,126 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-22 16:41:25,106 WARN L233 SmtUtils]: Spent 7.19s on a formula simplification. DAG size of input: 39 DAG size of output: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 16:41:27,071 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-22 16:41:29,087 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-22 16:41:29,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 16:41:29,385 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2022-07-22 16:41:29,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 16:41:29,386 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-22 16:41:29,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 16:41:29,388 INFO L225 Difference]: With dead ends: 86 [2022-07-22 16:41:29,388 INFO L226 Difference]: Without dead ends: 84 [2022-07-22 16:41:29,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=77, Invalid=300, Unknown=3, NotChecked=0, Total=380 [2022-07-22 16:41:29,389 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 18 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-07-22 16:41:29,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 110 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 189 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2022-07-22 16:41:29,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-22 16:41:29,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2022-07-22 16:41:29,406 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-22 16:41:29,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2022-07-22 16:41:29,409 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 20 [2022-07-22 16:41:29,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 16:41:29,409 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2022-07-22 16:41:29,409 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-22 16:41:29,410 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2022-07-22 16:41:29,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 16:41:29,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:41:29,411 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 16:41:29,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 16:41:29,634 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-22 16:41:29,634 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:41:29,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:41:29,635 INFO L85 PathProgramCache]: Analyzing trace with hash 97895491, now seen corresponding path program 1 times [2022-07-22 16:41:29,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 16:41:29,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079449611] [2022-07-22 16:41:29,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:41:29,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 16:41:29,649 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 16:41:29,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [341973178] [2022-07-22 16:41:29,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:41:29,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 16:41:29,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 16:41:29,652 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-22 16:41:29,653 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-22 16:41:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 16:41:29,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-22 16:41:29,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 16:41:30,644 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-22 16:41:30,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 16:41:31,493 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-22 16:41:31,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 16:41:31,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079449611] [2022-07-22 16:41:31,493 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 16:41:31,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341973178] [2022-07-22 16:41:31,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341973178] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 16:41:31,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 16:41:31,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2022-07-22 16:41:31,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161989479] [2022-07-22 16:41:31,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 16:41:31,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-22 16:41:31,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 16:41:31,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-22 16:41:31,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-07-22 16:41:31,495 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-22 16:41:32,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 16:41:32,508 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2022-07-22 16:41:32,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 16:41:32,509 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-22 16:41:32,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 16:41:32,510 INFO L225 Difference]: With dead ends: 111 [2022-07-22 16:41:32,510 INFO L226 Difference]: Without dead ends: 102 [2022-07-22 16:41:32,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2022-07-22 16:41:32,512 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 80 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 16:41:32,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 62 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-22 16:41:32,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-22 16:41:32,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2022-07-22 16:41:32,531 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-22 16:41:32,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2022-07-22 16:41:32,534 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 20 [2022-07-22 16:41:32,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 16:41:32,535 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2022-07-22 16:41:32,535 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-22 16:41:32,535 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2022-07-22 16:41:32,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-22 16:41:32,536 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:41:32,536 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-22 16:41:32,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-22 16:41:32,759 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-22 16:41:32,760 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:41:32,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:41:32,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1470880860, now seen corresponding path program 1 times [2022-07-22 16:41:32,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 16:41:32,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497474821] [2022-07-22 16:41:32,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:41:32,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 16:41:32,768 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 16:41:32,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1984668762] [2022-07-22 16:41:32,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:41:32,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 16:41:32,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 16:41:32,776 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-22 16:41:32,777 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-22 16:41:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 16:41:32,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 16:41:32,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 16:41:32,871 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-22 16:41:32,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 16:41:32,941 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-22 16:41:32,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 16:41:32,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497474821] [2022-07-22 16:41:32,941 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 16:41:32,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984668762] [2022-07-22 16:41:32,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984668762] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 16:41:32,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 16:41:32,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-07-22 16:41:32,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92265877] [2022-07-22 16:41:32,942 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 16:41:32,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 16:41:32,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 16:41:32,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 16:41:32,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-22 16:41:32,943 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-22 16:41:34,947 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-22 16:41:35,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 16:41:35,053 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2022-07-22 16:41:35,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 16:41:35,053 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-22 16:41:35,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 16:41:35,054 INFO L225 Difference]: With dead ends: 104 [2022-07-22 16:41:35,054 INFO L226 Difference]: Without dead ends: 89 [2022-07-22 16:41:35,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-07-22 16:41:35,055 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-22 16:41:35,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 55 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-22 16:41:35,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-22 16:41:35,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2022-07-22 16:41:35,064 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-22 16:41:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2022-07-22 16:41:35,065 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 26 [2022-07-22 16:41:35,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 16:41:35,065 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2022-07-22 16:41:35,065 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-22 16:41:35,066 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2022-07-22 16:41:35,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-22 16:41:35,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:41:35,067 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 16:41:35,091 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-22 16:41:35,279 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-22 16:41:35,280 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:41:35,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:41:35,280 INFO L85 PathProgramCache]: Analyzing trace with hash 103630759, now seen corresponding path program 1 times [2022-07-22 16:41:35,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 16:41:35,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36026634] [2022-07-22 16:41:35,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:41:35,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 16:41:35,288 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 16:41:35,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [760124420] [2022-07-22 16:41:35,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:41:35,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 16:41:35,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 16:41:35,292 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-22 16:41:35,293 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-22 16:41:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 16:41:35,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-22 16:41:35,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 16:41:44,977 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-22 16:41:44,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 16:41:56,961 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-22 16:41:56,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 16:41:56,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36026634] [2022-07-22 16:41:56,963 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 16:41:56,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760124420] [2022-07-22 16:41:56,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760124420] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 16:41:56,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 16:41:56,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2022-07-22 16:41:56,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519187317] [2022-07-22 16:41:56,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 16:41:56,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-22 16:41:56,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 16:41:56,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-22 16:41:56,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=276, Unknown=2, NotChecked=0, Total=342 [2022-07-22 16:41:56,968 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 17 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-22 16:42:01,781 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-22 16:42:11,842 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-22 16:42:13,525 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-22 16:42:19,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 16:42:19,755 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-07-22 16:42:19,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 16:42:19,755 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 17 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-22 16:42:19,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 16:42:19,756 INFO L225 Difference]: With dead ends: 110 [2022-07-22 16:42:19,756 INFO L226 Difference]: Without dead ends: 108 [2022-07-22 16:42:19,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=121, Invalid=526, Unknown=3, NotChecked=0, Total=650 [2022-07-22 16:42:19,758 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 39 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 22 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-07-22 16:42:19,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 153 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 244 Invalid, 2 Unknown, 28 Unchecked, 8.6s Time] [2022-07-22 16:42:19,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-22 16:42:19,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 70. [2022-07-22 16:42:19,765 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-22 16:42:19,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2022-07-22 16:42:19,766 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 30 [2022-07-22 16:42:19,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 16:42:19,766 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2022-07-22 16:42:19,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 17 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-22 16:42:19,766 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2022-07-22 16:42:19,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-22 16:42:19,768 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:42:19,768 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-22 16:42:19,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 16:42:19,975 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-22 16:42:19,976 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:42:19,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:42:19,976 INFO L85 PathProgramCache]: Analyzing trace with hash -957536403, now seen corresponding path program 2 times [2022-07-22 16:42:19,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 16:42:19,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980660931] [2022-07-22 16:42:19,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:42:19,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 16:42:19,992 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 16:42:19,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [144846942] [2022-07-22 16:42:19,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 16:42:19,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 16:42:19,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 16:42:19,994 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-22 16:42:19,999 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-22 16:42:20,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 16:42:20,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 16:42:20,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 16:42:20,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 16:42:20,136 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-22 16:42:20,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 16:42:20,221 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-22 16:42:20,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 16:42:20,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980660931] [2022-07-22 16:42:20,222 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 16:42:20,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144846942] [2022-07-22 16:42:20,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144846942] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 16:42:20,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 16:42:20,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-07-22 16:42:20,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340625967] [2022-07-22 16:42:20,223 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 16:42:20,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 16:42:20,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 16:42:20,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 16:42:20,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-07-22 16:42:20,224 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-22 16:42:20,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 16:42:20,370 INFO L93 Difference]: Finished difference Result 250 states and 287 transitions. [2022-07-22 16:42:20,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-22 16:42:20,371 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-22 16:42:20,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 16:42:20,373 INFO L225 Difference]: With dead ends: 250 [2022-07-22 16:42:20,373 INFO L226 Difference]: Without dead ends: 243 [2022-07-22 16:42:20,373 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-22 16:42:20,374 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 113 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 16:42:20,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 170 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 16:42:20,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-07-22 16:42:20,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 233. [2022-07-22 16:42:20,391 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-22 16:42:20,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 258 transitions. [2022-07-22 16:42:20,393 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 258 transitions. Word has length 50 [2022-07-22 16:42:20,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 16:42:20,394 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 258 transitions. [2022-07-22 16:42:20,394 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-22 16:42:20,394 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 258 transitions. [2022-07-22 16:42:20,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-22 16:42:20,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:42:20,395 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-22 16:42:20,421 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-22 16:42:20,615 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-22 16:42:20,615 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:42:20,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:42:20,616 INFO L85 PathProgramCache]: Analyzing trace with hash 535727021, now seen corresponding path program 2 times [2022-07-22 16:42:20,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 16:42:20,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855507441] [2022-07-22 16:42:20,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:42:20,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 16:42:20,624 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 16:42:20,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1745679698] [2022-07-22 16:42:20,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 16:42:20,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 16:42:20,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 16:42:20,626 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-22 16:42:20,627 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-22 16:42:20,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 16:42:20,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 16:42:20,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-22 16:42:20,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 16:42:34,121 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-22 16:42:34,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 16:42:40,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 16:42:40,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855507441] [2022-07-22 16:42:40,036 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 16:42:40,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745679698] [2022-07-22 16:42:40,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745679698] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 16:42:40,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-22 16:42:40,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-07-22 16:42:40,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364940405] [2022-07-22 16:42:40,036 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-22 16:42:40,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-22 16:42:40,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 16:42:40,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-22 16:42:40,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=494, Unknown=3, NotChecked=0, Total=600 [2022-07-22 16:42:40,038 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-22 16:42:42,042 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-22 16:42:45,311 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-22 16:42:46,437 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-22 16:42:47,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 16:42:47,916 INFO L93 Difference]: Finished difference Result 379 states and 438 transitions. [2022-07-22 16:42:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-22 16:42:47,916 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-22 16:42:47,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 16:42:47,919 INFO L225 Difference]: With dead ends: 379 [2022-07-22 16:42:47,919 INFO L226 Difference]: Without dead ends: 377 [2022-07-22 16:42:47,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=225, Invalid=1178, Unknown=3, NotChecked=0, Total=1406 [2022-07-22 16:42:47,921 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 48 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-22 16:42:47,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 215 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 318 Invalid, 1 Unknown, 46 Unchecked, 5.8s Time] [2022-07-22 16:42:47,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-07-22 16:42:47,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 239. [2022-07-22 16:42:47,940 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-22 16:42:47,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 266 transitions. [2022-07-22 16:42:47,942 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 266 transitions. Word has length 50 [2022-07-22 16:42:47,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 16:42:47,942 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 266 transitions. [2022-07-22 16:42:47,942 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-22 16:42:47,943 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 266 transitions. [2022-07-22 16:42:47,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-22 16:42:47,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:42:47,945 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 16:42:47,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-22 16:42:48,159 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-22 16:42:48,159 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:42:48,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:42:48,160 INFO L85 PathProgramCache]: Analyzing trace with hash 26253931, now seen corresponding path program 3 times [2022-07-22 16:42:48,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 16:42:48,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970587713] [2022-07-22 16:42:48,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:42:48,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 16:42:48,170 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 16:42:48,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [737283580] [2022-07-22 16:42:48,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 16:42:48,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 16:42:48,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 16:42:48,172 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-22 16:42:48,176 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-22 16:42:48,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-22 16:42:48,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 16:42:48,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-22 16:42:48,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 16:42:49,512 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-22 16:42:49,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 16:42:53,119 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-22 16:42:53,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 16:42:53,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970587713] [2022-07-22 16:42:53,120 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 16:42:53,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737283580] [2022-07-22 16:42:53,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737283580] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 16:42:53,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 16:42:53,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 29 [2022-07-22 16:42:53,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022910251] [2022-07-22 16:42:53,121 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 16:42:53,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-22 16:42:53,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 16:42:53,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-22 16:42:53,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=636, Unknown=1, NotChecked=0, Total=812 [2022-07-22 16:42:53,123 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-22 16:43:03,118 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-22 16:43:04,328 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-22 16:43:09,204 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-22 16:43:15,120 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-22 16:43:15,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 16:43:15,159 INFO L93 Difference]: Finished difference Result 261 states and 291 transitions. [2022-07-22 16:43:15,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-22 16:43:15,160 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-22 16:43:15,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 16:43:15,162 INFO L225 Difference]: With dead ends: 261 [2022-07-22 16:43:15,162 INFO L226 Difference]: Without dead ends: 257 [2022-07-22 16:43:15,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=501, Invalid=1568, Unknown=1, NotChecked=0, Total=2070 [2022-07-22 16:43:15,163 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 136 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-07-22 16:43:15,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 98 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2022-07-22 16:43:15,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-07-22 16:43:15,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 111. [2022-07-22 16:43:15,175 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-22 16:43:15,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2022-07-22 16:43:15,176 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 50 [2022-07-22 16:43:15,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 16:43:15,177 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2022-07-22 16:43:15,177 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-22 16:43:15,177 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2022-07-22 16:43:15,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-22 16:43:15,179 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:43:15,179 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-22 16:43:15,200 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-22 16:43:15,395 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-22 16:43:15,395 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:43:15,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:43:15,396 INFO L85 PathProgramCache]: Analyzing trace with hash -401903931, now seen corresponding path program 3 times [2022-07-22 16:43:15,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 16:43:15,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808605368] [2022-07-22 16:43:15,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:43:15,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 16:43:15,411 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 16:43:15,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1712363643] [2022-07-22 16:43:15,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 16:43:15,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 16:43:15,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 16:43:15,413 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-22 16:43:15,414 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-22 16:43:15,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-22 16:43:15,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 16:43:15,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-22 16:43:15,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 16:43:15,720 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-22 16:43:15,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 16:43:15,931 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-22 16:43:15,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 16:43:15,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808605368] [2022-07-22 16:43:15,931 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 16:43:15,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712363643] [2022-07-22 16:43:15,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712363643] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 16:43:15,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 16:43:15,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2022-07-22 16:43:15,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288298611] [2022-07-22 16:43:15,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 16:43:15,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-22 16:43:15,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 16:43:15,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-22 16:43:15,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-07-22 16:43:15,934 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-22 16:43:16,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 16:43:16,267 INFO L93 Difference]: Finished difference Result 216 states and 245 transitions. [2022-07-22 16:43:16,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-22 16:43:16,268 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-22 16:43:16,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 16:43:16,269 INFO L225 Difference]: With dead ends: 216 [2022-07-22 16:43:16,269 INFO L226 Difference]: Without dead ends: 211 [2022-07-22 16:43:16,270 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-22 16:43:16,270 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 175 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 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-22 16:43:16,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 236 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 16:43:16,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-22 16:43:16,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2022-07-22 16:43:16,286 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-22 16:43:16,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 231 transitions. [2022-07-22 16:43:16,287 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 231 transitions. Word has length 110 [2022-07-22 16:43:16,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 16:43:16,288 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 231 transitions. [2022-07-22 16:43:16,288 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-22 16:43:16,288 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 231 transitions. [2022-07-22 16:43:16,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-07-22 16:43:16,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:43:16,291 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-22 16:43:16,310 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-22 16:43:16,499 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-22 16:43:16,499 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:43:16,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:43:16,500 INFO L85 PathProgramCache]: Analyzing trace with hash 141809069, now seen corresponding path program 4 times [2022-07-22 16:43:16,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 16:43:16,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677508177] [2022-07-22 16:43:16,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:43:16,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 16:43:16,518 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 16:43:16,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [243054909] [2022-07-22 16:43:16,531 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 16:43:16,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 16:43:16,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 16:43:16,534 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-22 16:43:16,556 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-22 16:43:17,614 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 16:43:17,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-22 16:43:17,614 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 16:43:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 16:43:17,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 16:43:17,920 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 16:43:17,921 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 16:43:17,961 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-22 16:43:18,147 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-22 16:43:18,150 INFO L356 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 16:43:18,152 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 16:43:18,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 04:43:18 BoogieIcfgContainer [2022-07-22 16:43:18,226 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 16:43:18,227 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 16:43:18,227 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 16:43:18,227 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 16:43:18,227 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 04:40:59" (3/4) ... [2022-07-22 16:43:18,229 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-22 16:43:18,305 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 16:43:18,305 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 16:43:18,306 INFO L158 Benchmark]: Toolchain (without parser) took 139638.53ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 77.1MB in the beginning and 75.4MB in the end (delta: 1.7MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2022-07-22 16:43:18,306 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 104.9MB. Free memory was 61.8MB in the beginning and 61.7MB in the end (delta: 44.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 16:43:18,306 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.93ms. Allocated memory is still 104.9MB. Free memory was 76.9MB in the beginning and 80.4MB in the end (delta: -3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 16:43:18,307 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.83ms. Allocated memory is still 104.9MB. Free memory was 80.2MB in the beginning and 78.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 16:43:18,307 INFO L158 Benchmark]: Boogie Preprocessor took 14.92ms. Allocated memory is still 104.9MB. Free memory was 78.9MB in the beginning and 77.9MB in the end (delta: 968.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 16:43:18,307 INFO L158 Benchmark]: RCFGBuilder took 228.36ms. Allocated memory is still 104.9MB. Free memory was 77.7MB in the beginning and 68.4MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 16:43:18,308 INFO L158 Benchmark]: TraceAbstraction took 139098.05ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 68.0MB in the beginning and 84.8MB in the end (delta: -16.8MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. [2022-07-22 16:43:18,308 INFO L158 Benchmark]: Witness Printer took 78.67ms. Allocated memory is still 125.8MB. Free memory was 84.8MB in the beginning and 75.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 16:43:18,309 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.20ms. Allocated memory is still 104.9MB. Free memory was 61.8MB in the beginning and 61.7MB in the end (delta: 44.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 179.93ms. Allocated memory is still 104.9MB. Free memory was 76.9MB in the beginning and 80.4MB in the end (delta: -3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.83ms. Allocated memory is still 104.9MB. Free memory was 80.2MB in the beginning and 78.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.92ms. Allocated memory is still 104.9MB. Free memory was 78.9MB in the beginning and 77.9MB in the end (delta: 968.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 228.36ms. Allocated memory is still 104.9MB. Free memory was 77.7MB in the beginning and 68.4MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 139098.05ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 68.0MB in the beginning and 84.8MB in the end (delta: -16.8MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. * Witness Printer took 78.67ms. Allocated memory is still 125.8MB. Free memory was 84.8MB in the beginning and 75.4MB in the end (delta: 9.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: 139.0s, OverallIterations: 14, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 80.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 719 SdHoareTripleChecker+Valid, 33.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 715 mSDsluCounter, 1339 SdHoareTripleChecker+Invalid, 33.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 74 IncrementalHoareTripleChecker+Unchecked, 1083 mSDsCounter, 293 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1472 IncrementalHoareTripleChecker+Invalid, 1845 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 293 mSolverCounterUnsat, 256 mSDtfsCounter, 1472 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 834 GetRequests, 582 SyntacticMatches, 12 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 80.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=239occurred in iteration=11, InterpolantAutomatonStates: 183, 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, 359 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 53.7s InterpolantComputationTime, 631 NumberOfCodeBlocks, 631 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 726 ConstructedInterpolants, 4 QuantifiedInterpolants, 5318 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-22 16:43:18,359 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