./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf 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_unwindbound100.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 68f9fd2579af608e6be28622e3c97743e3c7dbed ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-29 12:02:33,447 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-29 12:02:33,448 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-29 12:02:33,475 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-29 12:02:33,476 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-29 12:02:33,477 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-29 12:02:33,478 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-29 12:02:33,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-29 12:02:33,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-29 12:02:33,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-29 12:02:33,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-29 12:02:33,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-29 12:02:33,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-29 12:02:33,493 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-29 12:02:33,494 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-29 12:02:33,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-29 12:02:33,497 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-29 12:02:33,500 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-29 12:02:33,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-29 12:02:33,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-29 12:02:33,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-29 12:02:33,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-29 12:02:33,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-29 12:02:33,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-29 12:02:33,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-29 12:02:33,516 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-29 12:02:33,516 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-29 12:02:33,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-29 12:02:33,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-29 12:02:33,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-29 12:02:33,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-29 12:02:33,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-29 12:02:33,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-29 12:02:33,522 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-29 12:02:33,523 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-29 12:02:33,523 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-29 12:02:33,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-29 12:02:33,524 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-29 12:02:33,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-29 12:02:33,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-29 12:02:33,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-29 12:02:33,526 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-29 12:02:33,549 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-29 12:02:33,549 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-29 12:02:33,550 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-29 12:02:33,550 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-29 12:02:33,552 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-29 12:02:33,552 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-29 12:02:33,552 INFO L138 SettingsManager]: * Use SBE=true [2021-08-29 12:02:33,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-29 12:02:33,553 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-29 12:02:33,553 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-29 12:02:33,553 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-29 12:02:33,554 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-29 12:02:33,554 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-29 12:02:33,554 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-29 12:02:33,554 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-29 12:02:33,558 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-29 12:02:33,558 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-29 12:02:33,558 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-29 12:02:33,558 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-29 12:02:33,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-29 12:02:33,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-29 12:02:33,559 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-29 12:02:33,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 12:02:33,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-29 12:02:33,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-29 12:02:33,559 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-29 12:02:33,559 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-29 12:02:33,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-29 12:02:33,559 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-29 12:02:33,559 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-29 12:02:33,559 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 -> 68f9fd2579af608e6be28622e3c97743e3c7dbed [2021-08-29 12:02:33,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-29 12:02:33,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-29 12:02:33,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-29 12:02:33,819 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-29 12:02:33,819 INFO L275 PluginConnector]: CDTParser initialized [2021-08-29 12:02:33,820 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound100.c [2021-08-29 12:02:33,877 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9d4a5924/c0e266f52f3a4f8b9e489b026145bb89/FLAGa8479e648 [2021-08-29 12:02:34,171 INFO L306 CDTParser]: Found 1 translation units. [2021-08-29 12:02:34,172 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound100.c [2021-08-29 12:02:34,178 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9d4a5924/c0e266f52f3a4f8b9e489b026145bb89/FLAGa8479e648 [2021-08-29 12:02:34,635 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9d4a5924/c0e266f52f3a4f8b9e489b026145bb89 [2021-08-29 12:02:34,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-29 12:02:34,639 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-29 12:02:34,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-29 12:02:34,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-29 12:02:34,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-29 12:02:34,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 12:02:34" (1/1) ... [2021-08-29 12:02:34,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@619e2d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 12:02:34, skipping insertion in model container [2021-08-29 12:02:34,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 12:02:34" (1/1) ... [2021-08-29 12:02:34,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-29 12:02:34,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-29 12:02:34,761 WARN L228 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_unwindbound100.c[596,609] [2021-08-29 12:02:34,787 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 12:02:34,793 INFO L203 MainTranslator]: Completed pre-run [2021-08-29 12:02:34,800 WARN L228 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_unwindbound100.c[596,609] [2021-08-29 12:02:34,819 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 12:02:34,829 INFO L208 MainTranslator]: Completed translation [2021-08-29 12:02:34,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 12:02:34 WrapperNode [2021-08-29 12:02:34,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-29 12:02:34,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-29 12:02:34,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-29 12:02:34,839 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-29 12:02:34,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 12:02:34" (1/1) ... [2021-08-29 12:02:34,851 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 12:02:34" (1/1) ... [2021-08-29 12:02:34,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-29 12:02:34,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-29 12:02:34,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-29 12:02:34,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-29 12:02:34,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 12:02:34" (1/1) ... [2021-08-29 12:02:34,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 12:02:34" (1/1) ... [2021-08-29 12:02:34,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 12:02:34" (1/1) ... [2021-08-29 12:02:34,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 12:02:34" (1/1) ... [2021-08-29 12:02:34,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 12:02:34" (1/1) ... [2021-08-29 12:02:34,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 12:02:34" (1/1) ... [2021-08-29 12:02:34,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 12:02:34" (1/1) ... [2021-08-29 12:02:34,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-29 12:02:34,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-29 12:02:34,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-29 12:02:34,909 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-29 12:02:34,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 12:02:34" (1/1) ... [2021-08-29 12:02:34,914 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 12:02:34,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:02:34,930 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) [2021-08-29 12:02:34,952 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 [2021-08-29 12:02:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-29 12:02:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_unsigned_short [2021-08-29 12:02:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-29 12:02:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-29 12:02:34,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-29 12:02:35,102 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-29 12:02:35,103 INFO L299 CfgBuilder]: Removed 27 assume(true) statements. [2021-08-29 12:02:35,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 12:02:35 BoogieIcfgContainer [2021-08-29 12:02:35,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-29 12:02:35,105 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-29 12:02:35,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-29 12:02:35,107 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-29 12:02:35,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 12:02:34" (1/3) ... [2021-08-29 12:02:35,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@122790ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 12:02:35, skipping insertion in model container [2021-08-29 12:02:35,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 12:02:34" (2/3) ... [2021-08-29 12:02:35,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@122790ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 12:02:35, skipping insertion in model container [2021-08-29 12:02:35,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 12:02:35" (3/3) ... [2021-08-29 12:02:35,109 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound100.c [2021-08-29 12:02:35,112 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-29 12:02:35,112 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2021-08-29 12:02:35,146 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-29 12:02:35,151 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-29 12:02:35,152 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-08-29 12:02:35,162 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 40 states have (on average 1.625) internal successors, (65), 51 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:35,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-08-29 12:02:35,165 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:02:35,165 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-08-29 12:02:35,166 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-08-29 12:02:35,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:02:35,169 INFO L82 PathProgramCache]: Analyzing trace with hash 889571274, now seen corresponding path program 1 times [2021-08-29 12:02:35,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:02:35,175 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237108643] [2021-08-29 12:02:35,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:02:35,176 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:02:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 12:02:35,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:02:35,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:02:35,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237108643] [2021-08-29 12:02:35,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237108643] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 12:02:35,438 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 12:02:35,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 12:02:35,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645057661] [2021-08-29 12:02:35,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 12:02:35,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:02:35,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 12:02:35,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 12:02:35,479 INFO L87 Difference]: Start difference. First operand has 52 states, 40 states have (on average 1.625) internal successors, (65), 51 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:35,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:02:35,654 INFO L93 Difference]: Finished difference Result 101 states and 129 transitions. [2021-08-29 12:02:35,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 12:02:35,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-08-29 12:02:35,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:02:35,665 INFO L225 Difference]: With dead ends: 101 [2021-08-29 12:02:35,666 INFO L226 Difference]: Without dead ends: 47 [2021-08-29 12:02:35,668 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.45ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 12:02:35,670 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 88.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.46ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 133.46ms IncrementalHoareTripleChecker+Time [2021-08-29 12:02:35,671 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 107 Unknown, 0 Unchecked, 6.46ms Time], IncrementalHoareTripleChecker [22 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 133.46ms Time] [2021-08-29 12:02:35,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-08-29 12:02:35,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2021-08-29 12:02:35,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 43 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:35,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2021-08-29 12:02:35,692 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 6 [2021-08-29 12:02:35,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:02:35,693 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2021-08-29 12:02:35,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:35,693 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2021-08-29 12:02:35,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-08-29 12:02:35,693 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:02:35,693 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 12:02:35,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-29 12:02:35,694 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-08-29 12:02:35,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:02:35,698 INFO L82 PathProgramCache]: Analyzing trace with hash 179657965, now seen corresponding path program 1 times [2021-08-29 12:02:35,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:02:35,699 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616424733] [2021-08-29 12:02:35,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:02:35,699 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:02:35,708 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:02:35,708 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1392712230] [2021-08-29 12:02:35,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:02:35,709 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:02:35,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:02:35,710 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) [2021-08-29 12:02:35,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-29 12:02:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 12:02:35,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-29 12:02:35,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:02:35,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:02:35,844 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-29 12:02:35,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:02:35,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616424733] [2021-08-29 12:02:35,844 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:02:35,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392712230] [2021-08-29 12:02:35,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392712230] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 12:02:35,845 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 12:02:35,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 12:02:35,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923166711] [2021-08-29 12:02:35,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 12:02:35,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:02:35,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 12:02:35,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 12:02:35,847 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:35,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:02:35,987 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2021-08-29 12:02:35,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 12:02:35,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-08-29 12:02:35,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:02:35,997 INFO L225 Difference]: With dead ends: 86 [2021-08-29 12:02:35,997 INFO L226 Difference]: Without dead ends: 84 [2021-08-29 12:02:35,997 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.89ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 12:02:35,998 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 90.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.19ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 112.78ms IncrementalHoareTripleChecker+Time [2021-08-29 12:02:35,998 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 135 Unknown, 0 Unchecked, 1.19ms Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 112.78ms Time] [2021-08-29 12:02:35,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-08-29 12:02:36,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 49. [2021-08-29 12:02:36,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.275) internal successors, (51), 48 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:36,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2021-08-29 12:02:36,005 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 8 [2021-08-29 12:02:36,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:02:36,005 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2021-08-29 12:02:36,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:36,005 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2021-08-29 12:02:36,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-29 12:02:36,005 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:02:36,006 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 12:02:36,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-29 12:02:36,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:02:36,209 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-08-29 12:02:36,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:02:36,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1269812074, now seen corresponding path program 1 times [2021-08-29 12:02:36,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:02:36,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888478123] [2021-08-29 12:02:36,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:02:36,211 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:02:36,219 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:02:36,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1323207735] [2021-08-29 12:02:36,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:02:36,220 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:02:36,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:02:36,224 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) [2021-08-29 12:02:36,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-29 12:02:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 12:02:36,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-29 12:02:36,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:02:36,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:02:36,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-29 12:02:36,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:02:36,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888478123] [2021-08-29 12:02:36,274 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:02:36,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323207735] [2021-08-29 12:02:36,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323207735] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 12:02:36,274 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 12:02:36,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 12:02:36,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89499927] [2021-08-29 12:02:36,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 12:02:36,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:02:36,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 12:02:36,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 12:02:36,275 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:36,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:02:36,363 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2021-08-29 12:02:36,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 12:02:36,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-08-29 12:02:36,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:02:36,364 INFO L225 Difference]: With dead ends: 71 [2021-08-29 12:02:36,364 INFO L226 Difference]: Without dead ends: 49 [2021-08-29 12:02:36,364 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.35ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 12:02:36,365 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.19ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 64.81ms IncrementalHoareTripleChecker+Time [2021-08-29 12:02:36,366 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 133 Unknown, 0 Unchecked, 3.19ms Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 64.81ms Time] [2021-08-29 12:02:36,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-08-29 12:02:36,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2021-08-29 12:02:36,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.25) internal successors, (50), 48 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2021-08-29 12:02:36,371 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 9 [2021-08-29 12:02:36,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:02:36,371 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2021-08-29 12:02:36,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:36,372 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2021-08-29 12:02:36,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-29 12:02:36,372 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:02:36,372 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 12:02:36,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-29 12:02:36,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-08-29 12:02:36,573 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-08-29 12:02:36,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:02:36,575 INFO L82 PathProgramCache]: Analyzing trace with hash 852768432, now seen corresponding path program 1 times [2021-08-29 12:02:36,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:02:36,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057253074] [2021-08-29 12:02:36,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:02:36,576 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:02:36,585 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:02:36,585 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [784425095] [2021-08-29 12:02:36,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:02:36,586 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:02:36,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:02:36,589 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) [2021-08-29 12:02:36,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-29 12:02:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 12:02:36,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-29 12:02:36,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:02:36,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:02:36,713 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-29 12:02:36,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:02:36,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057253074] [2021-08-29 12:02:36,714 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:02:36,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784425095] [2021-08-29 12:02:36,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784425095] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 12:02:36,714 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 12:02:36,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 12:02:36,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350487317] [2021-08-29 12:02:36,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 12:02:36,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:02:36,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 12:02:36,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 12:02:36,715 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:36,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:02:36,821 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2021-08-29 12:02:36,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 12:02:36,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-08-29 12:02:36,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:02:36,829 INFO L225 Difference]: With dead ends: 84 [2021-08-29 12:02:36,829 INFO L226 Difference]: Without dead ends: 80 [2021-08-29 12:02:36,829 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.94ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 12:02:36,832 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 70.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.80ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 91.91ms IncrementalHoareTripleChecker+Time [2021-08-29 12:02:36,833 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 137 Unknown, 0 Unchecked, 0.80ms Time], IncrementalHoareTripleChecker [3 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 91.91ms Time] [2021-08-29 12:02:36,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-08-29 12:02:36,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 60. [2021-08-29 12:02:36,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:36,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2021-08-29 12:02:36,839 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 10 [2021-08-29 12:02:36,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:02:36,839 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2021-08-29 12:02:36,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:36,839 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2021-08-29 12:02:36,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-29 12:02:36,839 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:02:36,839 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 12:02:36,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-29 12:02:37,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:02:37,057 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-08-29 12:02:37,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:02:37,058 INFO L82 PathProgramCache]: Analyzing trace with hash -828134125, now seen corresponding path program 1 times [2021-08-29 12:02:37,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:02:37,058 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350488281] [2021-08-29 12:02:37,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:02:37,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:02:37,067 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:02:37,067 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1893560682] [2021-08-29 12:02:37,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:02:37,067 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:02:37,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:02:37,068 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) [2021-08-29 12:02:37,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-29 12:02:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 12:02:37,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-29 12:02:37,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:02:37,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:02:37,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-29 12:02:37,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:02:37,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350488281] [2021-08-29 12:02:37,223 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:02:37,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893560682] [2021-08-29 12:02:37,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893560682] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 12:02:37,223 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 12:02:37,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 12:02:37,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868023249] [2021-08-29 12:02:37,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 12:02:37,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:02:37,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 12:02:37,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 12:02:37,225 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:37,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:02:37,350 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2021-08-29 12:02:37,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 12:02:37,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-29 12:02:37,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:02:37,351 INFO L225 Difference]: With dead ends: 83 [2021-08-29 12:02:37,352 INFO L226 Difference]: Without dead ends: 59 [2021-08-29 12:02:37,352 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.24ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 12:02:37,353 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 84.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.23ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 107.90ms IncrementalHoareTripleChecker+Time [2021-08-29 12:02:37,353 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 155 Unknown, 0 Unchecked, 1.23ms Time], IncrementalHoareTripleChecker [18 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 107.90ms Time] [2021-08-29 12:02:37,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-08-29 12:02:37,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2021-08-29 12:02:37,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 55 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:37,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2021-08-29 12:02:37,359 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 12 [2021-08-29 12:02:37,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:02:37,359 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2021-08-29 12:02:37,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:37,360 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2021-08-29 12:02:37,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-29 12:02:37,360 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:02:37,360 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 12:02:37,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-29 12:02:37,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:02:37,578 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-08-29 12:02:37,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:02:37,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1416701979, now seen corresponding path program 1 times [2021-08-29 12:02:37,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:02:37,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989028268] [2021-08-29 12:02:37,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:02:37,579 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:02:37,586 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:02:37,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [593531748] [2021-08-29 12:02:37,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:02:37,586 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:02:37,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:02:37,587 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) [2021-08-29 12:02:37,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-29 12:02:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 12:02:37,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-29 12:02:37,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:02:37,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:02:37,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 12:02:37,799 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:02:37,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:02:37,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989028268] [2021-08-29 12:02:37,799 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:02:37,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593531748] [2021-08-29 12:02:37,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593531748] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 12:02:37,800 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-29 12:02:37,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-08-29 12:02:37,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331672452] [2021-08-29 12:02:37,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-29 12:02:37,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:02:37,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-29 12:02:37,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-08-29 12:02:37,801 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:38,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:02:38,001 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2021-08-29 12:02:38,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-29 12:02:38,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-08-29 12:02:38,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:02:38,002 INFO L225 Difference]: With dead ends: 92 [2021-08-29 12:02:38,002 INFO L226 Difference]: Without dead ends: 86 [2021-08-29 12:02:38,003 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 51.04ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-08-29 12:02:38,003 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 125 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 125.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.18ms SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 148.96ms IncrementalHoareTripleChecker+Time [2021-08-29 12:02:38,003 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 0 Invalid, 201 Unknown, 0 Unchecked, 2.18ms Time], IncrementalHoareTripleChecker [39 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 148.96ms Time] [2021-08-29 12:02:38,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-08-29 12:02:38,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 50. [2021-08-29 12:02:38,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 49 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:38,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2021-08-29 12:02:38,009 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 20 [2021-08-29 12:02:38,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:02:38,009 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2021-08-29 12:02:38,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:38,009 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2021-08-29 12:02:38,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-29 12:02:38,010 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:02:38,010 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 12:02:38,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-29 12:02:38,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:02:38,218 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-08-29 12:02:38,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:02:38,219 INFO L82 PathProgramCache]: Analyzing trace with hash -972705934, now seen corresponding path program 1 times [2021-08-29 12:02:38,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:02:38,219 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748433238] [2021-08-29 12:02:38,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:02:38,219 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:02:38,226 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:02:38,227 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1968253807] [2021-08-29 12:02:38,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:02:38,227 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:02:38,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:02:38,233 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) [2021-08-29 12:02:38,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-29 12:02:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 12:02:38,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-29 12:02:38,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:02:38,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:02:38,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 12:02:38,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:02:38,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:02:38,369 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748433238] [2021-08-29 12:02:38,369 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:02:38,369 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968253807] [2021-08-29 12:02:38,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968253807] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 12:02:38,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-29 12:02:38,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-08-29 12:02:38,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036837932] [2021-08-29 12:02:38,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-29 12:02:38,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:02:38,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-29 12:02:38,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-08-29 12:02:38,371 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:38,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:02:38,530 INFO L93 Difference]: Finished difference Result 144 states and 147 transitions. [2021-08-29 12:02:38,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-29 12:02:38,533 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-29 12:02:38,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:02:38,534 INFO L225 Difference]: With dead ends: 144 [2021-08-29 12:02:38,534 INFO L226 Difference]: Without dead ends: 124 [2021-08-29 12:02:38,534 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 25.26ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-29 12:02:38,535 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 111.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.93ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 132.75ms IncrementalHoareTripleChecker+Time [2021-08-29 12:02:38,535 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 245 Unknown, 0 Unchecked, 0.93ms Time], IncrementalHoareTripleChecker [5 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 132.75ms Time] [2021-08-29 12:02:38,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-08-29 12:02:38,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 76. [2021-08-29 12:02:38,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 75 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:38,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2021-08-29 12:02:38,543 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 21 [2021-08-29 12:02:38,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:02:38,543 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2021-08-29 12:02:38,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:38,544 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2021-08-29 12:02:38,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-29 12:02:38,544 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:02:38,544 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 12:02:38,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-29 12:02:38,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:02:38,761 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-08-29 12:02:38,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:02:38,761 INFO L82 PathProgramCache]: Analyzing trace with hash 54186920, now seen corresponding path program 1 times [2021-08-29 12:02:38,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:02:38,762 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565145295] [2021-08-29 12:02:38,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:02:38,762 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:02:38,768 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:02:38,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2013829973] [2021-08-29 12:02:38,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:02:38,768 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:02:38,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:02:38,771 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) [2021-08-29 12:02:38,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-29 12:02:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 12:02:38,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-29 12:02:38,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:02:38,930 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:02:38,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 12:02:38,992 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:02:38,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:02:38,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565145295] [2021-08-29 12:02:38,992 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:02:38,993 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013829973] [2021-08-29 12:02:38,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013829973] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 12:02:38,993 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-29 12:02:38,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-08-29 12:02:38,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983501292] [2021-08-29 12:02:38,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-29 12:02:38,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:02:38,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-29 12:02:38,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-08-29 12:02:38,994 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:39,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:02:39,137 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2021-08-29 12:02:39,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-29 12:02:39,137 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-08-29 12:02:39,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:02:39,138 INFO L225 Difference]: With dead ends: 100 [2021-08-29 12:02:39,138 INFO L226 Difference]: Without dead ends: 98 [2021-08-29 12:02:39,138 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 29.08ms TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-08-29 12:02:39,139 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 90.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.95ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 118.12ms IncrementalHoareTripleChecker+Time [2021-08-29 12:02:39,139 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 258 Unknown, 0 Unchecked, 1.95ms Time], IncrementalHoareTripleChecker [5 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 118.12ms Time] [2021-08-29 12:02:39,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-08-29 12:02:39,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 76. [2021-08-29 12:02:39,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 75 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:39,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2021-08-29 12:02:39,148 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 22 [2021-08-29 12:02:39,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:02:39,148 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2021-08-29 12:02:39,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:39,148 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2021-08-29 12:02:39,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-29 12:02:39,149 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:02:39,149 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 12:02:39,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-29 12:02:39,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:02:39,349 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-08-29 12:02:39,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:02:39,350 INFO L82 PathProgramCache]: Analyzing trace with hash 534178827, now seen corresponding path program 1 times [2021-08-29 12:02:39,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:02:39,350 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118300241] [2021-08-29 12:02:39,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:02:39,350 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:02:39,356 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:02:39,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2004461913] [2021-08-29 12:02:39,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:02:39,357 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:02:39,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:02:39,359 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) [2021-08-29 12:02:39,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-29 12:02:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 12:02:39,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-29 12:02:39,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:02:39,581 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:02:39,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 12:02:39,735 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:02:39,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:02:39,735 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118300241] [2021-08-29 12:02:39,735 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:02:39,735 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004461913] [2021-08-29 12:02:39,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004461913] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 12:02:39,735 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-29 12:02:39,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-08-29 12:02:39,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254435205] [2021-08-29 12:02:39,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-29 12:02:39,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:02:39,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-29 12:02:39,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-29 12:02:39,736 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:39,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:02:39,945 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2021-08-29 12:02:39,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-29 12:02:39,946 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-08-29 12:02:39,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:02:39,946 INFO L225 Difference]: With dead ends: 92 [2021-08-29 12:02:39,946 INFO L226 Difference]: Without dead ends: 74 [2021-08-29 12:02:39,947 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 126.17ms TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2021-08-29 12:02:39,947 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 87 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 136.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.98ms SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 152.39ms IncrementalHoareTripleChecker+Time [2021-08-29 12:02:39,947 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 0 Invalid, 174 Unknown, 0 Unchecked, 0.98ms Time], IncrementalHoareTripleChecker [40 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 152.39ms Time] [2021-08-29 12:02:39,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-08-29 12:02:39,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2021-08-29 12:02:39,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 63 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:39,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2021-08-29 12:02:39,953 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 24 [2021-08-29 12:02:39,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:02:39,953 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2021-08-29 12:02:39,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:39,954 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2021-08-29 12:02:39,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-29 12:02:39,954 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:02:39,954 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 12:02:39,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-29 12:02:40,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-08-29 12:02:40,161 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-08-29 12:02:40,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:02:40,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1750673281, now seen corresponding path program 1 times [2021-08-29 12:02:40,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:02:40,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509050624] [2021-08-29 12:02:40,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:02:40,162 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:02:40,167 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:02:40,167 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [119131180] [2021-08-29 12:02:40,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:02:40,167 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:02:40,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:02:40,168 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) [2021-08-29 12:02:40,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-29 12:02:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 12:02:40,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-29 12:02:40,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:02:40,501 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:02:40,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 12:02:40,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:02:40,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:02:40,888 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509050624] [2021-08-29 12:02:40,888 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:02:40,888 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119131180] [2021-08-29 12:02:40,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119131180] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 12:02:40,888 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-29 12:02:40,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-08-29 12:02:40,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891214286] [2021-08-29 12:02:40,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-29 12:02:40,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:02:40,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-29 12:02:40,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-08-29 12:02:40,890 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:41,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:02:41,038 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2021-08-29 12:02:41,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-29 12:02:41,039 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-08-29 12:02:41,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:02:41,039 INFO L225 Difference]: With dead ends: 74 [2021-08-29 12:02:41,040 INFO L226 Difference]: Without dead ends: 72 [2021-08-29 12:02:41,040 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 161.85ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-29 12:02:41,040 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 92.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.74ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 107.99ms IncrementalHoareTripleChecker+Time [2021-08-29 12:02:41,040 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 212 Unknown, 0 Unchecked, 0.74ms Time], IncrementalHoareTripleChecker [15 Valid, 166 Invalid, 0 Unknown, 31 Unchecked, 107.99ms Time] [2021-08-29 12:02:41,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-08-29 12:02:41,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2021-08-29 12:02:41,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 67 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:41,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2021-08-29 12:02:41,047 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 31 [2021-08-29 12:02:41,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:02:41,047 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2021-08-29 12:02:41,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:41,047 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2021-08-29 12:02:41,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-29 12:02:41,048 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:02:41,048 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 12:02:41,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-29 12:02:41,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-08-29 12:02:41,257 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-08-29 12:02:41,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:02:41,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1230314914, now seen corresponding path program 1 times [2021-08-29 12:02:41,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:02:41,258 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047066355] [2021-08-29 12:02:41,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:02:41,258 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:02:41,264 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:02:41,264 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1210454612] [2021-08-29 12:02:41,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:02:41,264 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:02:41,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:02:41,267 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) [2021-08-29 12:02:41,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-29 12:02:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 12:02:41,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-29 12:02:41,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:02:41,579 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:02:41,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 12:02:41,884 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:02:41,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:02:41,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047066355] [2021-08-29 12:02:41,884 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:02:41,885 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210454612] [2021-08-29 12:02:41,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210454612] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 12:02:41,885 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-29 12:02:41,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-08-29 12:02:41,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299844388] [2021-08-29 12:02:41,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-29 12:02:41,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:02:41,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-29 12:02:41,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-08-29 12:02:41,886 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:42,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:02:42,067 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2021-08-29 12:02:42,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-29 12:02:42,067 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-08-29 12:02:42,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:02:42,068 INFO L225 Difference]: With dead ends: 72 [2021-08-29 12:02:42,068 INFO L226 Difference]: Without dead ends: 64 [2021-08-29 12:02:42,068 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 98.95ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-08-29 12:02:42,069 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 116.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.90ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 133.75ms IncrementalHoareTripleChecker+Time [2021-08-29 12:02:42,069 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 268 Unknown, 0 Unchecked, 0.90ms Time], IncrementalHoareTripleChecker [3 Valid, 222 Invalid, 0 Unknown, 43 Unchecked, 133.75ms Time] [2021-08-29 12:02:42,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-08-29 12:02:42,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-08-29 12:02:42,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 61 states have (on average 1.098360655737705) internal successors, (67), 63 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:42,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2021-08-29 12:02:42,076 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 33 [2021-08-29 12:02:42,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:02:42,076 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2021-08-29 12:02:42,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:42,081 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2021-08-29 12:02:42,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-29 12:02:42,081 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:02:42,081 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2021-08-29 12:02:42,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-08-29 12:02:42,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-08-29 12:02:42,282 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-08-29 12:02:42,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:02:42,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1367719072, now seen corresponding path program 2 times [2021-08-29 12:02:42,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:02:42,283 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950794760] [2021-08-29 12:02:42,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:02:42,283 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:02:42,290 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:02:42,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1264153181] [2021-08-29 12:02:42,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-29 12:02:42,291 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:02:42,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:02:42,292 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) [2021-08-29 12:02:42,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-08-29 12:02:42,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-29 12:02:42,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 12:02:42,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-29 12:02:42,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:02:42,608 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:02:42,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 12:02:42,809 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:02:42,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:02:42,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950794760] [2021-08-29 12:02:42,809 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:02:42,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264153181] [2021-08-29 12:02:42,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264153181] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 12:02:42,809 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-29 12:02:42,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-08-29 12:02:42,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270374673] [2021-08-29 12:02:42,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-29 12:02:42,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:02:42,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-29 12:02:42,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-08-29 12:02:42,811 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:43,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:02:43,495 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2021-08-29 12:02:43,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-29 12:02:43,496 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-08-29 12:02:43,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:02:43,496 INFO L225 Difference]: With dead ends: 124 [2021-08-29 12:02:43,496 INFO L226 Difference]: Without dead ends: 122 [2021-08-29 12:02:43,497 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 334.94ms TimeCoverageRelationStatistics Valid=188, Invalid=462, Unknown=0, NotChecked=0, Total=650 [2021-08-29 12:02:43,497 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 139 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 370.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.93ms SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 406.73ms IncrementalHoareTripleChecker+Time [2021-08-29 12:02:43,497 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 0 Invalid, 464 Unknown, 0 Unchecked, 1.93ms Time], IncrementalHoareTripleChecker [47 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 406.73ms Time] [2021-08-29 12:02:43,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-08-29 12:02:43,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 81. [2021-08-29 12:02:43,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 78 states have (on average 1.0897435897435896) internal successors, (85), 80 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:43,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2021-08-29 12:02:43,506 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 34 [2021-08-29 12:02:43,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:02:43,506 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2021-08-29 12:02:43,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:43,506 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2021-08-29 12:02:43,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-08-29 12:02:43,508 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:02:43,509 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 12:02:43,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-08-29 12:02:43,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-08-29 12:02:43,725 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-08-29 12:02:43,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:02:43,725 INFO L82 PathProgramCache]: Analyzing trace with hash -230259065, now seen corresponding path program 2 times [2021-08-29 12:02:43,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:02:43,725 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288724684] [2021-08-29 12:02:43,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:02:43,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:02:43,730 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:02:43,731 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1413132122] [2021-08-29 12:02:43,731 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-29 12:02:43,731 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:02:43,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:02:43,738 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) [2021-08-29 12:02:43,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-08-29 12:02:43,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-29 12:02:43,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 12:02:43,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 26 conjunts are in the unsatisfiable core [2021-08-29 12:02:43,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:02:44,273 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:02:44,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 12:02:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:02:44,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:02:44,694 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288724684] [2021-08-29 12:02:44,694 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:02:44,694 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413132122] [2021-08-29 12:02:44,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413132122] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 12:02:44,694 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-29 12:02:44,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-08-29 12:02:44,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642633147] [2021-08-29 12:02:44,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-29 12:02:44,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:02:44,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-29 12:02:44,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-08-29 12:02:44,696 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:45,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:02:45,005 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2021-08-29 12:02:45,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-29 12:02:45,005 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-08-29 12:02:45,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:02:45,006 INFO L225 Difference]: With dead ends: 99 [2021-08-29 12:02:45,006 INFO L226 Difference]: Without dead ends: 97 [2021-08-29 12:02:45,006 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 288.59ms TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2021-08-29 12:02:45,007 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 108.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.81ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 126.85ms IncrementalHoareTripleChecker+Time [2021-08-29 12:02:45,007 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 327 Unknown, 0 Unchecked, 0.81ms Time], IncrementalHoareTripleChecker [21 Valid, 206 Invalid, 0 Unknown, 100 Unchecked, 126.85ms Time] [2021-08-29 12:02:45,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-08-29 12:02:45,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2021-08-29 12:02:45,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 82 states have (on average 1.0853658536585367) internal successors, (89), 84 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:45,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2021-08-29 12:02:45,014 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 43 [2021-08-29 12:02:45,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:02:45,015 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2021-08-29 12:02:45,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:02:45,015 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2021-08-29 12:02:45,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-29 12:02:45,015 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:02:45,015 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 12:02:45,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-08-29 12:02:45,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-08-29 12:02:45,220 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-08-29 12:02:45,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:02:45,221 INFO L82 PathProgramCache]: Analyzing trace with hash 2059495850, now seen corresponding path program 2 times [2021-08-29 12:02:45,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:02:45,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741404247] [2021-08-29 12:02:45,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:02:45,221 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:02:45,233 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:02:45,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1672557525] [2021-08-29 12:02:45,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-29 12:02:45,233 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:02:45,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:02:45,240 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) [2021-08-29 12:02:45,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-08-29 12:02:46,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-08-29 12:02:46,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 12:02:46,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 36 conjunts are in the unsatisfiable core [2021-08-29 12:02:46,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:02:59,072 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-29 12:02:59,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-29 12:02:59,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:02:59,072 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741404247] [2021-08-29 12:02:59,072 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:02:59,072 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672557525] [2021-08-29 12:02:59,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672557525] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 12:02:59,072 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 12:02:59,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-29 12:02:59,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102648308] [2021-08-29 12:02:59,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-29 12:02:59,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:02:59,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-29 12:02:59,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=133, Unknown=1, NotChecked=0, Total=182 [2021-08-29 12:02:59,073 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:03:01,551 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-08-29 12:03:04,159 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-08-29 12:03:06,427 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-08-29 12:03:07,972 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-08-29 12:03:09,134 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-08-29 12:03:11,491 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-08-29 12:03:14,086 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-08-29 12:03:16,337 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-08-29 12:03:19,496 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-08-29 12:03:22,299 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-08-29 12:03:24,556 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-08-29 12:03:27,183 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-08-29 12:03:29,208 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-08-29 12:03:31,281 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-08-29 12:03:34,667 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-08-29 12:03:41,187 WARN L210 SmtUtils]: Spent 5.70s on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2021-08-29 12:03:42,639 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-08-29 12:03:45,865 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-08-29 12:03:47,868 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-08-29 12:03:49,872 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-08-29 12:03:52,869 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-08-29 12:03:56,279 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-08-29 12:03:57,845 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-08-29 12:04:00,236 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-08-29 12:04:01,249 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-08-29 12:04:04,359 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-08-29 12:04:06,535 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-08-29 12:04:09,045 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-08-29 12:04:11,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:04:11,097 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2021-08-29 12:04:11,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-29 12:04:11,097 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-08-29 12:04:11,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:04:11,098 INFO L225 Difference]: With dead ends: 95 [2021-08-29 12:04:11,098 INFO L226 Difference]: Without dead ends: 85 [2021-08-29 12:04:11,098 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 15943.93ms TimeCoverageRelationStatistics Valid=84, Invalid=187, Unknown=1, NotChecked=0, Total=272 [2021-08-29 12:04:11,099 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 38 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 33 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63540.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.03ms SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 63621.70ms IncrementalHoareTripleChecker+Time [2021-08-29 12:04:11,099 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 0 Invalid, 194 Unknown, 0 Unchecked, 2.03ms Time], IncrementalHoareTripleChecker [33 Valid, 143 Invalid, 18 Unknown, 0 Unchecked, 63621.70ms Time] [2021-08-29 12:04:11,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-08-29 12:04:11,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2021-08-29 12:04:11,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 75 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:04:11,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2021-08-29 12:04:11,107 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 45 [2021-08-29 12:04:11,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:04:11,108 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2021-08-29 12:04:11,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:04:11,108 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2021-08-29 12:04:11,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-29 12:04:11,108 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:04:11,108 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 12:04:11,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-08-29 12:04:11,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-08-29 12:04:11,309 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-08-29 12:04:11,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:04:11,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1986227318, now seen corresponding path program 2 times [2021-08-29 12:04:11,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:04:11,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565509964] [2021-08-29 12:04:11,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:04:11,310 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:04:11,329 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:04:11,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1332054286] [2021-08-29 12:04:11,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-29 12:04:11,330 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:04:11,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:04:11,331 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) [2021-08-29 12:04:11,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-08-29 12:04:11,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-29 12:04:11,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 12:04:11,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-29 12:04:11,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:04:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:04:11,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 12:04:11,636 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:04:11,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:04:11,636 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565509964] [2021-08-29 12:04:11,637 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:04:11,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332054286] [2021-08-29 12:04:11,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332054286] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 12:04:11,637 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-29 12:04:11,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2021-08-29 12:04:11,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592071451] [2021-08-29 12:04:11,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-29 12:04:11,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:04:11,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-29 12:04:11,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2021-08-29 12:04:11,639 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 13 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:04:11,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:04:11,885 INFO L93 Difference]: Finished difference Result 178 states and 184 transitions. [2021-08-29 12:04:11,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-29 12:04:11,886 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 13 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-08-29 12:04:11,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:04:11,886 INFO L225 Difference]: With dead ends: 178 [2021-08-29 12:04:11,886 INFO L226 Difference]: Without dead ends: 168 [2021-08-29 12:04:11,887 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 108.51ms TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2021-08-29 12:04:11,887 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 87 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 133.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.27ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 163.17ms IncrementalHoareTripleChecker+Time [2021-08-29 12:04:11,888 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 0 Invalid, 273 Unknown, 0 Unchecked, 1.27ms Time], IncrementalHoareTripleChecker [11 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 163.17ms Time] [2021-08-29 12:04:11,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-08-29 12:04:11,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 138. [2021-08-29 12:04:11,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 136 states have (on average 1.0588235294117647) internal successors, (144), 137 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:04:11,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 144 transitions. [2021-08-29 12:04:11,902 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 144 transitions. Word has length 57 [2021-08-29 12:04:11,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:04:11,902 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 144 transitions. [2021-08-29 12:04:11,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 13 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:04:11,903 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 144 transitions. [2021-08-29 12:04:11,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-29 12:04:11,904 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:04:11,904 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 12:04:11,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-08-29 12:04:12,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:04:12,126 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-08-29 12:04:12,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:04:12,126 INFO L82 PathProgramCache]: Analyzing trace with hash -60719465, now seen corresponding path program 3 times [2021-08-29 12:04:12,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:04:12,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786015544] [2021-08-29 12:04:12,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:04:12,126 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:04:12,131 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:04:12,137 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1306558300] [2021-08-29 12:04:12,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-29 12:04:12,138 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:04:12,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:04:12,140 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) [2021-08-29 12:04:12,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-08-29 12:04:12,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-08-29 12:04:12,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 12:04:12,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 48 conjunts are in the unsatisfiable core [2021-08-29 12:04:12,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:04:26,904 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 70 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-08-29 12:04:26,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 12:04:36,990 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-08-29 12:04:36,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:04:36,990 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786015544] [2021-08-29 12:04:36,990 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:04:36,990 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306558300] [2021-08-29 12:04:36,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306558300] provided 1 perfect and 1 imperfect interpolant sequences [2021-08-29 12:04:36,991 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-29 12:04:36,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [16] total 25 [2021-08-29 12:04:36,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738750370] [2021-08-29 12:04:36,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-29 12:04:36,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:04:36,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-29 12:04:36,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=431, Unknown=6, NotChecked=0, Total=600 [2021-08-29 12:04:36,992 INFO L87 Difference]: Start difference. First operand 138 states and 144 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:04:44,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:04:44,648 INFO L93 Difference]: Finished difference Result 140 states and 145 transitions. [2021-08-29 12:04:44,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-29 12:04:44,649 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-08-29 12:04:44,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:04:44,649 INFO L225 Difference]: With dead ends: 140 [2021-08-29 12:04:44,649 INFO L226 Difference]: Without dead ends: 134 [2021-08-29 12:04:44,650 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 106 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 30095.25ms TimeCoverageRelationStatistics Valid=205, Invalid=544, Unknown=7, NotChecked=0, Total=756 [2021-08-29 12:04:44,650 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 94 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 395.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.75ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 407.52ms IncrementalHoareTripleChecker+Time [2021-08-29 12:04:44,651 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 0.75ms Time], IncrementalHoareTripleChecker [11 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 407.52ms Time] [2021-08-29 12:04:44,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-08-29 12:04:44,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2021-08-29 12:04:44,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 132 states have (on average 1.0151515151515151) internal successors, (134), 133 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:04:44,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2021-08-29 12:04:44,665 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 67 [2021-08-29 12:04:44,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:04:44,665 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2021-08-29 12:04:44,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:04:44,665 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2021-08-29 12:04:44,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-08-29 12:04:44,666 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:04:44,666 INFO L513 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 12:04:44,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-08-29 12:04:44,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-08-29 12:04:44,881 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-08-29 12:04:44,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:04:44,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1790826426, now seen corresponding path program 3 times [2021-08-29 12:04:44,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:04:44,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721594160] [2021-08-29 12:04:44,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:04:44,882 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:04:44,889 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:04:44,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1123626996] [2021-08-29 12:04:44,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-29 12:04:44,889 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:04:44,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:04:44,893 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) [2021-08-29 12:04:44,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-08-29 12:04:45,001 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-08-29 12:04:45,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 12:04:45,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 23 conjunts are in the unsatisfiable core [2021-08-29 12:04:45,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:04:45,294 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:04:45,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 12:04:45,645 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:04:45,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:04:45,646 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721594160] [2021-08-29 12:04:45,646 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:04:45,646 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123626996] [2021-08-29 12:04:45,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123626996] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 12:04:45,646 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-29 12:04:45,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2021-08-29 12:04:45,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132856250] [2021-08-29 12:04:45,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-29 12:04:45,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:04:45,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-29 12:04:45,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2021-08-29 12:04:45,652 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand has 26 states, 26 states have (on average 9.73076923076923) internal successors, (253), 25 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:04:46,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:04:46,184 INFO L93 Difference]: Finished difference Result 288 states and 299 transitions. [2021-08-29 12:04:46,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-08-29 12:04:46,184 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.73076923076923) internal successors, (253), 25 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2021-08-29 12:04:46,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:04:46,186 INFO L225 Difference]: With dead ends: 288 [2021-08-29 12:04:46,186 INFO L226 Difference]: Without dead ends: 278 [2021-08-29 12:04:46,187 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 405.00ms TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2021-08-29 12:04:46,187 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 114 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 195.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.66ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 250.45ms IncrementalHoareTripleChecker+Time [2021-08-29 12:04:46,187 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 0 Invalid, 389 Unknown, 0 Unchecked, 1.66ms Time], IncrementalHoareTripleChecker [26 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 250.45ms Time] [2021-08-29 12:04:46,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-08-29 12:04:46,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2021-08-29 12:04:46,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 276 states have (on average 1.0072463768115942) internal successors, (278), 277 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:04:46,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2021-08-29 12:04:46,219 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 129 [2021-08-29 12:04:46,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:04:46,219 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 278 transitions. [2021-08-29 12:04:46,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.73076923076923) internal successors, (253), 25 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:04:46,219 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 278 transitions. [2021-08-29 12:04:46,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2021-08-29 12:04:46,221 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:04:46,221 INFO L513 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 12:04:46,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-08-29 12:04:46,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-08-29 12:04:46,425 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-08-29 12:04:46,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:04:46,425 INFO L82 PathProgramCache]: Analyzing trace with hash -302624742, now seen corresponding path program 4 times [2021-08-29 12:04:46,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:04:46,426 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791606197] [2021-08-29 12:04:46,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:04:46,426 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:04:46,432 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:04:46,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1847184634] [2021-08-29 12:04:46,432 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-29 12:04:46,433 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:04:46,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:04:46,433 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 12:04:46,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-08-29 12:04:46,599 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-29 12:04:46,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 12:04:46,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 918 conjuncts, 47 conjunts are in the unsatisfiable core [2021-08-29 12:04:46,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:04:47,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2816 backedges. 0 proven. 2816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:04:47,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 12:04:48,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2816 backedges. 0 proven. 2816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:04:48,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:04:48,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791606197] [2021-08-29 12:04:48,079 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:04:48,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847184634] [2021-08-29 12:04:48,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847184634] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 12:04:48,080 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-29 12:04:48,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2021-08-29 12:04:48,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710285700] [2021-08-29 12:04:48,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-08-29 12:04:48,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:04:48,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-08-29 12:04:48,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2021-08-29 12:04:48,082 INFO L87 Difference]: Start difference. First operand 278 states and 278 transitions. Second operand has 50 states, 50 states have (on average 10.82) internal successors, (541), 49 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:04:49,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:04:49,343 INFO L93 Difference]: Finished difference Result 576 states and 599 transitions. [2021-08-29 12:04:49,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-08-29 12:04:49,343 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 10.82) internal successors, (541), 49 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 273 [2021-08-29 12:04:49,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:04:49,345 INFO L225 Difference]: With dead ends: 576 [2021-08-29 12:04:49,345 INFO L226 Difference]: Without dead ends: 566 [2021-08-29 12:04:49,347 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 496 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1308.78ms TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2021-08-29 12:04:49,347 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 233 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 356.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.72ms SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 463.97ms IncrementalHoareTripleChecker+Time [2021-08-29 12:04:49,347 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 0 Invalid, 713 Unknown, 0 Unchecked, 2.72ms Time], IncrementalHoareTripleChecker [49 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 463.97ms Time] [2021-08-29 12:04:49,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2021-08-29 12:04:49,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2021-08-29 12:04:49,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 564 states have (on average 1.00354609929078) internal successors, (566), 565 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:04:49,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 566 transitions. [2021-08-29 12:04:49,405 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 566 transitions. Word has length 273 [2021-08-29 12:04:49,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:04:49,405 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 566 transitions. [2021-08-29 12:04:49,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 10.82) internal successors, (541), 49 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:04:49,406 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 566 transitions. [2021-08-29 12:04:49,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2021-08-29 12:04:49,411 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:04:49,411 INFO L513 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 12:04:49,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-08-29 12:04:49,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-08-29 12:04:49,625 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-08-29 12:04:49,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:04:49,625 INFO L82 PathProgramCache]: Analyzing trace with hash 696189146, now seen corresponding path program 5 times [2021-08-29 12:04:49,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:04:49,626 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231701227] [2021-08-29 12:04:49,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:04:49,626 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:04:49,636 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:04:49,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2081082779] [2021-08-29 12:04:49,636 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-29 12:04:49,637 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:04:49,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:04:49,638 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 12:04:49,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-08-29 12:05:00,394 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2021-08-29 12:05:00,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 12:05:00,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 1854 conjuncts, 95 conjunts are in the unsatisfiable core [2021-08-29 12:05:00,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:05:02,149 INFO L134 CoverageAnalysis]: Checked inductivity of 12512 backedges. 0 proven. 12512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:05:02,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 12:05:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 12512 backedges. 0 proven. 12512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:05:05,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:05:05,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231701227] [2021-08-29 12:05:05,084 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:05:05,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081082779] [2021-08-29 12:05:05,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081082779] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 12:05:05,085 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-29 12:05:05,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 97 [2021-08-29 12:05:05,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956527126] [2021-08-29 12:05:05,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2021-08-29 12:05:05,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:05:05,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2021-08-29 12:05:05,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506 [2021-08-29 12:05:05,089 INFO L87 Difference]: Start difference. First operand 566 states and 566 transitions. Second operand has 98 states, 98 states have (on average 11.39795918367347) internal successors, (1117), 97 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:05:09,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:05:09,392 INFO L93 Difference]: Finished difference Result 1152 states and 1199 transitions. [2021-08-29 12:05:09,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2021-08-29 12:05:09,393 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 11.39795918367347) internal successors, (1117), 97 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 561 [2021-08-29 12:05:09,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:05:09,400 INFO L225 Difference]: With dead ends: 1152 [2021-08-29 12:05:09,400 INFO L226 Difference]: Without dead ends: 1142 [2021-08-29 12:05:09,408 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 1213 GetRequests, 1024 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5452 ImplicationChecksByTransitivity, 5433.89ms TimeCoverageRelationStatistics Valid=13540, Invalid=22750, Unknown=0, NotChecked=0, Total=36290 [2021-08-29 12:05:09,409 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 477 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 814.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.76ms SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1045.90ms IncrementalHoareTripleChecker+Time [2021-08-29 12:05:09,409 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [477 Valid, 0 Invalid, 1358 Unknown, 0 Unchecked, 5.76ms Time], IncrementalHoareTripleChecker [101 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 1045.90ms Time] [2021-08-29 12:05:09,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2021-08-29 12:05:09,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1142. [2021-08-29 12:05:09,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 1140 states have (on average 1.0017543859649123) internal successors, (1142), 1141 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:05:09,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1142 transitions. [2021-08-29 12:05:09,576 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1142 transitions. Word has length 561 [2021-08-29 12:05:09,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:05:09,577 INFO L470 AbstractCegarLoop]: Abstraction has 1142 states and 1142 transitions. [2021-08-29 12:05:09,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 11.39795918367347) internal successors, (1117), 97 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:05:09,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1142 transitions. [2021-08-29 12:05:09,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1138 [2021-08-29 12:05:09,611 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:05:09,611 INFO L513 BasicCegarLoop]: trace histogram [95, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 12:05:09,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-08-29 12:05:09,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:05:09,817 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-08-29 12:05:09,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:05:09,817 INFO L82 PathProgramCache]: Analyzing trace with hash 2129617498, now seen corresponding path program 6 times [2021-08-29 12:05:09,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:05:09,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348850018] [2021-08-29 12:05:09,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:05:09,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:05:09,840 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:05:09,841 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [735278623] [2021-08-29 12:05:09,841 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-29 12:05:09,841 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:05:09,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:05:09,842 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 12:05:09,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-08-29 12:06:35,665 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2021-08-29 12:06:35,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 12:06:35,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 3726 conjuncts, 191 conjunts are in the unsatisfiable core [2021-08-29 12:06:35,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:06:40,087 INFO L134 CoverageAnalysis]: Checked inductivity of 52640 backedges. 0 proven. 52640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:06:40,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 12:06:42,232 INFO L134 CoverageAnalysis]: Checked inductivity of 52640 backedges. 0 proven. 52640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:06:42,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:06:42,232 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348850018] [2021-08-29 12:06:42,232 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:06:42,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735278623] [2021-08-29 12:06:42,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735278623] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 12:06:42,233 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-29 12:06:42,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 103 [2021-08-29 12:06:42,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812598515] [2021-08-29 12:06:42,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2021-08-29 12:06:42,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:06:42,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2021-08-29 12:06:42,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2021-08-29 12:06:42,237 INFO L87 Difference]: Start difference. First operand 1142 states and 1142 transitions. Second operand has 104 states, 104 states have (on average 11.548076923076923) internal successors, (1201), 103 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:06:46,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:06:46,898 INFO L93 Difference]: Finished difference Result 1224 states and 1229 transitions. [2021-08-29 12:06:46,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2021-08-29 12:06:46,898 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 11.548076923076923) internal successors, (1201), 103 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1137 [2021-08-29 12:06:46,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:06:46,902 INFO L225 Difference]: With dead ends: 1224 [2021-08-29 12:06:46,902 INFO L226 Difference]: Without dead ends: 1214 [2021-08-29 12:06:46,905 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2371 GetRequests, 2169 SyntacticMatches, 1 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5055 ImplicationChecksByTransitivity, 6117.33ms TimeCoverageRelationStatistics Valid=15349, Invalid=25657, Unknown=0, NotChecked=0, Total=41006 [2021-08-29 12:06:46,905 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 6 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 765.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.98ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 949.32ms IncrementalHoareTripleChecker+Time [2021-08-29 12:06:46,905 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 0 Invalid, 1318 Unknown, 0 Unchecked, 2.98ms Time], IncrementalHoareTripleChecker [6 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 949.32ms Time] [2021-08-29 12:06:46,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2021-08-29 12:06:47,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1214. [2021-08-29 12:06:47,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1212 states have (on average 1.0016501650165017) internal successors, (1214), 1213 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:06:47,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1214 transitions. [2021-08-29 12:06:47,050 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1214 transitions. Word has length 1137 [2021-08-29 12:06:47,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:06:47,052 INFO L470 AbstractCegarLoop]: Abstraction has 1214 states and 1214 transitions. [2021-08-29 12:06:47,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 11.548076923076923) internal successors, (1201), 103 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:06:47,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1214 transitions. [2021-08-29 12:06:47,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2021-08-29 12:06:47,062 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:06:47,062 INFO L513 BasicCegarLoop]: trace histogram [101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 12:06:47,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-08-29 12:06:47,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:06:47,277 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-08-29 12:06:47,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:06:47,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1415686518, now seen corresponding path program 7 times [2021-08-29 12:06:47,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:06:47,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604816157] [2021-08-29 12:06:47,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:06:47,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:06:47,295 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:06:47,295 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [6466131] [2021-08-29 12:06:47,296 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-29 12:06:47,296 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:06:47,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:06:47,297 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 12:06:47,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-08-29 12:06:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 12:06:48,043 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-29 12:06:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 12:06:49,166 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-29 12:06:49,166 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-08-29 12:06:49,664 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (10 of 11 remaining) [2021-08-29 12:06:49,665 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (9 of 11 remaining) [2021-08-29 12:06:49,665 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (8 of 11 remaining) [2021-08-29 12:06:49,666 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (7 of 11 remaining) [2021-08-29 12:06:49,666 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (6 of 11 remaining) [2021-08-29 12:06:49,666 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 11 remaining) [2021-08-29 12:06:49,666 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 11 remaining) [2021-08-29 12:06:49,666 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (3 of 11 remaining) [2021-08-29 12:06:49,666 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (2 of 11 remaining) [2021-08-29 12:06:49,667 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (1 of 11 remaining) [2021-08-29 12:06:49,667 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (0 of 11 remaining) [2021-08-29 12:06:49,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2021-08-29 12:06:49,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-08-29 12:06:49,949 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-29 12:06:50,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 12:06:50 BoogieIcfgContainer [2021-08-29 12:06:50,897 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-29 12:06:50,897 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-29 12:06:50,897 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-29 12:06:50,897 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-29 12:06:50,898 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 12:02:35" (3/4) ... [2021-08-29 12:06:50,899 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-29 12:06:51,280 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-29 12:06:51,281 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-29 12:06:51,281 INFO L158 Benchmark]: Toolchain (without parser) took 256642.44ms. Allocated memory was 56.6MB in the beginning and 257.9MB in the end (delta: 201.3MB). Free memory was 35.1MB in the beginning and 132.8MB in the end (delta: -97.7MB). Peak memory consumption was 151.1MB. Max. memory is 16.1GB. [2021-08-29 12:06:51,281 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory was 38.0MB in the beginning and 38.0MB in the end (delta: 42.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 12:06:51,282 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.97ms. Allocated memory is still 56.6MB. Free memory was 35.0MB in the beginning and 40.5MB in the end (delta: -5.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-08-29 12:06:51,282 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.03ms. Allocated memory is still 56.6MB. Free memory was 40.5MB in the beginning and 38.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. [2021-08-29 12:06:51,282 INFO L158 Benchmark]: Boogie Preprocessor took 31.37ms. Allocated memory is still 56.6MB. Free memory was 38.8MB in the beginning and 37.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 12:06:51,282 INFO L158 Benchmark]: RCFGBuilder took 194.99ms. Allocated memory is still 56.6MB. Free memory was 37.5MB in the beginning and 27.7MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-08-29 12:06:51,283 INFO L158 Benchmark]: TraceAbstraction took 255791.77ms. Allocated memory was 56.6MB in the beginning and 257.9MB in the end (delta: 201.3MB). Free memory was 27.3MB in the beginning and 92.9MB in the end (delta: -65.6MB). Peak memory consumption was 147.9MB. Max. memory is 16.1GB. [2021-08-29 12:06:51,283 INFO L158 Benchmark]: Witness Printer took 383.83ms. Allocated memory is still 257.9MB. Free memory was 92.9MB in the beginning and 132.8MB in the end (delta: -40.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-08-29 12:06:51,284 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.16ms. Allocated memory is still 56.6MB. Free memory was 38.0MB in the beginning and 38.0MB in the end (delta: 42.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.97ms. Allocated memory is still 56.6MB. Free memory was 35.0MB in the beginning and 40.5MB in the end (delta: -5.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.03ms. Allocated memory is still 56.6MB. Free memory was 40.5MB in the beginning and 38.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.37ms. Allocated memory is still 56.6MB. Free memory was 38.8MB in the beginning and 37.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 194.99ms. Allocated memory is still 56.6MB. Free memory was 37.5MB in the beginning and 27.7MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 255791.77ms. Allocated memory was 56.6MB in the beginning and 257.9MB in the end (delta: 201.3MB). Free memory was 27.3MB in the beginning and 92.9MB in the end (delta: -65.6MB). Peak memory consumption was 147.9MB. Max. memory is 16.1GB. * Witness Printer took 383.83ms. Allocated memory is still 257.9MB. Free memory was 92.9MB in the beginning and 132.8MB in the end (delta: -40.0MB). 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.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms 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_unsigned_short() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [counter=0] [L33] EXPR counter++ VAL [counter=1] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=1] [L15] COND FALSE !(!(cond)) VAL [counter=1] [L15] COND FALSE !(!(cond)) VAL [counter=1] [L15] COND FALSE !(!(cond)) VAL [counter=1] [L15] COND FALSE !(!(cond)) VAL [counter=1] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=1] [L33] EXPR counter++ VAL [counter=2] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=2] [L15] COND FALSE !(!(cond)) VAL [counter=2] [L15] COND FALSE !(!(cond)) VAL [counter=2] [L15] COND FALSE !(!(cond)) VAL [counter=2] [L15] COND FALSE !(!(cond)) VAL [counter=2] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=2] [L33] EXPR counter++ VAL [counter=3] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=3] [L15] COND FALSE !(!(cond)) VAL [counter=3] [L15] COND FALSE !(!(cond)) VAL [counter=3] [L15] COND FALSE !(!(cond)) VAL [counter=3] [L15] COND FALSE !(!(cond)) VAL [counter=3] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=3] [L33] EXPR counter++ VAL [counter=4] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=4] [L15] COND FALSE !(!(cond)) VAL [counter=4] [L15] COND FALSE !(!(cond)) VAL [counter=4] [L15] COND FALSE !(!(cond)) VAL [counter=4] [L15] COND FALSE !(!(cond)) VAL [counter=4] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=4] [L33] EXPR counter++ VAL [counter=5] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=5] [L15] COND FALSE !(!(cond)) VAL [counter=5] [L15] COND FALSE !(!(cond)) VAL [counter=5] [L15] COND FALSE !(!(cond)) VAL [counter=5] [L15] COND FALSE !(!(cond)) VAL [counter=5] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=5] [L33] EXPR counter++ VAL [counter=6] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=6] [L15] COND FALSE !(!(cond)) VAL [counter=6] [L15] COND FALSE !(!(cond)) VAL [counter=6] [L15] COND FALSE !(!(cond)) VAL [counter=6] [L15] COND FALSE !(!(cond)) VAL [counter=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=6] [L33] EXPR counter++ VAL [counter=7] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=7] [L15] COND FALSE !(!(cond)) VAL [counter=7] [L15] COND FALSE !(!(cond)) VAL [counter=7] [L15] COND FALSE !(!(cond)) VAL [counter=7] [L15] COND FALSE !(!(cond)) VAL [counter=7] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=7] [L33] EXPR counter++ VAL [counter=8] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=8] [L15] COND FALSE !(!(cond)) VAL [counter=8] [L15] COND FALSE !(!(cond)) VAL [counter=8] [L15] COND FALSE !(!(cond)) VAL [counter=8] [L15] COND FALSE !(!(cond)) VAL [counter=8] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=8] [L33] EXPR counter++ VAL [counter=9] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=9] [L15] COND FALSE !(!(cond)) VAL [counter=9] [L15] COND FALSE !(!(cond)) VAL [counter=9] [L15] COND FALSE !(!(cond)) VAL [counter=9] [L15] COND FALSE !(!(cond)) VAL [counter=9] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=9] [L33] EXPR counter++ VAL [counter=10] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=10] [L15] COND FALSE !(!(cond)) VAL [counter=10] [L15] COND FALSE !(!(cond)) VAL [counter=10] [L15] COND FALSE !(!(cond)) VAL [counter=10] [L15] COND FALSE !(!(cond)) VAL [counter=10] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=10] [L33] EXPR counter++ VAL [counter=11] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=11] [L15] COND FALSE !(!(cond)) VAL [counter=11] [L15] COND FALSE !(!(cond)) VAL [counter=11] [L15] COND FALSE !(!(cond)) VAL [counter=11] [L15] COND FALSE !(!(cond)) VAL [counter=11] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=11] [L33] EXPR counter++ VAL [counter=12] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=12] [L15] COND FALSE !(!(cond)) VAL [counter=12] [L15] COND FALSE !(!(cond)) VAL [counter=12] [L15] COND FALSE !(!(cond)) VAL [counter=12] [L15] COND FALSE !(!(cond)) VAL [counter=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=12] [L33] EXPR counter++ VAL [counter=13] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=13] [L15] COND FALSE !(!(cond)) VAL [counter=13] [L15] COND FALSE !(!(cond)) VAL [counter=13] [L15] COND FALSE !(!(cond)) VAL [counter=13] [L15] COND FALSE !(!(cond)) VAL [counter=13] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=13] [L33] EXPR counter++ VAL [counter=14] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=14] [L15] COND FALSE !(!(cond)) VAL [counter=14] [L15] COND FALSE !(!(cond)) VAL [counter=14] [L15] COND FALSE !(!(cond)) VAL [counter=14] [L15] COND FALSE !(!(cond)) VAL [counter=14] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=14] [L33] EXPR counter++ VAL [counter=15] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=15] [L15] COND FALSE !(!(cond)) VAL [counter=15] [L15] COND FALSE !(!(cond)) VAL [counter=15] [L15] COND FALSE !(!(cond)) VAL [counter=15] [L15] COND FALSE !(!(cond)) VAL [counter=15] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=15] [L33] EXPR counter++ VAL [counter=16] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=16] [L15] COND FALSE !(!(cond)) VAL [counter=16] [L15] COND FALSE !(!(cond)) VAL [counter=16] [L15] COND FALSE !(!(cond)) VAL [counter=16] [L15] COND FALSE !(!(cond)) VAL [counter=16] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=16] [L33] EXPR counter++ VAL [counter=17] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=17] [L15] COND FALSE !(!(cond)) VAL [counter=17] [L15] COND FALSE !(!(cond)) VAL [counter=17] [L15] COND FALSE !(!(cond)) VAL [counter=17] [L15] COND FALSE !(!(cond)) VAL [counter=17] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=17] [L33] EXPR counter++ VAL [counter=18] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=18] [L15] COND FALSE !(!(cond)) VAL [counter=18] [L15] COND FALSE !(!(cond)) VAL [counter=18] [L15] COND FALSE !(!(cond)) VAL [counter=18] [L15] COND FALSE !(!(cond)) VAL [counter=18] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=18] [L33] EXPR counter++ VAL [counter=19] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=19] [L15] COND FALSE !(!(cond)) VAL [counter=19] [L15] COND FALSE !(!(cond)) VAL [counter=19] [L15] COND FALSE !(!(cond)) VAL [counter=19] [L15] COND FALSE !(!(cond)) VAL [counter=19] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=19] [L33] EXPR counter++ VAL [counter=20] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=20] [L15] COND FALSE !(!(cond)) VAL [counter=20] [L15] COND FALSE !(!(cond)) VAL [counter=20] [L15] COND FALSE !(!(cond)) VAL [counter=20] [L15] COND FALSE !(!(cond)) VAL [counter=20] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=20] [L33] EXPR counter++ VAL [counter=21] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=21] [L15] COND FALSE !(!(cond)) VAL [counter=21] [L15] COND FALSE !(!(cond)) VAL [counter=21] [L15] COND FALSE !(!(cond)) VAL [counter=21] [L15] COND FALSE !(!(cond)) VAL [counter=21] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=21] [L33] EXPR counter++ VAL [counter=22] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=22] [L15] COND FALSE !(!(cond)) VAL [counter=22] [L15] COND FALSE !(!(cond)) VAL [counter=22] [L15] COND FALSE !(!(cond)) VAL [counter=22] [L15] COND FALSE !(!(cond)) VAL [counter=22] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=22] [L33] EXPR counter++ VAL [counter=23] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=23] [L15] COND FALSE !(!(cond)) VAL [counter=23] [L15] COND FALSE !(!(cond)) VAL [counter=23] [L15] COND FALSE !(!(cond)) VAL [counter=23] [L15] COND FALSE !(!(cond)) VAL [counter=23] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=23] [L33] EXPR counter++ VAL [counter=24] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=24] [L15] COND FALSE !(!(cond)) VAL [counter=24] [L15] COND FALSE !(!(cond)) VAL [counter=24] [L15] COND FALSE !(!(cond)) VAL [counter=24] [L15] COND FALSE !(!(cond)) VAL [counter=24] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=24] [L33] EXPR counter++ VAL [counter=25] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=25] [L15] COND FALSE !(!(cond)) VAL [counter=25] [L15] COND FALSE !(!(cond)) VAL [counter=25] [L15] COND FALSE !(!(cond)) VAL [counter=25] [L15] COND FALSE !(!(cond)) VAL [counter=25] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=25] [L33] EXPR counter++ VAL [counter=26] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=26] [L15] COND FALSE !(!(cond)) VAL [counter=26] [L15] COND FALSE !(!(cond)) VAL [counter=26] [L15] COND FALSE !(!(cond)) VAL [counter=26] [L15] COND FALSE !(!(cond)) VAL [counter=26] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=26] [L33] EXPR counter++ VAL [counter=27] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=27] [L15] COND FALSE !(!(cond)) VAL [counter=27] [L15] COND FALSE !(!(cond)) VAL [counter=27] [L15] COND FALSE !(!(cond)) VAL [counter=27] [L15] COND FALSE !(!(cond)) VAL [counter=27] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=27] [L33] EXPR counter++ VAL [counter=28] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=28] [L15] COND FALSE !(!(cond)) VAL [counter=28] [L15] COND FALSE !(!(cond)) VAL [counter=28] [L15] COND FALSE !(!(cond)) VAL [counter=28] [L15] COND FALSE !(!(cond)) VAL [counter=28] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=28] [L33] EXPR counter++ VAL [counter=29] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=29] [L15] COND FALSE !(!(cond)) VAL [counter=29] [L15] COND FALSE !(!(cond)) VAL [counter=29] [L15] COND FALSE !(!(cond)) VAL [counter=29] [L15] COND FALSE !(!(cond)) VAL [counter=29] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=29] [L33] EXPR counter++ VAL [counter=30] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=30] [L15] COND FALSE !(!(cond)) VAL [counter=30] [L15] COND FALSE !(!(cond)) VAL [counter=30] [L15] COND FALSE !(!(cond)) VAL [counter=30] [L15] COND FALSE !(!(cond)) VAL [counter=30] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=30] [L33] EXPR counter++ VAL [counter=31] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=31] [L15] COND FALSE !(!(cond)) VAL [counter=31] [L15] COND FALSE !(!(cond)) VAL [counter=31] [L15] COND FALSE !(!(cond)) VAL [counter=31] [L15] COND FALSE !(!(cond)) VAL [counter=31] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=31] [L33] EXPR counter++ VAL [counter=32] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=32] [L15] COND FALSE !(!(cond)) VAL [counter=32] [L15] COND FALSE !(!(cond)) VAL [counter=32] [L15] COND FALSE !(!(cond)) VAL [counter=32] [L15] COND FALSE !(!(cond)) VAL [counter=32] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=32] [L33] EXPR counter++ VAL [counter=33] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=33] [L15] COND FALSE !(!(cond)) VAL [counter=33] [L15] COND FALSE !(!(cond)) VAL [counter=33] [L15] COND FALSE !(!(cond)) VAL [counter=33] [L15] COND FALSE !(!(cond)) VAL [counter=33] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=33] [L33] EXPR counter++ VAL [counter=34] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=34] [L15] COND FALSE !(!(cond)) VAL [counter=34] [L15] COND FALSE !(!(cond)) VAL [counter=34] [L15] COND FALSE !(!(cond)) VAL [counter=34] [L15] COND FALSE !(!(cond)) VAL [counter=34] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=34] [L33] EXPR counter++ VAL [counter=35] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=35] [L15] COND FALSE !(!(cond)) VAL [counter=35] [L15] COND FALSE !(!(cond)) VAL [counter=35] [L15] COND FALSE !(!(cond)) VAL [counter=35] [L15] COND FALSE !(!(cond)) VAL [counter=35] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=35] [L33] EXPR counter++ VAL [counter=36] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=36] [L15] COND FALSE !(!(cond)) VAL [counter=36] [L15] COND FALSE !(!(cond)) VAL [counter=36] [L15] COND FALSE !(!(cond)) VAL [counter=36] [L15] COND FALSE !(!(cond)) VAL [counter=36] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=36] [L33] EXPR counter++ VAL [counter=37] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=37] [L15] COND FALSE !(!(cond)) VAL [counter=37] [L15] COND FALSE !(!(cond)) VAL [counter=37] [L15] COND FALSE !(!(cond)) VAL [counter=37] [L15] COND FALSE !(!(cond)) VAL [counter=37] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=37] [L33] EXPR counter++ VAL [counter=38] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=38] [L15] COND FALSE !(!(cond)) VAL [counter=38] [L15] COND FALSE !(!(cond)) VAL [counter=38] [L15] COND FALSE !(!(cond)) VAL [counter=38] [L15] COND FALSE !(!(cond)) VAL [counter=38] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=38] [L33] EXPR counter++ VAL [counter=39] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=39] [L15] COND FALSE !(!(cond)) VAL [counter=39] [L15] COND FALSE !(!(cond)) VAL [counter=39] [L15] COND FALSE !(!(cond)) VAL [counter=39] [L15] COND FALSE !(!(cond)) VAL [counter=39] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=39] [L33] EXPR counter++ VAL [counter=40] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=40] [L15] COND FALSE !(!(cond)) VAL [counter=40] [L15] COND FALSE !(!(cond)) VAL [counter=40] [L15] COND FALSE !(!(cond)) VAL [counter=40] [L15] COND FALSE !(!(cond)) VAL [counter=40] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=40] [L33] EXPR counter++ VAL [counter=41] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=41] [L15] COND FALSE !(!(cond)) VAL [counter=41] [L15] COND FALSE !(!(cond)) VAL [counter=41] [L15] COND FALSE !(!(cond)) VAL [counter=41] [L15] COND FALSE !(!(cond)) VAL [counter=41] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=41] [L33] EXPR counter++ VAL [counter=42] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=42] [L15] COND FALSE !(!(cond)) VAL [counter=42] [L15] COND FALSE !(!(cond)) VAL [counter=42] [L15] COND FALSE !(!(cond)) VAL [counter=42] [L15] COND FALSE !(!(cond)) VAL [counter=42] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=42] [L33] EXPR counter++ VAL [counter=43] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=43] [L15] COND FALSE !(!(cond)) VAL [counter=43] [L15] COND FALSE !(!(cond)) VAL [counter=43] [L15] COND FALSE !(!(cond)) VAL [counter=43] [L15] COND FALSE !(!(cond)) VAL [counter=43] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=43] [L33] EXPR counter++ VAL [counter=44] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=44] [L15] COND FALSE !(!(cond)) VAL [counter=44] [L15] COND FALSE !(!(cond)) VAL [counter=44] [L15] COND FALSE !(!(cond)) VAL [counter=44] [L15] COND FALSE !(!(cond)) VAL [counter=44] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=44] [L33] EXPR counter++ VAL [counter=45] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=45] [L15] COND FALSE !(!(cond)) VAL [counter=45] [L15] COND FALSE !(!(cond)) VAL [counter=45] [L15] COND FALSE !(!(cond)) VAL [counter=45] [L15] COND FALSE !(!(cond)) VAL [counter=45] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=45] [L33] EXPR counter++ VAL [counter=46] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=46] [L15] COND FALSE !(!(cond)) VAL [counter=46] [L15] COND FALSE !(!(cond)) VAL [counter=46] [L15] COND FALSE !(!(cond)) VAL [counter=46] [L15] COND FALSE !(!(cond)) VAL [counter=46] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=46] [L33] EXPR counter++ VAL [counter=47] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=47] [L15] COND FALSE !(!(cond)) VAL [counter=47] [L15] COND FALSE !(!(cond)) VAL [counter=47] [L15] COND FALSE !(!(cond)) VAL [counter=47] [L15] COND FALSE !(!(cond)) VAL [counter=47] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=47] [L33] EXPR counter++ VAL [counter=48] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=48] [L15] COND FALSE !(!(cond)) VAL [counter=48] [L15] COND FALSE !(!(cond)) VAL [counter=48] [L15] COND FALSE !(!(cond)) VAL [counter=48] [L15] COND FALSE !(!(cond)) VAL [counter=48] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=48] [L33] EXPR counter++ VAL [counter=49] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=49] [L15] COND FALSE !(!(cond)) VAL [counter=49] [L15] COND FALSE !(!(cond)) VAL [counter=49] [L15] COND FALSE !(!(cond)) VAL [counter=49] [L15] COND FALSE !(!(cond)) VAL [counter=49] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=49] [L33] EXPR counter++ VAL [counter=50] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=50] [L15] COND FALSE !(!(cond)) VAL [counter=50] [L15] COND FALSE !(!(cond)) VAL [counter=50] [L15] COND FALSE !(!(cond)) VAL [counter=50] [L15] COND FALSE !(!(cond)) VAL [counter=50] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=50] [L33] EXPR counter++ VAL [counter=51] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=51] [L15] COND FALSE !(!(cond)) VAL [counter=51] [L15] COND FALSE !(!(cond)) VAL [counter=51] [L15] COND FALSE !(!(cond)) VAL [counter=51] [L15] COND FALSE !(!(cond)) VAL [counter=51] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=51] [L33] EXPR counter++ VAL [counter=52] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=52] [L15] COND FALSE !(!(cond)) VAL [counter=52] [L15] COND FALSE !(!(cond)) VAL [counter=52] [L15] COND FALSE !(!(cond)) VAL [counter=52] [L15] COND FALSE !(!(cond)) VAL [counter=52] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=52] [L33] EXPR counter++ VAL [counter=53] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=53] [L15] COND FALSE !(!(cond)) VAL [counter=53] [L15] COND FALSE !(!(cond)) VAL [counter=53] [L15] COND FALSE !(!(cond)) VAL [counter=53] [L15] COND FALSE !(!(cond)) VAL [counter=53] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=53] [L33] EXPR counter++ VAL [counter=54] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=54] [L15] COND FALSE !(!(cond)) VAL [counter=54] [L15] COND FALSE !(!(cond)) VAL [counter=54] [L15] COND FALSE !(!(cond)) VAL [counter=54] [L15] COND FALSE !(!(cond)) VAL [counter=54] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=54] [L33] EXPR counter++ VAL [counter=55] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=55] [L15] COND FALSE !(!(cond)) VAL [counter=55] [L15] COND FALSE !(!(cond)) VAL [counter=55] [L15] COND FALSE !(!(cond)) VAL [counter=55] [L15] COND FALSE !(!(cond)) VAL [counter=55] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=55] [L33] EXPR counter++ VAL [counter=56] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=56] [L15] COND FALSE !(!(cond)) VAL [counter=56] [L15] COND FALSE !(!(cond)) VAL [counter=56] [L15] COND FALSE !(!(cond)) VAL [counter=56] [L15] COND FALSE !(!(cond)) VAL [counter=56] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=56] [L33] EXPR counter++ VAL [counter=57] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=57] [L15] COND FALSE !(!(cond)) VAL [counter=57] [L15] COND FALSE !(!(cond)) VAL [counter=57] [L15] COND FALSE !(!(cond)) VAL [counter=57] [L15] COND FALSE !(!(cond)) VAL [counter=57] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=57] [L33] EXPR counter++ VAL [counter=58] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=58] [L15] COND FALSE !(!(cond)) VAL [counter=58] [L15] COND FALSE !(!(cond)) VAL [counter=58] [L15] COND FALSE !(!(cond)) VAL [counter=58] [L15] COND FALSE !(!(cond)) VAL [counter=58] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=58] [L33] EXPR counter++ VAL [counter=59] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=59] [L15] COND FALSE !(!(cond)) VAL [counter=59] [L15] COND FALSE !(!(cond)) VAL [counter=59] [L15] COND FALSE !(!(cond)) VAL [counter=59] [L15] COND FALSE !(!(cond)) VAL [counter=59] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=59] [L33] EXPR counter++ VAL [counter=60] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=60] [L15] COND FALSE !(!(cond)) VAL [counter=60] [L15] COND FALSE !(!(cond)) VAL [counter=60] [L15] COND FALSE !(!(cond)) VAL [counter=60] [L15] COND FALSE !(!(cond)) VAL [counter=60] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=60] [L33] EXPR counter++ VAL [counter=61] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=61] [L15] COND FALSE !(!(cond)) VAL [counter=61] [L15] COND FALSE !(!(cond)) VAL [counter=61] [L15] COND FALSE !(!(cond)) VAL [counter=61] [L15] COND FALSE !(!(cond)) VAL [counter=61] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=61] [L33] EXPR counter++ VAL [counter=62] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=62] [L15] COND FALSE !(!(cond)) VAL [counter=62] [L15] COND FALSE !(!(cond)) VAL [counter=62] [L15] COND FALSE !(!(cond)) VAL [counter=62] [L15] COND FALSE !(!(cond)) VAL [counter=62] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=62] [L33] EXPR counter++ VAL [counter=63] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=63] [L15] COND FALSE !(!(cond)) VAL [counter=63] [L15] COND FALSE !(!(cond)) VAL [counter=63] [L15] COND FALSE !(!(cond)) VAL [counter=63] [L15] COND FALSE !(!(cond)) VAL [counter=63] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=63] [L33] EXPR counter++ VAL [counter=64] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=64] [L15] COND FALSE !(!(cond)) VAL [counter=64] [L15] COND FALSE !(!(cond)) VAL [counter=64] [L15] COND FALSE !(!(cond)) VAL [counter=64] [L15] COND FALSE !(!(cond)) VAL [counter=64] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=64] [L33] EXPR counter++ VAL [counter=65] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=65] [L15] COND FALSE !(!(cond)) VAL [counter=65] [L15] COND FALSE !(!(cond)) VAL [counter=65] [L15] COND FALSE !(!(cond)) VAL [counter=65] [L15] COND FALSE !(!(cond)) VAL [counter=65] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=65] [L33] EXPR counter++ VAL [counter=66] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=66] [L15] COND FALSE !(!(cond)) VAL [counter=66] [L15] COND FALSE !(!(cond)) VAL [counter=66] [L15] COND FALSE !(!(cond)) VAL [counter=66] [L15] COND FALSE !(!(cond)) VAL [counter=66] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=66] [L33] EXPR counter++ VAL [counter=67] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=67] [L15] COND FALSE !(!(cond)) VAL [counter=67] [L15] COND FALSE !(!(cond)) VAL [counter=67] [L15] COND FALSE !(!(cond)) VAL [counter=67] [L15] COND FALSE !(!(cond)) VAL [counter=67] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=67] [L33] EXPR counter++ VAL [counter=68] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=68] [L15] COND FALSE !(!(cond)) VAL [counter=68] [L15] COND FALSE !(!(cond)) VAL [counter=68] [L15] COND FALSE !(!(cond)) VAL [counter=68] [L15] COND FALSE !(!(cond)) VAL [counter=68] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=68] [L33] EXPR counter++ VAL [counter=69] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=69] [L15] COND FALSE !(!(cond)) VAL [counter=69] [L15] COND FALSE !(!(cond)) VAL [counter=69] [L15] COND FALSE !(!(cond)) VAL [counter=69] [L15] COND FALSE !(!(cond)) VAL [counter=69] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=69] [L33] EXPR counter++ VAL [counter=70] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=70] [L15] COND FALSE !(!(cond)) VAL [counter=70] [L15] COND FALSE !(!(cond)) VAL [counter=70] [L15] COND FALSE !(!(cond)) VAL [counter=70] [L15] COND FALSE !(!(cond)) VAL [counter=70] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=70] [L33] EXPR counter++ VAL [counter=71] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=71] [L15] COND FALSE !(!(cond)) VAL [counter=71] [L15] COND FALSE !(!(cond)) VAL [counter=71] [L15] COND FALSE !(!(cond)) VAL [counter=71] [L15] COND FALSE !(!(cond)) VAL [counter=71] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=71] [L33] EXPR counter++ VAL [counter=72] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=72] [L15] COND FALSE !(!(cond)) VAL [counter=72] [L15] COND FALSE !(!(cond)) VAL [counter=72] [L15] COND FALSE !(!(cond)) VAL [counter=72] [L15] COND FALSE !(!(cond)) VAL [counter=72] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=72] [L33] EXPR counter++ VAL [counter=73] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=73] [L15] COND FALSE !(!(cond)) VAL [counter=73] [L15] COND FALSE !(!(cond)) VAL [counter=73] [L15] COND FALSE !(!(cond)) VAL [counter=73] [L15] COND FALSE !(!(cond)) VAL [counter=73] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=73] [L33] EXPR counter++ VAL [counter=74] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=74] [L15] COND FALSE !(!(cond)) VAL [counter=74] [L15] COND FALSE !(!(cond)) VAL [counter=74] [L15] COND FALSE !(!(cond)) VAL [counter=74] [L15] COND FALSE !(!(cond)) VAL [counter=74] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=74] [L33] EXPR counter++ VAL [counter=75] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=75] [L15] COND FALSE !(!(cond)) VAL [counter=75] [L15] COND FALSE !(!(cond)) VAL [counter=75] [L15] COND FALSE !(!(cond)) VAL [counter=75] [L15] COND FALSE !(!(cond)) VAL [counter=75] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=75] [L33] EXPR counter++ VAL [counter=76] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=76] [L15] COND FALSE !(!(cond)) VAL [counter=76] [L15] COND FALSE !(!(cond)) VAL [counter=76] [L15] COND FALSE !(!(cond)) VAL [counter=76] [L15] COND FALSE !(!(cond)) VAL [counter=76] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=76] [L33] EXPR counter++ VAL [counter=77] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=77] [L15] COND FALSE !(!(cond)) VAL [counter=77] [L15] COND FALSE !(!(cond)) VAL [counter=77] [L15] COND FALSE !(!(cond)) VAL [counter=77] [L15] COND FALSE !(!(cond)) VAL [counter=77] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=77] [L33] EXPR counter++ VAL [counter=78] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=78] [L15] COND FALSE !(!(cond)) VAL [counter=78] [L15] COND FALSE !(!(cond)) VAL [counter=78] [L15] COND FALSE !(!(cond)) VAL [counter=78] [L15] COND FALSE !(!(cond)) VAL [counter=78] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=78] [L33] EXPR counter++ VAL [counter=79] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=79] [L15] COND FALSE !(!(cond)) VAL [counter=79] [L15] COND FALSE !(!(cond)) VAL [counter=79] [L15] COND FALSE !(!(cond)) VAL [counter=79] [L15] COND FALSE !(!(cond)) VAL [counter=79] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=79] [L33] EXPR counter++ VAL [counter=80] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=80] [L15] COND FALSE !(!(cond)) VAL [counter=80] [L15] COND FALSE !(!(cond)) VAL [counter=80] [L15] COND FALSE !(!(cond)) VAL [counter=80] [L15] COND FALSE !(!(cond)) VAL [counter=80] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=80] [L33] EXPR counter++ VAL [counter=81] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=81] [L15] COND FALSE !(!(cond)) VAL [counter=81] [L15] COND FALSE !(!(cond)) VAL [counter=81] [L15] COND FALSE !(!(cond)) VAL [counter=81] [L15] COND FALSE !(!(cond)) VAL [counter=81] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=81] [L33] EXPR counter++ VAL [counter=82] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=82] [L15] COND FALSE !(!(cond)) VAL [counter=82] [L15] COND FALSE !(!(cond)) VAL [counter=82] [L15] COND FALSE !(!(cond)) VAL [counter=82] [L15] COND FALSE !(!(cond)) VAL [counter=82] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=82] [L33] EXPR counter++ VAL [counter=83] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=83] [L15] COND FALSE !(!(cond)) VAL [counter=83] [L15] COND FALSE !(!(cond)) VAL [counter=83] [L15] COND FALSE !(!(cond)) VAL [counter=83] [L15] COND FALSE !(!(cond)) VAL [counter=83] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=83] [L33] EXPR counter++ VAL [counter=84] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=84] [L15] COND FALSE !(!(cond)) VAL [counter=84] [L15] COND FALSE !(!(cond)) VAL [counter=84] [L15] COND FALSE !(!(cond)) VAL [counter=84] [L15] COND FALSE !(!(cond)) VAL [counter=84] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=84] [L33] EXPR counter++ VAL [counter=85] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=85] [L15] COND FALSE !(!(cond)) VAL [counter=85] [L15] COND FALSE !(!(cond)) VAL [counter=85] [L15] COND FALSE !(!(cond)) VAL [counter=85] [L15] COND FALSE !(!(cond)) VAL [counter=85] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=85] [L33] EXPR counter++ VAL [counter=86] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=86] [L15] COND FALSE !(!(cond)) VAL [counter=86] [L15] COND FALSE !(!(cond)) VAL [counter=86] [L15] COND FALSE !(!(cond)) VAL [counter=86] [L15] COND FALSE !(!(cond)) VAL [counter=86] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=86] [L33] EXPR counter++ VAL [counter=87] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=87] [L15] COND FALSE !(!(cond)) VAL [counter=87] [L15] COND FALSE !(!(cond)) VAL [counter=87] [L15] COND FALSE !(!(cond)) VAL [counter=87] [L15] COND FALSE !(!(cond)) VAL [counter=87] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=87] [L33] EXPR counter++ VAL [counter=88] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=88] [L15] COND FALSE !(!(cond)) VAL [counter=88] [L15] COND FALSE !(!(cond)) VAL [counter=88] [L15] COND FALSE !(!(cond)) VAL [counter=88] [L15] COND FALSE !(!(cond)) VAL [counter=88] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=88] [L33] EXPR counter++ VAL [counter=89] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=89] [L15] COND FALSE !(!(cond)) VAL [counter=89] [L15] COND FALSE !(!(cond)) VAL [counter=89] [L15] COND FALSE !(!(cond)) VAL [counter=89] [L15] COND FALSE !(!(cond)) VAL [counter=89] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=89] [L33] EXPR counter++ VAL [counter=90] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=90] [L15] COND FALSE !(!(cond)) VAL [counter=90] [L15] COND FALSE !(!(cond)) VAL [counter=90] [L15] COND FALSE !(!(cond)) VAL [counter=90] [L15] COND FALSE !(!(cond)) VAL [counter=90] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=90] [L33] EXPR counter++ VAL [counter=91] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=91] [L15] COND FALSE !(!(cond)) VAL [counter=91] [L15] COND FALSE !(!(cond)) VAL [counter=91] [L15] COND FALSE !(!(cond)) VAL [counter=91] [L15] COND FALSE !(!(cond)) VAL [counter=91] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=91] [L33] EXPR counter++ VAL [counter=92] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=92] [L15] COND FALSE !(!(cond)) VAL [counter=92] [L15] COND FALSE !(!(cond)) VAL [counter=92] [L15] COND FALSE !(!(cond)) VAL [counter=92] [L15] COND FALSE !(!(cond)) VAL [counter=92] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=92] [L33] EXPR counter++ VAL [counter=93] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=93] [L15] COND FALSE !(!(cond)) VAL [counter=93] [L15] COND FALSE !(!(cond)) VAL [counter=93] [L15] COND FALSE !(!(cond)) VAL [counter=93] [L15] COND FALSE !(!(cond)) VAL [counter=93] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=93] [L33] EXPR counter++ VAL [counter=94] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=94] [L15] COND FALSE !(!(cond)) VAL [counter=94] [L15] COND FALSE !(!(cond)) VAL [counter=94] [L15] COND FALSE !(!(cond)) VAL [counter=94] [L15] COND FALSE !(!(cond)) VAL [counter=94] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=94] [L33] EXPR counter++ VAL [counter=95] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=95] [L15] COND FALSE !(!(cond)) VAL [counter=95] [L15] COND FALSE !(!(cond)) VAL [counter=95] [L15] COND FALSE !(!(cond)) VAL [counter=95] [L15] COND FALSE !(!(cond)) VAL [counter=95] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=95] [L33] EXPR counter++ VAL [counter=96] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=96] [L15] COND FALSE !(!(cond)) VAL [counter=96] [L15] COND FALSE !(!(cond)) VAL [counter=96] [L15] COND FALSE !(!(cond)) VAL [counter=96] [L15] COND FALSE !(!(cond)) VAL [counter=96] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=96] [L33] EXPR counter++ VAL [counter=97] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=97] [L15] COND FALSE !(!(cond)) VAL [counter=97] [L15] COND FALSE !(!(cond)) VAL [counter=97] [L15] COND FALSE !(!(cond)) VAL [counter=97] [L15] COND FALSE !(!(cond)) VAL [counter=97] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=97] [L33] EXPR counter++ VAL [counter=98] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=98] [L15] COND FALSE !(!(cond)) VAL [counter=98] [L15] COND FALSE !(!(cond)) VAL [counter=98] [L15] COND FALSE !(!(cond)) VAL [counter=98] [L15] COND FALSE !(!(cond)) VAL [counter=98] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=98] [L33] EXPR counter++ VAL [counter=99] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=99] [L15] COND FALSE !(!(cond)) VAL [counter=99] [L15] COND FALSE !(!(cond)) VAL [counter=99] [L15] COND FALSE !(!(cond)) VAL [counter=99] [L15] COND FALSE !(!(cond)) VAL [counter=99] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=99] [L33] EXPR counter++ VAL [counter=100] [L33] COND TRUE counter++<100 [L15] COND FALSE !(!(cond)) VAL [counter=100] [L15] COND FALSE !(!(cond)) VAL [counter=100] [L15] COND FALSE !(!(cond)) VAL [counter=100] [L15] COND FALSE !(!(cond)) VAL [counter=100] [L15] COND FALSE !(!(cond)) VAL [counter=100] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [counter=100] [L33] EXPR counter++ VAL [counter=101] [L33] COND FALSE !(counter++<100) [L15] COND FALSE !(!(cond)) VAL [counter=101] [L15] COND TRUE !(cond) VAL [counter=101] [L17] reach_error() VAL [counter=101] - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 254799.77ms, OverallIterations: 21, TraceHistogramMax: 101, EmptinessCheckTime: 63.16ms, AutomataDifference: 93517.39ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 7.33ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 18 mSolverCounterUnknown, 1718 SdHoareTripleChecker+Valid, 68740.41ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1718 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 67738.10ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 174 IncrementalHoareTripleChecker+Unchecked, 4274 mSDsCounter, 456 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6530 IncrementalHoareTripleChecker+Invalid, 7178 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 456 mSolverCounterUnsat, 0 mSDtfsCounter, 6530 mSolverCounterSat, 40.48ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5280 GetRequests, 4567 SyntacticMatches, 13 SemanticMatches, 700 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12510 ImplicationChecksByTransitivity, 60580.44ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1214occurred in iteration=20, InterpolantAutomatonStates: 669, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 524.52ms AutomataMinimizationTime, 20 MinimizatonAttempts, 273 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 324.16ms SsaConstructionTime, 99253.78ms SatisfiabilityAnalysisTime, 54435.25ms InterpolantComputationTime, 3751 NumberOfCodeBlocks, 3691 NumberOfCodeBlocksAsserted, 176 NumberOfCheckSat, 4960 ConstructedInterpolants, 48 QuantifiedInterpolants, 23354 SizeOfPredicates, 262 NumberOfNonLiveVariables, 8608 ConjunctsInSsa, 613 ConjunctsInUnsatCore, 34 InterpolantComputations, 7 PerfectInterpolantSequences, 274/137710 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! [2021-08-29 12:06:51,339 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...