./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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/cohencu-ll_unwindbound10.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 8d4ed8c57ce722a6c7368f844e0bd557207245c570ed48ded2021df85adb4676 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 03:09:06,067 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 03:09:06,069 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 03:09:06,106 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 03:09:06,107 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 03:09:06,108 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 03:09:06,110 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 03:09:06,113 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 03:09:06,114 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 03:09:06,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 03:09:06,118 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 03:09:06,121 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 03:09:06,121 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 03:09:06,123 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 03:09:06,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 03:09:06,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 03:09:06,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 03:09:06,127 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 03:09:06,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 03:09:06,132 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 03:09:06,133 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 03:09:06,134 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 03:09:06,135 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 03:09:06,135 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 03:09:06,136 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 03:09:06,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 03:09:06,142 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 03:09:06,142 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 03:09:06,142 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 03:09:06,143 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 03:09:06,143 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 03:09:06,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 03:09:06,145 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 03:09:06,145 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 03:09:06,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 03:09:06,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 03:09:06,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 03:09:06,147 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 03:09:06,147 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 03:09:06,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 03:09:06,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 03:09:06,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 03:09:06,155 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 03:09:06,179 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 03:09:06,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 03:09:06,179 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 03:09:06,179 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 03:09:06,180 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 03:09:06,180 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 03:09:06,181 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 03:09:06,181 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 03:09:06,181 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 03:09:06,182 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 03:09:06,182 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 03:09:06,182 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 03:09:06,182 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 03:09:06,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 03:09:06,182 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 03:09:06,183 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 03:09:06,183 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 03:09:06,183 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 03:09:06,183 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 03:09:06,183 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 03:09:06,184 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 03:09:06,184 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 03:09:06,184 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 03:09:06,184 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 03:09:06,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 03:09:06,184 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 03:09:06,185 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 03:09:06,185 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 03:09:06,185 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 03:09:06,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 03:09:06,185 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 03:09:06,186 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 03:09:06,186 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 03:09:06,186 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 -> 8d4ed8c57ce722a6c7368f844e0bd557207245c570ed48ded2021df85adb4676 [2022-07-21 03:09:06,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 03:09:06,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 03:09:06,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 03:09:06,460 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 03:09:06,461 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 03:09:06,462 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound10.c [2022-07-21 03:09:06,527 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5760dcdab/cb2b17bf7392487eaed97ac890544f90/FLAG8274a0000 [2022-07-21 03:09:06,806 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 03:09:06,806 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound10.c [2022-07-21 03:09:06,811 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5760dcdab/cb2b17bf7392487eaed97ac890544f90/FLAG8274a0000 [2022-07-21 03:09:07,236 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5760dcdab/cb2b17bf7392487eaed97ac890544f90 [2022-07-21 03:09:07,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 03:09:07,240 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 03:09:07,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 03:09:07,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 03:09:07,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 03:09:07,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:09:07" (1/1) ... [2022-07-21 03:09:07,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@153577e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:09:07, skipping insertion in model container [2022-07-21 03:09:07,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:09:07" (1/1) ... [2022-07-21 03:09:07,255 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 03:09:07,273 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 03:09:07,403 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/cohencu-ll_unwindbound10.c[588,601] [2022-07-21 03:09:07,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 03:09:07,452 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 03:09:07,511 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/cohencu-ll_unwindbound10.c[588,601] [2022-07-21 03:09:07,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 03:09:07,539 INFO L208 MainTranslator]: Completed translation [2022-07-21 03:09:07,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:09:07 WrapperNode [2022-07-21 03:09:07,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 03:09:07,540 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 03:09:07,541 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 03:09:07,541 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 03:09:07,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:09:07" (1/1) ... [2022-07-21 03:09:07,562 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:09:07" (1/1) ... [2022-07-21 03:09:07,586 INFO L137 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2022-07-21 03:09:07,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 03:09:07,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 03:09:07,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 03:09:07,588 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 03:09:07,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:09:07" (1/1) ... [2022-07-21 03:09:07,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:09:07" (1/1) ... [2022-07-21 03:09:07,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:09:07" (1/1) ... [2022-07-21 03:09:07,598 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:09:07" (1/1) ... [2022-07-21 03:09:07,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:09:07" (1/1) ... [2022-07-21 03:09:07,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:09:07" (1/1) ... [2022-07-21 03:09:07,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:09:07" (1/1) ... [2022-07-21 03:09:07,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 03:09:07,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 03:09:07,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 03:09:07,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 03:09:07,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:09:07" (1/1) ... [2022-07-21 03:09:07,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 03:09:07,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:09:07,670 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-21 03:09:07,681 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-21 03:09:07,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 03:09:07,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 03:09:07,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 03:09:07,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 03:09:07,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-21 03:09:07,708 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-21 03:09:07,745 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 03:09:07,746 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 03:09:07,831 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 03:09:07,834 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 03:09:07,835 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 03:09:07,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:09:07 BoogieIcfgContainer [2022-07-21 03:09:07,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 03:09:07,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 03:09:07,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 03:09:07,839 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 03:09:07,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 03:09:07" (1/3) ... [2022-07-21 03:09:07,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17190f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:09:07, skipping insertion in model container [2022-07-21 03:09:07,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:09:07" (2/3) ... [2022-07-21 03:09:07,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17190f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:09:07, skipping insertion in model container [2022-07-21 03:09:07,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:09:07" (3/3) ... [2022-07-21 03:09:07,841 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound10.c [2022-07-21 03:09:07,849 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 03:09:07,849 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 03:09:07,877 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 03:09:07,887 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@538f2cec, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5041e93d [2022-07-21 03:09:07,887 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 03:09:07,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-21 03:09:07,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 03:09:07,910 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:09:07,910 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:09:07,911 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:09:07,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:09:07,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1823967074, now seen corresponding path program 1 times [2022-07-21 03:09:07,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:09:07,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508279707] [2022-07-21 03:09:07,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:09:07,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:09:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:09:08,076 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-21 03:09:08,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:09:08,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508279707] [2022-07-21 03:09:08,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508279707] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 03:09:08,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 03:09:08,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 03:09:08,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358174003] [2022-07-21 03:09:08,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 03:09:08,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 03:09:08,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:09:08,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 03:09:08,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 03:09:08,110 INFO L87 Difference]: Start difference. First operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-21 03:09:08,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:09:08,131 INFO L93 Difference]: Finished difference Result 50 states and 87 transitions. [2022-07-21 03:09:08,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 03:09:08,133 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2022-07-21 03:09:08,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:09:08,140 INFO L225 Difference]: With dead ends: 50 [2022-07-21 03:09:08,140 INFO L226 Difference]: Without dead ends: 22 [2022-07-21 03:09:08,144 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-21 03:09:08,147 INFO L413 NwaCegarLoop]: 37 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, 37 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-21 03:09:08,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 03:09:08,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-21 03:09:08,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-21 03:09:08,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-21 03:09:08,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2022-07-21 03:09:08,187 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 33 transitions. Word has length 7 [2022-07-21 03:09:08,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:09:08,187 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 33 transitions. [2022-07-21 03:09:08,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-21 03:09:08,189 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2022-07-21 03:09:08,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-21 03:09:08,190 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:09:08,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:09:08,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 03:09:08,191 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:09:08,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:09:08,193 INFO L85 PathProgramCache]: Analyzing trace with hash 178926099, now seen corresponding path program 1 times [2022-07-21 03:09:08,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:09:08,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805610009] [2022-07-21 03:09:08,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:09:08,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:09:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:09:08,252 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-21 03:09:08,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:09:08,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805610009] [2022-07-21 03:09:08,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805610009] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 03:09:08,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 03:09:08,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 03:09:08,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095984365] [2022-07-21 03:09:08,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 03:09:08,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 03:09:08,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:09:08,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 03:09:08,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 03:09:08,257 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-21 03:09:08,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:09:08,283 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2022-07-21 03:09:08,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 03:09:08,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2022-07-21 03:09:08,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:09:08,285 INFO L225 Difference]: With dead ends: 36 [2022-07-21 03:09:08,292 INFO L226 Difference]: Without dead ends: 24 [2022-07-21 03:09:08,293 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-21 03:09:08,294 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 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-21 03:09:08,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 03:09:08,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-21 03:09:08,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-21 03:09:08,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-21 03:09:08,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2022-07-21 03:09:08,311 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 8 [2022-07-21 03:09:08,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:09:08,312 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2022-07-21 03:09:08,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-21 03:09:08,312 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-07-21 03:09:08,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-21 03:09:08,312 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:09:08,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:09:08,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 03:09:08,313 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:09:08,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:09:08,314 INFO L85 PathProgramCache]: Analyzing trace with hash 180475231, now seen corresponding path program 1 times [2022-07-21 03:09:08,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:09:08,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672863497] [2022-07-21 03:09:08,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:09:08,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:09:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:09:08,376 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-21 03:09:08,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:09:08,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672863497] [2022-07-21 03:09:08,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672863497] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 03:09:08,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 03:09:08,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 03:09:08,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081369031] [2022-07-21 03:09:08,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 03:09:08,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 03:09:08,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:09:08,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 03:09:08,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 03:09:08,379 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-21 03:09:08,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:09:08,445 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-07-21 03:09:08,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 03:09:08,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 8 [2022-07-21 03:09:08,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:09:08,447 INFO L225 Difference]: With dead ends: 30 [2022-07-21 03:09:08,447 INFO L226 Difference]: Without dead ends: 28 [2022-07-21 03:09:08,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-21 03:09:08,448 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 03:09:08,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 62 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 03:09:08,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-21 03:09:08,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-21 03:09:08,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-21 03:09:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2022-07-21 03:09:08,465 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 8 [2022-07-21 03:09:08,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:09:08,465 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2022-07-21 03:09:08,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-21 03:09:08,466 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2022-07-21 03:09:08,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 03:09:08,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:09:08,466 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:09:08,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 03:09:08,467 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:09:08,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:09:08,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1275442234, now seen corresponding path program 1 times [2022-07-21 03:09:08,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:09:08,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706690704] [2022-07-21 03:09:08,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:09:08,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:09:08,478 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:09:08,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [663365770] [2022-07-21 03:09:08,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:09:08,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:09:08,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:09:08,493 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-21 03:09:08,503 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-21 03:09:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:09:08,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 03:09:08,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:09:08,613 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-21 03:09:08,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 03:09:08,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:09:08,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706690704] [2022-07-21 03:09:08,614 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:09:08,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663365770] [2022-07-21 03:09:08,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663365770] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 03:09:08,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 03:09:08,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 03:09:08,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416748417] [2022-07-21 03:09:08,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 03:09:08,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 03:09:08,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:09:08,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 03:09:08,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 03:09:08,621 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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-21 03:09:08,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:09:08,684 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2022-07-21 03:09:08,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 03:09:08,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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 13 [2022-07-21 03:09:08,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:09:08,685 INFO L225 Difference]: With dead ends: 46 [2022-07-21 03:09:08,686 INFO L226 Difference]: Without dead ends: 44 [2022-07-21 03:09:08,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-21 03:09:08,687 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 03:09:08,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 121 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 03:09:08,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-21 03:09:08,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2022-07-21 03:09:08,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-21 03:09:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-07-21 03:09:08,694 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 13 [2022-07-21 03:09:08,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:09:08,694 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-07-21 03:09:08,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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-21 03:09:08,695 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-07-21 03:09:08,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 03:09:08,695 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:09:08,695 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:09:08,730 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-21 03:09:08,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:09:08,912 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:09:08,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:09:08,913 INFO L85 PathProgramCache]: Analyzing trace with hash 427545983, now seen corresponding path program 1 times [2022-07-21 03:09:08,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:09:08,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317928939] [2022-07-21 03:09:08,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:09:08,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:09:08,931 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:09:08,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2056928916] [2022-07-21 03:09:08,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:09:08,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:09:08,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:09:08,934 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-21 03:09:08,935 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-21 03:09:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:09:08,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 03:09:08,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:09:09,032 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 03:09:09,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 03:09:09,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:09:09,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317928939] [2022-07-21 03:09:09,033 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:09:09,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056928916] [2022-07-21 03:09:09,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056928916] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 03:09:09,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 03:09:09,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 03:09:09,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712347031] [2022-07-21 03:09:09,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 03:09:09,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 03:09:09,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:09:09,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 03:09:09,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 03:09:09,035 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 03:09:09,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:09:09,090 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2022-07-21 03:09:09,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 03:09:09,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-07-21 03:09:09,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:09:09,095 INFO L225 Difference]: With dead ends: 50 [2022-07-21 03:09:09,095 INFO L226 Difference]: Without dead ends: 48 [2022-07-21 03:09:09,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-21 03:09:09,098 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 03:09:09,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 125 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 03:09:09,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-07-21 03:09:09,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2022-07-21 03:09:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-07-21 03:09:09,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2022-07-21 03:09:09,109 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 18 [2022-07-21 03:09:09,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:09:09,109 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2022-07-21 03:09:09,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 03:09:09,110 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-07-21 03:09:09,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-21 03:09:09,110 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:09:09,110 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:09:09,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 03:09:09,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:09:09,339 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:09:09,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:09:09,340 INFO L85 PathProgramCache]: Analyzing trace with hash 5607206, now seen corresponding path program 1 times [2022-07-21 03:09:09,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:09:09,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692025452] [2022-07-21 03:09:09,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:09:09,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:09:09,348 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:09:09,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [181226798] [2022-07-21 03:09:09,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:09:09,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:09:09,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:09:09,349 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-21 03:09:09,350 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-21 03:09:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:09:09,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 03:09:09,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:09:09,473 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 03:09:09,474 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 03:09:09,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:09:09,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692025452] [2022-07-21 03:09:09,475 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:09:09,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181226798] [2022-07-21 03:09:09,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181226798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 03:09:09,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 03:09:09,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 03:09:09,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98754160] [2022-07-21 03:09:09,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 03:09:09,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 03:09:09,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:09:09,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 03:09:09,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 03:09:09,478 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 03:09:09,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:09:09,585 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2022-07-21 03:09:09,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 03:09:09,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-07-21 03:09:09,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:09:09,587 INFO L225 Difference]: With dead ends: 58 [2022-07-21 03:09:09,588 INFO L226 Difference]: Without dead ends: 46 [2022-07-21 03:09:09,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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-21 03:09:09,589 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 03:09:09,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 114 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 03:09:09,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-21 03:09:09,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-07-21 03:09:09,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-21 03:09:09,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-07-21 03:09:09,604 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 23 [2022-07-21 03:09:09,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:09:09,604 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-07-21 03:09:09,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 03:09:09,605 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-07-21 03:09:09,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 03:09:09,606 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:09:09,606 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:09:09,645 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-21 03:09:09,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:09:09,819 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:09:09,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:09:09,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1172224904, now seen corresponding path program 1 times [2022-07-21 03:09:09,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:09:09,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098860701] [2022-07-21 03:09:09,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:09:09,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:09:09,830 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:09:09,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1187799797] [2022-07-21 03:09:09,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:09:09,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:09:09,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:09:09,846 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-21 03:09:09,847 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-21 03:09:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:09:09,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 03:09:09,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:09:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-21 03:09:09,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:09:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-21 03:09:09,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:09:09,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098860701] [2022-07-21 03:09:09,988 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:09:09,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187799797] [2022-07-21 03:09:09,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187799797] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:09:09,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:09:09,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-07-21 03:09:09,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536139476] [2022-07-21 03:09:09,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:09:09,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 03:09:09,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:09:09,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 03:09:09,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-21 03:09:09,990 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-21 03:09:10,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:09:10,097 INFO L93 Difference]: Finished difference Result 116 states and 151 transitions. [2022-07-21 03:09:10,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 03:09:10,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 41 [2022-07-21 03:09:10,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:09:10,099 INFO L225 Difference]: With dead ends: 116 [2022-07-21 03:09:10,099 INFO L226 Difference]: Without dead ends: 100 [2022-07-21 03:09:10,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 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-21 03:09:10,100 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 65 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 03:09:10,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 225 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 03:09:10,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-21 03:09:10,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2022-07-21 03:09:10,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 47 states have (on average 1.148936170212766) internal successors, (54), 50 states have internal predecessors, (54), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-21 03:09:10,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 127 transitions. [2022-07-21 03:09:10,113 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 127 transitions. Word has length 41 [2022-07-21 03:09:10,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:09:10,114 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 127 transitions. [2022-07-21 03:09:10,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-21 03:09:10,114 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 127 transitions. [2022-07-21 03:09:10,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 03:09:10,115 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:09:10,115 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:09:10,133 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-21 03:09:10,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:09:10,332 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:09:10,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:09:10,333 INFO L85 PathProgramCache]: Analyzing trace with hash -680109588, now seen corresponding path program 1 times [2022-07-21 03:09:10,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:09:10,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023831232] [2022-07-21 03:09:10,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:09:10,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:09:10,341 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:09:10,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [333475720] [2022-07-21 03:09:10,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:09:10,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:09:10,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:09:10,343 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-21 03:09:10,344 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-21 03:09:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:09:10,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 03:09:10,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:09:10,459 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-21 03:09:10,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:09:10,535 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-21 03:09:10,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:09:10,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023831232] [2022-07-21 03:09:10,535 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:09:10,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333475720] [2022-07-21 03:09:10,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333475720] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:09:10,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:09:10,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-07-21 03:09:10,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947372206] [2022-07-21 03:09:10,536 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:09:10,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 03:09:10,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:09:10,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 03:09:10,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 03:09:10,538 INFO L87 Difference]: Start difference. First operand 96 states and 127 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-21 03:09:10,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:09:10,866 INFO L93 Difference]: Finished difference Result 114 states and 143 transitions. [2022-07-21 03:09:10,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 03:09:10,866 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 41 [2022-07-21 03:09:10,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:09:10,867 INFO L225 Difference]: With dead ends: 114 [2022-07-21 03:09:10,868 INFO L226 Difference]: Without dead ends: 112 [2022-07-21 03:09:10,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-21 03:09:10,868 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 03:09:10,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 96 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 03:09:10,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-21 03:09:10,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-07-21 03:09:10,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 59 states have (on average 1.11864406779661) internal successors, (66), 62 states have internal predecessors, (66), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-21 03:09:10,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2022-07-21 03:09:10,909 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 41 [2022-07-21 03:09:10,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:09:10,911 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2022-07-21 03:09:10,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-21 03:09:10,911 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2022-07-21 03:09:10,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 03:09:10,913 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:09:10,914 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:09:10,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 03:09:11,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:09:11,115 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:09:11,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:09:11,115 INFO L85 PathProgramCache]: Analyzing trace with hash -399462631, now seen corresponding path program 2 times [2022-07-21 03:09:11,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:09:11,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134559176] [2022-07-21 03:09:11,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:09:11,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:09:11,123 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:09:11,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [469026297] [2022-07-21 03:09:11,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 03:09:11,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:09:11,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:09:11,128 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-21 03:09:11,144 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-21 03:09:11,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 03:09:11,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 03:09:11,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 03:09:11,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:09:11,251 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-21 03:09:11,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:09:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-21 03:09:11,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:09:11,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134559176] [2022-07-21 03:09:11,308 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:09:11,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469026297] [2022-07-21 03:09:11,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469026297] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:09:11,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:09:11,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-07-21 03:09:11,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431200423] [2022-07-21 03:09:11,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:09:11,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 03:09:11,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:09:11,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 03:09:11,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 03:09:11,310 INFO L87 Difference]: Start difference. First operand 112 states and 139 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-07-21 03:09:11,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:09:11,438 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2022-07-21 03:09:11,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 03:09:11,439 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 46 [2022-07-21 03:09:11,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:09:11,439 INFO L225 Difference]: With dead ends: 118 [2022-07-21 03:09:11,440 INFO L226 Difference]: Without dead ends: 116 [2022-07-21 03:09:11,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-21 03:09:11,440 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 6 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 03:09:11,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 186 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 03:09:11,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-21 03:09:11,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-07-21 03:09:11,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 65 states have internal predecessors, (69), 38 states have call successors, (38), 15 states have call predecessors, (38), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-21 03:09:11,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2022-07-21 03:09:11,462 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 46 [2022-07-21 03:09:11,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:09:11,465 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2022-07-21 03:09:11,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-07-21 03:09:11,465 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2022-07-21 03:09:11,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-21 03:09:11,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:09:11,468 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:09:11,498 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-21 03:09:11,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:09:11,701 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:09:11,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:09:11,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1802852916, now seen corresponding path program 3 times [2022-07-21 03:09:11,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:09:11,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595348850] [2022-07-21 03:09:11,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:09:11,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:09:11,709 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:09:11,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [409999755] [2022-07-21 03:09:11,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 03:09:11,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:09:11,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:09:11,724 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-21 03:09:11,726 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-21 03:09:11,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-21 03:09:11,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 03:09:11,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-21 03:09:11,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:09:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-21 03:09:11,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:09:11,946 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-21 03:09:11,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:09:11,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595348850] [2022-07-21 03:09:11,947 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:09:11,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409999755] [2022-07-21 03:09:11,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409999755] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:09:11,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:09:11,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-07-21 03:09:11,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67479626] [2022-07-21 03:09:11,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:09:11,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 03:09:11,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:09:11,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 03:09:11,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-21 03:09:11,948 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-21 03:09:12,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:09:12,146 INFO L93 Difference]: Finished difference Result 142 states and 164 transitions. [2022-07-21 03:09:12,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 03:09:12,147 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 51 [2022-07-21 03:09:12,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:09:12,148 INFO L225 Difference]: With dead ends: 142 [2022-07-21 03:09:12,148 INFO L226 Difference]: Without dead ends: 131 [2022-07-21 03:09:12,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-21 03:09:12,149 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 11 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 03:09:12,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 104 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 03:09:12,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-21 03:09:12,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-07-21 03:09:12,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 80 states have (on average 1.0875) internal successors, (87), 83 states have internal predecessors, (87), 29 states have call successors, (29), 21 states have call predecessors, (29), 21 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-07-21 03:09:12,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2022-07-21 03:09:12,176 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 51 [2022-07-21 03:09:12,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:09:12,176 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2022-07-21 03:09:12,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-21 03:09:12,176 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2022-07-21 03:09:12,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-21 03:09:12,177 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:09:12,177 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:09:12,208 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-21 03:09:12,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:09:12,394 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:09:12,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:09:12,395 INFO L85 PathProgramCache]: Analyzing trace with hash 616227619, now seen corresponding path program 1 times [2022-07-21 03:09:12,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:09:12,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295528362] [2022-07-21 03:09:12,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:09:12,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:09:12,414 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:09:12,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [62118188] [2022-07-21 03:09:12,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:09:12,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:09:12,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:09:12,418 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-21 03:09:12,419 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-21 03:09:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:09:12,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-21 03:09:12,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:09:12,934 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-21 03:09:12,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:09:13,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:09:13,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295528362] [2022-07-21 03:09:13,506 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:09:13,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62118188] [2022-07-21 03:09:13,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62118188] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 03:09:13,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-21 03:09:13,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-07-21 03:09:13,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330127941] [2022-07-21 03:09:13,506 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-21 03:09:13,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 03:09:13,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:09:13,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 03:09:13,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-07-21 03:09:13,507 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-21 03:09:13,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:09:13,749 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-07-21 03:09:13,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 03:09:13,750 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 67 [2022-07-21 03:09:13,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:09:13,750 INFO L225 Difference]: With dead ends: 133 [2022-07-21 03:09:13,751 INFO L226 Difference]: Without dead ends: 124 [2022-07-21 03:09:13,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-07-21 03:09:13,751 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 03:09:13,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 73 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 03:09:13,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-21 03:09:13,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-21 03:09:13,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 79 states have internal predecessors, (82), 26 states have call successors, (26), 20 states have call predecessors, (26), 20 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-21 03:09:13,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2022-07-21 03:09:13,776 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 67 [2022-07-21 03:09:13,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:09:13,776 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2022-07-21 03:09:13,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-21 03:09:13,777 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2022-07-21 03:09:13,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-21 03:09:13,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:09:13,777 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-07-21 03:09:13,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-21 03:09:13,993 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,SelfDestructingSolverStorable10 [2022-07-21 03:09:13,994 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:09:13,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:09:13,994 INFO L85 PathProgramCache]: Analyzing trace with hash -207258189, now seen corresponding path program 4 times [2022-07-21 03:09:13,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:09:13,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836259430] [2022-07-21 03:09:13,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:09:13,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:09:14,002 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:09:14,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1422802020] [2022-07-21 03:09:14,010 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 03:09:14,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:09:14,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:09:14,011 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-21 03:09:14,013 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-21 03:09:15,333 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 03:09:15,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 03:09:15,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-21 03:09:15,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:09:28,676 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 71 proven. 61 refuted. 4 times theorem prover too weak. 170 trivial. 0 not checked. [2022-07-21 03:09:28,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:09:34,479 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 111 proven. 23 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-07-21 03:09:34,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:09:34,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836259430] [2022-07-21 03:09:34,479 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:09:34,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422802020] [2022-07-21 03:09:34,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422802020] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:09:34,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:09:34,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2022-07-21 03:09:34,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718619428] [2022-07-21 03:09:34,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:09:34,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 03:09:34,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:09:34,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 03:09:34,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=178, Unknown=7, NotChecked=0, Total=240 [2022-07-21 03:09:34,481 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand has 16 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 10 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (21), 10 states have call predecessors, (21), 9 states have call successors, (21) [2022-07-21 03:09:49,877 WARN L233 SmtUtils]: Spent 8.41s on a formula simplification. DAG size of input: 50 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 03:09:52,073 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-21 03:09:54,450 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-21 03:09:56,718 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-21 03:09:58,953 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-21 03:10:01,676 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-21 03:10:03,896 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-21 03:10:05,963 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-21 03:10:07,985 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-21 03:10:07,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:10:07,987 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2022-07-21 03:10:07,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 03:10:07,988 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 10 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (21), 10 states have call predecessors, (21), 9 states have call successors, (21) Word has length 74 [2022-07-21 03:10:07,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:10:07,990 INFO L225 Difference]: With dead ends: 135 [2022-07-21 03:10:07,990 INFO L226 Difference]: Without dead ends: 133 [2022-07-21 03:10:07,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 130 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 33.9s TimeCoverageRelationStatistics Valid=79, Invalid=253, Unknown=10, NotChecked=0, Total=342 [2022-07-21 03:10:07,991 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 34 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.1s IncrementalHoareTripleChecker+Time [2022-07-21 03:10:07,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 55 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 141 Invalid, 8 Unknown, 0 Unchecked, 18.1s Time] [2022-07-21 03:10:07,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-21 03:10:08,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 126. [2022-07-21 03:10:08,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 80 states have (on average 1.05) internal successors, (84), 82 states have internal predecessors, (84), 24 states have call successors, (24), 21 states have call predecessors, (24), 21 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-07-21 03:10:08,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2022-07-21 03:10:08,005 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 74 [2022-07-21 03:10:08,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:10:08,005 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2022-07-21 03:10:08,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 10 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (21), 10 states have call predecessors, (21), 9 states have call successors, (21) [2022-07-21 03:10:08,006 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2022-07-21 03:10:08,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-21 03:10:08,006 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:10:08,006 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:10:08,015 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-21 03:10:08,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:10:08,207 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:10:08,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:10:08,207 INFO L85 PathProgramCache]: Analyzing trace with hash 308615369, now seen corresponding path program 2 times [2022-07-21 03:10:08,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:10:08,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311642081] [2022-07-21 03:10:08,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:10:08,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:10:08,215 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:10:08,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1577462728] [2022-07-21 03:10:08,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 03:10:08,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:10:08,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:10:08,218 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-21 03:10:08,227 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-21 03:10:08,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 03:10:08,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 03:10:08,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-21 03:10:08,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:10:08,495 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 32 proven. 24 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-07-21 03:10:08,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:10:08,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:10:08,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311642081] [2022-07-21 03:10:08,616 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:10:08,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577462728] [2022-07-21 03:10:08,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577462728] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 03:10:08,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-21 03:10:08,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-07-21 03:10:08,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184091292] [2022-07-21 03:10:08,616 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-21 03:10:08,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 03:10:08,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:10:08,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 03:10:08,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-21 03:10:08,617 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-21 03:10:08,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:10:08,773 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2022-07-21 03:10:08,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 03:10:08,774 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 95 [2022-07-21 03:10:08,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:10:08,774 INFO L225 Difference]: With dead ends: 134 [2022-07-21 03:10:08,774 INFO L226 Difference]: Without dead ends: 132 [2022-07-21 03:10:08,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-21 03:10:08,776 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 03:10:08,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 159 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 03:10:08,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-21 03:10:08,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2022-07-21 03:10:08,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 85 states have internal predecessors, (87), 25 states have call successors, (25), 22 states have call predecessors, (25), 22 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-21 03:10:08,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2022-07-21 03:10:08,797 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 95 [2022-07-21 03:10:08,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:10:08,798 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2022-07-21 03:10:08,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-21 03:10:08,799 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2022-07-21 03:10:08,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-21 03:10:08,803 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:10:08,803 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:10:08,820 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-21 03:10:09,019 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,SelfDestructingSolverStorable12 [2022-07-21 03:10:09,020 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:10:09,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:10:09,020 INFO L85 PathProgramCache]: Analyzing trace with hash 75049244, now seen corresponding path program 1 times [2022-07-21 03:10:09,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:10:09,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227675226] [2022-07-21 03:10:09,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:10:09,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:10:09,027 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:10:09,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [91065285] [2022-07-21 03:10:09,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:10:09,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:10:09,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:10:09,033 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-21 03:10:09,034 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-21 03:10:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:10:09,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-21 03:10:09,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:10:09,250 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-07-21 03:10:09,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:10:09,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:10:09,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227675226] [2022-07-21 03:10:09,365 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:10:09,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91065285] [2022-07-21 03:10:09,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91065285] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 03:10:09,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-21 03:10:09,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-07-21 03:10:09,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826995078] [2022-07-21 03:10:09,365 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-21 03:10:09,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 03:10:09,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:10:09,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 03:10:09,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-21 03:10:09,366 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-21 03:10:09,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:10:09,515 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2022-07-21 03:10:09,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 03:10:09,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 100 [2022-07-21 03:10:09,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:10:09,517 INFO L225 Difference]: With dead ends: 138 [2022-07-21 03:10:09,517 INFO L226 Difference]: Without dead ends: 125 [2022-07-21 03:10:09,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-21 03:10:09,517 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 03:10:09,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 168 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 03:10:09,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-21 03:10:09,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-07-21 03:10:09,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 80 states have (on average 1.0375) internal successors, (83), 81 states have internal predecessors, (83), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-07-21 03:10:09,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 128 transitions. [2022-07-21 03:10:09,529 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 128 transitions. Word has length 100 [2022-07-21 03:10:09,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:10:09,529 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 128 transitions. [2022-07-21 03:10:09,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-21 03:10:09,529 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2022-07-21 03:10:09,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-21 03:10:09,530 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:10:09,530 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:10:09,549 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-21 03:10:09,744 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,SelfDestructingSolverStorable13 [2022-07-21 03:10:09,744 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:10:09,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:10:09,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1859389073, now seen corresponding path program 3 times [2022-07-21 03:10:09,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:10:09,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559477812] [2022-07-21 03:10:09,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:10:09,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:10:09,751 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:10:09,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [170706298] [2022-07-21 03:10:09,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 03:10:09,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:10:09,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:10:09,772 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-21 03:10:09,773 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-21 03:10:10,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-21 03:10:10,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 03:10:10,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 03:10:10,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:10:10,383 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 110 proven. 16 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2022-07-21 03:10:10,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:10:11,184 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 110 proven. 16 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2022-07-21 03:10:11,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:10:11,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559477812] [2022-07-21 03:10:11,185 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:10:11,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170706298] [2022-07-21 03:10:11,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170706298] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:10:11,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:10:11,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-07-21 03:10:11,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666609864] [2022-07-21 03:10:11,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:10:11,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 03:10:11,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:10:11,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 03:10:11,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-21 03:10:11,187 INFO L87 Difference]: Start difference. First operand 125 states and 128 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2022-07-21 03:10:13,464 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-21 03:10:14,569 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-21 03:10:16,295 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-21 03:10:16,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:10:16,350 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2022-07-21 03:10:16,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 03:10:16,351 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) Word has length 123 [2022-07-21 03:10:16,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:10:16,351 INFO L225 Difference]: With dead ends: 134 [2022-07-21 03:10:16,351 INFO L226 Difference]: Without dead ends: 132 [2022-07-21 03:10:16,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 232 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-07-21 03:10:16,352 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 16 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-21 03:10:16,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 118 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 245 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2022-07-21 03:10:16,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-21 03:10:16,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2022-07-21 03:10:16,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 83 states have (on average 1.036144578313253) internal successors, (86), 85 states have internal predecessors, (86), 25 states have call successors, (25), 22 states have call predecessors, (25), 22 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-21 03:10:16,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2022-07-21 03:10:16,376 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 123 [2022-07-21 03:10:16,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:10:16,376 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2022-07-21 03:10:16,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2022-07-21 03:10:16,377 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2022-07-21 03:10:16,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-21 03:10:16,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:10:16,378 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:10:16,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-21 03:10:16,583 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,SelfDestructingSolverStorable14 [2022-07-21 03:10:16,583 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:10:16,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:10:16,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1602424598, now seen corresponding path program 2 times [2022-07-21 03:10:16,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:10:16,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219892374] [2022-07-21 03:10:16,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:10:16,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:10:16,597 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:10:16,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1671054054] [2022-07-21 03:10:16,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 03:10:16,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:10:16,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:10:16,614 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 03:10:16,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-21 03:10:16,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 03:10:16,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 03:10:16,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 03:10:16,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:10:16,810 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-07-21 03:10:16,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:10:16,916 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-07-21 03:10:16,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:10:16,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219892374] [2022-07-21 03:10:16,917 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:10:16,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671054054] [2022-07-21 03:10:16,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671054054] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:10:16,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:10:16,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-07-21 03:10:16,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125248582] [2022-07-21 03:10:16,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:10:16,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 03:10:16,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:10:16,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 03:10:16,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-07-21 03:10:16,919 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 9 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) [2022-07-21 03:10:17,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:10:17,217 INFO L93 Difference]: Finished difference Result 390 states and 406 transitions. [2022-07-21 03:10:17,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 03:10:17,217 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 9 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) Word has length 125 [2022-07-21 03:10:17,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:10:17,219 INFO L225 Difference]: With dead ends: 390 [2022-07-21 03:10:17,219 INFO L226 Difference]: Without dead ends: 365 [2022-07-21 03:10:17,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 236 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-21 03:10:17,220 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 144 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 03:10:17,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 341 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 03:10:17,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-07-21 03:10:17,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 313. [2022-07-21 03:10:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 196 states have (on average 1.0459183673469388) internal successors, (205), 203 states have internal predecessors, (205), 63 states have call successors, (63), 54 states have call predecessors, (63), 53 states have return successors, (61), 55 states have call predecessors, (61), 61 states have call successors, (61) [2022-07-21 03:10:17,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 329 transitions. [2022-07-21 03:10:17,258 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 329 transitions. Word has length 125 [2022-07-21 03:10:17,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:10:17,258 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 329 transitions. [2022-07-21 03:10:17,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 9 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) [2022-07-21 03:10:17,259 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 329 transitions. [2022-07-21 03:10:17,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-21 03:10:17,259 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:10:17,260 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:10:17,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-21 03:10:17,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-21 03:10:17,475 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:10:17,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:10:17,476 INFO L85 PathProgramCache]: Analyzing trace with hash 709017654, now seen corresponding path program 2 times [2022-07-21 03:10:17,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:10:17,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313630506] [2022-07-21 03:10:17,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:10:17,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:10:17,489 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:10:17,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [794513865] [2022-07-21 03:10:17,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 03:10:17,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:10:17,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:10:17,501 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 03:10:17,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-21 03:10:17,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 03:10:17,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 03:10:17,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-21 03:10:17,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:10:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 44 proven. 48 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-07-21 03:10:17,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:10:17,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:10:17,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313630506] [2022-07-21 03:10:17,942 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:10:17,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794513865] [2022-07-21 03:10:17,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794513865] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 03:10:17,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-21 03:10:17,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-07-21 03:10:17,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335617163] [2022-07-21 03:10:17,943 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-21 03:10:17,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 03:10:17,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:10:17,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 03:10:17,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-21 03:10:17,944 INFO L87 Difference]: Start difference. First operand 313 states and 329 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2022-07-21 03:10:18,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:10:18,150 INFO L93 Difference]: Finished difference Result 323 states and 338 transitions. [2022-07-21 03:10:18,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 03:10:18,151 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) Word has length 128 [2022-07-21 03:10:18,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:10:18,153 INFO L225 Difference]: With dead ends: 323 [2022-07-21 03:10:18,153 INFO L226 Difference]: Without dead ends: 312 [2022-07-21 03:10:18,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-07-21 03:10:18,154 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 6 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 03:10:18,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 202 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 03:10:18,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-07-21 03:10:18,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2022-07-21 03:10:18,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 196 states have (on average 1.0408163265306123) internal successors, (204), 202 states have internal predecessors, (204), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-07-21 03:10:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 326 transitions. [2022-07-21 03:10:18,201 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 326 transitions. Word has length 128 [2022-07-21 03:10:18,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:10:18,203 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 326 transitions. [2022-07-21 03:10:18,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2022-07-21 03:10:18,204 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 326 transitions. [2022-07-21 03:10:18,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-21 03:10:18,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:10:18,205 INFO L195 NwaCegarLoop]: trace histogram [28, 27, 27, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:10:18,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-21 03:10:18,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:10:18,420 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:10:18,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:10:18,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1972302768, now seen corresponding path program 3 times [2022-07-21 03:10:18,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:10:18,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868761920] [2022-07-21 03:10:18,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:10:18,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:10:18,441 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:10:18,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [33042633] [2022-07-21 03:10:18,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 03:10:18,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:10:18,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:10:18,443 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 03:10:18,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-21 03:10:20,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-21 03:10:20,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 03:10:20,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-21 03:10:20,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:11:14,084 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 03:11:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 366 proven. 76 refuted. 0 times theorem prover too weak. 1096 trivial. 0 not checked. [2022-07-21 03:11:14,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:11:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 271 proven. 34 refuted. 0 times theorem prover too weak. 1233 trivial. 0 not checked. [2022-07-21 03:11:17,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:11:17,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868761920] [2022-07-21 03:11:17,642 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:11:17,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33042633] [2022-07-21 03:11:17,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33042633] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:11:17,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:11:17,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2022-07-21 03:11:17,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063791023] [2022-07-21 03:11:17,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:11:17,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 03:11:17,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:11:17,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 03:11:17,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=235, Unknown=1, NotChecked=0, Total=306 [2022-07-21 03:11:17,651 INFO L87 Difference]: Start difference. First operand 312 states and 326 transitions. Second operand has 18 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 11 states have internal predecessors, (27), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 10 states have call predecessors, (26), 9 states have call successors, (26) [2022-07-21 03:11:29,047 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-21 03:11:33,032 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-21 03:11:34,584 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-21 03:11:35,680 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-21 03:11:37,630 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-21 03:11:40,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:11:40,268 INFO L93 Difference]: Finished difference Result 319 states and 332 transitions. [2022-07-21 03:11:40,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 03:11:40,268 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 11 states have internal predecessors, (27), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 10 states have call predecessors, (26), 9 states have call successors, (26) Word has length 156 [2022-07-21 03:11:40,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:11:40,270 INFO L225 Difference]: With dead ends: 319 [2022-07-21 03:11:40,270 INFO L226 Difference]: Without dead ends: 293 [2022-07-21 03:11:40,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 295 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 34.4s TimeCoverageRelationStatistics Valid=132, Invalid=418, Unknown=2, NotChecked=0, Total=552 [2022-07-21 03:11:40,271 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 22 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2022-07-21 03:11:40,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 154 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 160 Invalid, 1 Unknown, 39 Unchecked, 13.0s Time] [2022-07-21 03:11:40,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-07-21 03:11:40,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2022-07-21 03:11:40,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 188 states have (on average 1.0106382978723405) internal successors, (190), 189 states have internal predecessors, (190), 53 states have call successors, (53), 51 states have call predecessors, (53), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-07-21 03:11:40,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 295 transitions. [2022-07-21 03:11:40,319 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 295 transitions. Word has length 156 [2022-07-21 03:11:40,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:11:40,319 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 295 transitions. [2022-07-21 03:11:40,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 11 states have internal predecessors, (27), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 10 states have call predecessors, (26), 9 states have call successors, (26) [2022-07-21 03:11:40,319 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 295 transitions. [2022-07-21 03:11:40,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2022-07-21 03:11:40,323 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:11:40,323 INFO L195 NwaCegarLoop]: trace histogram [52, 51, 51, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:11:40,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-21 03:11:40,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-21 03:11:40,532 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:11:40,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:11:40,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1951591730, now seen corresponding path program 3 times [2022-07-21 03:11:40,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:11:40,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509551454] [2022-07-21 03:11:40,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:11:40,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:11:40,544 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:11:40,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [666555307] [2022-07-21 03:11:40,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 03:11:40,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:11:40,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:11:40,555 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 03:11:40,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-21 03:11:41,261 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2022-07-21 03:11:41,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-21 03:11:41,262 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 03:11:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 03:11:41,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 03:11:41,414 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 03:11:41,415 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 03:11:41,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-21 03:11:41,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:11:41,625 INFO L356 BasicCegarLoop]: Path program histogram: [4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2022-07-21 03:11:41,627 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 03:11:41,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 03:11:41 BoogieIcfgContainer [2022-07-21 03:11:41,714 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 03:11:41,714 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 03:11:41,715 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 03:11:41,715 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 03:11:41,715 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:09:07" (3/4) ... [2022-07-21 03:11:41,716 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 03:11:41,809 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 03:11:41,810 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 03:11:41,810 INFO L158 Benchmark]: Toolchain (without parser) took 154570.30ms. Allocated memory was 69.2MB in the beginning and 119.5MB in the end (delta: 50.3MB). Free memory was 50.8MB in the beginning and 45.7MB in the end (delta: 5.1MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. [2022-07-21 03:11:41,811 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 69.2MB. Free memory was 51.9MB in the beginning and 51.9MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 03:11:41,811 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.81ms. Allocated memory is still 69.2MB. Free memory was 50.6MB in the beginning and 52.8MB in the end (delta: -2.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 03:11:41,811 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.12ms. Allocated memory is still 69.2MB. Free memory was 52.5MB in the beginning and 51.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 03:11:41,811 INFO L158 Benchmark]: Boogie Preprocessor took 36.88ms. Allocated memory is still 69.2MB. Free memory was 51.0MB in the beginning and 50.0MB in the end (delta: 931.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 03:11:41,814 INFO L158 Benchmark]: RCFGBuilder took 210.96ms. Allocated memory is still 69.2MB. Free memory was 50.0MB in the beginning and 40.1MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-21 03:11:41,814 INFO L158 Benchmark]: TraceAbstraction took 153877.22ms. Allocated memory was 69.2MB in the beginning and 119.5MB in the end (delta: 50.3MB). Free memory was 39.6MB in the beginning and 55.2MB in the end (delta: -15.6MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. [2022-07-21 03:11:41,816 INFO L158 Benchmark]: Witness Printer took 95.33ms. Allocated memory is still 119.5MB. Free memory was 55.2MB in the beginning and 45.7MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-21 03:11:41,818 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.17ms. Allocated memory is still 69.2MB. Free memory was 51.9MB in the beginning and 51.9MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.81ms. Allocated memory is still 69.2MB. Free memory was 50.6MB in the beginning and 52.8MB in the end (delta: -2.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.12ms. Allocated memory is still 69.2MB. Free memory was 52.5MB in the beginning and 51.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.88ms. Allocated memory is still 69.2MB. Free memory was 51.0MB in the beginning and 50.0MB in the end (delta: 931.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 210.96ms. Allocated memory is still 69.2MB. Free memory was 50.0MB in the beginning and 40.1MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 153877.22ms. Allocated memory was 69.2MB in the beginning and 119.5MB in the end (delta: 50.3MB). Free memory was 39.6MB in the beginning and 55.2MB in the end (delta: -15.6MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. * Witness Printer took 95.33ms. Allocated memory is still 119.5MB. Free memory was 55.2MB in the beginning and 45.7MB 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: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [counter=0] [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [a=10, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [a=10, counter=1, counter++=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=10, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=10, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=10, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=10, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=10, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=10, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [a=10, counter=2, counter++=1, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=10, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=10, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=10, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=10, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=10, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=10, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [a=10, counter=3, counter++=2, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=10, counter=3, n=2, x=8, y=19, z=18] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=10, counter=3, n=2, x=8, y=19, z=18] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=10, counter=3, n=2, x=8, y=19, z=18] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=10, counter=3, n=2, x=8, y=19, z=18] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=10, counter=3, n=2, x=8, y=19, z=18] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=10, counter=3, n=3, x=27, y=37, z=24] [L33] EXPR counter++ VAL [a=10, counter=4, counter++=3, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=10, counter=4, n=3, x=27, y=37, z=24] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=10, counter=4, n=3, x=27, y=37, z=24] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=10, counter=4, n=3, x=27, y=37, z=24] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=10, counter=4, n=3, x=27, y=37, z=24] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=10, counter=4, n=3, x=27, y=37, z=24] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=10, counter=4, n=4, x=64, y=61, z=30] [L33] EXPR counter++ VAL [a=10, counter=5, counter++=4, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=10, counter=5, n=4, x=64, y=61, z=30] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=10, counter=5, n=4, x=64, y=61, z=30] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=10, counter=5, n=4, x=64, y=61, z=30] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=10, counter=5, n=4, x=64, y=61, z=30] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=10, counter=5, n=4, x=64, y=61, z=30] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=10, counter=5, n=5, x=125, y=91, z=36] [L33] EXPR counter++ VAL [a=10, counter=6, counter++=5, n=5, x=125, y=91, z=36] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=10, counter=6, n=5, x=125, y=91, z=36] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=10, counter=6, n=5, x=125, y=91, z=36] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=10, counter=6, n=5, x=125, y=91, z=36] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=10, counter=6, n=5, x=125, y=91, z=36] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=10, counter=6, n=5, x=125, y=91, z=36] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=10, counter=6, n=6, x=216, y=127, z=42] [L33] EXPR counter++ VAL [a=10, counter=7, counter++=6, n=6, x=216, y=127, z=42] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=10, counter=7, n=6, x=216, y=127, z=42] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=10, counter=7, n=6, x=216, y=127, z=42] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=10, counter=7, n=6, x=216, y=127, z=42] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=10, counter=7, n=6, x=216, y=127, z=42] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=10, counter=7, n=6, x=216, y=127, z=42] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=10, counter=7, n=7, x=343, y=169, z=48] [L33] EXPR counter++ VAL [a=10, counter=8, counter++=7, n=7, x=343, y=169, z=48] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=10, counter=8, n=7, x=343, y=169, z=48] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=10, counter=8, n=7, x=343, y=169, z=48] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=10, counter=8, n=7, x=343, y=169, z=48] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=10, counter=8, n=7, x=343, y=169, z=48] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=10, counter=8, n=7, x=343, y=169, z=48] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=10, counter=8, n=8, x=512, y=217, z=54] [L33] EXPR counter++ VAL [a=10, counter=9, counter++=8, n=8, x=512, y=217, z=54] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=10, counter=9, n=8, x=512, y=217, z=54] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=10, counter=9, n=8, x=512, y=217, z=54] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=10, counter=9, n=8, x=512, y=217, z=54] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=10, counter=9, n=8, x=512, y=217, z=54] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=10, counter=9, n=8, x=512, y=217, z=54] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=10, counter=9, n=9, x=729, y=271, z=60] [L33] EXPR counter++ VAL [a=10, counter=10, counter++=9, n=9, x=729, y=271, z=60] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=10, counter=10, n=9, x=729, y=271, z=60] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=10, counter=10, n=9, x=729, y=271, z=60] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=10, counter=10, n=9, x=729, y=271, z=60] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=10, counter=10, n=9, x=729, y=271, z=60] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=10, counter=10, n=9, x=729, y=271, z=60] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=10, counter=10, n=10, x=1000, y=331, z=66] [L33] EXPR counter++ VAL [a=10, counter=11, counter++=10, n=10, x=1000, y=331, z=66] [L33] COND FALSE !(counter++<10) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [a=10, counter=11, n=10, x=1000, y=331, z=66] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, counter=11] [L15] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=11] [L17] reach_error() VAL [\old(cond)=0, cond=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 153.8s, OverallIterations: 19, TraceHistogramMax: 52, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 63.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 416 SdHoareTripleChecker+Valid, 37.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 359 mSDsluCounter, 2429 SdHoareTripleChecker+Invalid, 37.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 39 IncrementalHoareTripleChecker+Unchecked, 1699 mSDsCounter, 398 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2580 IncrementalHoareTripleChecker+Invalid, 3027 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 398 mSolverCounterUnsat, 730 mSDtfsCounter, 2580 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1958 GetRequests, 1770 SyntacticMatches, 13 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 70.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=313occurred in iteration=16, InterpolantAutomatonStates: 144, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 79 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 4.3s SatisfiabilityAnalysisTime, 80.8s InterpolantComputationTime, 1417 NumberOfCodeBlocks, 1207 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 1755 ConstructedInterpolants, 2 QuantifiedInterpolants, 8363 SizeOfPredicates, 48 NumberOfNonLiveVariables, 2310 ConjunctsInSsa, 300 ConjunctsInUnsatCore, 26 InterpolantComputations, 6 PerfectInterpolantSequences, 9543/10630 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-21 03:11:41,857 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