./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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/cohendiv-ll_valuebound20.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 25ba378b5b8d10591d32c757e848cf2bb28769a9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 05:13:00,573 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 05:13:00,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 05:13:00,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 05:13:00,612 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 05:13:00,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 05:13:00,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 05:13:00,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 05:13:00,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 05:13:00,632 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 05:13:00,633 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 05:13:00,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 05:13:00,637 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 05:13:00,639 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 05:13:00,640 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 05:13:00,643 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 05:13:00,644 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 05:13:00,645 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 05:13:00,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 05:13:00,652 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 05:13:00,653 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 05:13:00,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 05:13:00,656 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 05:13:00,656 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 05:13:00,662 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 05:13:00,662 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 05:13:00,663 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 05:13:00,664 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 05:13:00,664 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 05:13:00,665 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 05:13:00,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 05:13:00,667 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 05:13:00,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 05:13:00,669 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 05:13:00,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 05:13:00,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 05:13:00,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 05:13:00,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 05:13:00,672 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 05:13:00,673 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 05:13:00,674 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 05:13:00,675 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 05:13:00,709 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 05:13:00,710 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 05:13:00,711 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 05:13:00,711 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 05:13:00,712 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 05:13:00,713 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 05:13:00,713 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 05:13:00,713 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 05:13:00,713 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 05:13:00,714 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 05:13:00,714 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 05:13:00,714 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 05:13:00,715 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 05:13:00,715 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 05:13:00,715 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 05:13:00,715 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 05:13:00,715 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 05:13:00,716 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 05:13:00,716 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 05:13:00,716 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 05:13:00,716 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 05:13:00,716 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 05:13:00,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 05:13:00,717 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 05:13:00,717 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 05:13:00,717 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 05:13:00,717 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 05:13:00,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 05:13:00,718 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 05:13:00,718 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 05:13:00,718 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 -> 25ba378b5b8d10591d32c757e848cf2bb28769a9 [2021-08-26 05:13:01,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 05:13:01,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 05:13:01,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 05:13:01,047 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 05:13:01,048 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 05:13:01,049 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound20.c [2021-08-26 05:13:01,098 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b5971b91/a36caf6e6b754aaaa093d6f5b039fe9b/FLAGec76f9baf [2021-08-26 05:13:01,526 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 05:13:01,526 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound20.c [2021-08-26 05:13:01,532 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b5971b91/a36caf6e6b754aaaa093d6f5b039fe9b/FLAGec76f9baf [2021-08-26 05:13:01,929 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b5971b91/a36caf6e6b754aaaa093d6f5b039fe9b [2021-08-26 05:13:01,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 05:13:01,932 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 05:13:01,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 05:13:01,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 05:13:01,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 05:13:01,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 05:13:01" (1/1) ... [2021-08-26 05:13:01,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@366d3600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:13:01, skipping insertion in model container [2021-08-26 05:13:01,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 05:13:01" (1/1) ... [2021-08-26 05:13:01,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 05:13:01,958 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 05:13:02,050 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/cohendiv-ll_valuebound20.c[576,589] [2021-08-26 05:13:02,063 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 05:13:02,069 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 05:13:02,077 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/cohendiv-ll_valuebound20.c[576,589] [2021-08-26 05:13:02,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 05:13:02,097 INFO L208 MainTranslator]: Completed translation [2021-08-26 05:13:02,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:13:02 WrapperNode [2021-08-26 05:13:02,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 05:13:02,099 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 05:13:02,099 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 05:13:02,099 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 05:13:02,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:13:02" (1/1) ... [2021-08-26 05:13:02,126 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:13:02" (1/1) ... [2021-08-26 05:13:02,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 05:13:02,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 05:13:02,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 05:13:02,146 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 05:13:02,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:13:02" (1/1) ... [2021-08-26 05:13:02,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:13:02" (1/1) ... [2021-08-26 05:13:02,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:13:02" (1/1) ... [2021-08-26 05:13:02,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:13:02" (1/1) ... [2021-08-26 05:13:02,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:13:02" (1/1) ... [2021-08-26 05:13:02,161 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:13:02" (1/1) ... [2021-08-26 05:13:02,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:13:02" (1/1) ... [2021-08-26 05:13:02,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 05:13:02,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 05:13:02,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 05:13:02,164 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 05:13:02,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:13:02" (1/1) ... [2021-08-26 05:13:02,170 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 05:13:02,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:02,198 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-26 05:13:02,228 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-26 05:13:02,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 05:13:02,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 05:13:02,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 05:13:02,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 05:13:02,600 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 05:13:02,600 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2021-08-26 05:13:02,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 05:13:02 BoogieIcfgContainer [2021-08-26 05:13:02,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 05:13:02,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 05:13:02,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 05:13:02,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 05:13:02,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 05:13:01" (1/3) ... [2021-08-26 05:13:02,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba81e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 05:13:02, skipping insertion in model container [2021-08-26 05:13:02,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:13:02" (2/3) ... [2021-08-26 05:13:02,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba81e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 05:13:02, skipping insertion in model container [2021-08-26 05:13:02,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 05:13:02" (3/3) ... [2021-08-26 05:13:02,609 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_valuebound20.c [2021-08-26 05:13:02,613 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 05:13:02,613 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2021-08-26 05:13:02,660 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 05:13:02,668 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-26 05:13:02,668 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-08-26 05:13:02,681 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 42 states have internal predecessors, (58), 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-26 05:13:02,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 05:13:02,694 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:02,694 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:13:02,695 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:13:02,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:02,700 INFO L82 PathProgramCache]: Analyzing trace with hash 330581779, now seen corresponding path program 1 times [2021-08-26 05:13:02,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:02,708 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900197591] [2021-08-26 05:13:02,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:02,709 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:13:02,849 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-26 05:13:02,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:02,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900197591] [2021-08-26 05:13:02,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900197591] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:13:02,851 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:13:02,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 05:13:02,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429008225] [2021-08-26 05:13:02,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 05:13:02,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:02,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 05:13:02,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 05:13:02,872 INFO L87 Difference]: Start difference. First operand has 43 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 42 states have internal predecessors, (58), 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 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-26 05:13:02,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:02,895 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2021-08-26 05:13:02,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 05:13:02,897 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2021-08-26 05:13:02,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:02,902 INFO L225 Difference]: With dead ends: 83 [2021-08-26 05:13:02,903 INFO L226 Difference]: Without dead ends: 39 [2021-08-26 05:13:02,905 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 05:13:02,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-08-26 05:13:02,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-08-26 05:13:02,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.25) internal successors, (40), 38 states have internal predecessors, (40), 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-26 05:13:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2021-08-26 05:13:02,933 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 11 [2021-08-26 05:13:02,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:02,934 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2021-08-26 05:13:02,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-26 05:13:02,935 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2021-08-26 05:13:02,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 05:13:02,936 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:02,936 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:13:02,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 05:13:02,936 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:13:02,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:02,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1507472743, now seen corresponding path program 1 times [2021-08-26 05:13:02,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:02,939 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348402996] [2021-08-26 05:13:02,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:02,940 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:02,971 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:02,972 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1225307043] [2021-08-26 05:13:02,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:02,973 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:02,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:02,977 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-26 05:13:03,009 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-26 05:13:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:13:03,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-26 05:13:03,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:03,525 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-26 05:13:03,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:03,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348402996] [2021-08-26 05:13:03,526 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:03,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225307043] [2021-08-26 05:13:03,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225307043] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:13:03,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:13:03,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-26 05:13:03,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413116155] [2021-08-26 05:13:03,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 05:13:03,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:03,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 05:13:03,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-26 05:13:03,529 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 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-26 05:13:03,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:03,850 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2021-08-26 05:13:03,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 05:13:03,851 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 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 11 [2021-08-26 05:13:03,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:03,853 INFO L225 Difference]: With dead ends: 52 [2021-08-26 05:13:03,853 INFO L226 Difference]: Without dead ends: 50 [2021-08-26 05:13:03,855 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 315.0ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-08-26 05:13:03,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-08-26 05:13:03,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2021-08-26 05:13:03,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 40 states have internal predecessors, (42), 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-26 05:13:03,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2021-08-26 05:13:03,865 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 11 [2021-08-26 05:13:03,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:03,865 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2021-08-26 05:13:03,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 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-26 05:13:03,866 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2021-08-26 05:13:03,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-26 05:13:03,867 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:03,867 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:13:03,896 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-26 05:13:04,081 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-26 05:13:04,081 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:13:04,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:04,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1277171076, now seen corresponding path program 1 times [2021-08-26 05:13:04,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:04,082 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581022018] [2021-08-26 05:13:04,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:04,082 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:04,103 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:04,107 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [743619571] [2021-08-26 05:13:04,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:04,116 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:04,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:04,117 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-26 05:13:04,137 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-26 05:13:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:13:04,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-26 05:13:04,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:04,576 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-26 05:13:04,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:04,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581022018] [2021-08-26 05:13:04,577 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:04,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743619571] [2021-08-26 05:13:04,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743619571] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:13:04,578 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:13:04,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-26 05:13:04,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148336935] [2021-08-26 05:13:04,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 05:13:04,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:04,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 05:13:04,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-26 05:13:04,580 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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-26 05:13:04,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:04,812 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2021-08-26 05:13:04,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 05:13:04,812 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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 13 [2021-08-26 05:13:04,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:04,813 INFO L225 Difference]: With dead ends: 69 [2021-08-26 05:13:04,813 INFO L226 Difference]: Without dead ends: 61 [2021-08-26 05:13:04,813 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 203.1ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-08-26 05:13:04,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-08-26 05:13:04,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2021-08-26 05:13:04,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 52 states have internal predecessors, (58), 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-26 05:13:04,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2021-08-26 05:13:04,819 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2021-08-26 05:13:04,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:04,819 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2021-08-26 05:13:04,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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-26 05:13:04,819 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2021-08-26 05:13:04,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-26 05:13:04,820 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:04,820 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:13:04,852 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-26 05:13:05,020 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-26 05:13:05,021 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:13:05,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:05,022 INFO L82 PathProgramCache]: Analyzing trace with hash 916732292, now seen corresponding path program 1 times [2021-08-26 05:13:05,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:05,022 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892962504] [2021-08-26 05:13:05,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:05,022 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:05,033 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:05,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [264781568] [2021-08-26 05:13:05,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:05,034 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:05,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:05,050 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-26 05:13:05,051 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-26 05:13:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:13:05,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-26 05:13:05,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:05,208 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-26 05:13:05,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:05,209 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892962504] [2021-08-26 05:13:05,209 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:05,209 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264781568] [2021-08-26 05:13:05,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264781568] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:13:05,209 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:13:05,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 05:13:05,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861336253] [2021-08-26 05:13:05,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 05:13:05,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:05,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 05:13:05,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 05:13:05,212 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-26 05:13:05,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:05,302 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2021-08-26 05:13:05,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 05:13:05,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2021-08-26 05:13:05,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:05,307 INFO L225 Difference]: With dead ends: 95 [2021-08-26 05:13:05,307 INFO L226 Difference]: Without dead ends: 89 [2021-08-26 05:13:05,308 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 05:13:05,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-08-26 05:13:05,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 72. [2021-08-26 05:13:05,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 71 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-26 05:13:05,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2021-08-26 05:13:05,329 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 16 [2021-08-26 05:13:05,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:05,329 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2021-08-26 05:13:05,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-26 05:13:05,329 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2021-08-26 05:13:05,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-26 05:13:05,330 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:05,330 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:13:05,355 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-26 05:13:05,530 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-26 05:13:05,531 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:13:05,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:05,531 INFO L82 PathProgramCache]: Analyzing trace with hash 2015957290, now seen corresponding path program 1 times [2021-08-26 05:13:05,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:05,532 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150126969] [2021-08-26 05:13:05,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:05,532 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:05,548 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:05,557 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [399158276] [2021-08-26 05:13:05,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:05,558 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:05,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:05,559 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-26 05:13:05,566 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-26 05:13:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:13:05,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-26 05:13:05,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:05,795 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-26 05:13:05,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:05,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150126969] [2021-08-26 05:13:05,800 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:05,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399158276] [2021-08-26 05:13:05,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399158276] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:13:05,802 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:13:05,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 05:13:05,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111888989] [2021-08-26 05:13:05,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 05:13:05,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:05,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 05:13:05,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-26 05:13:05,808 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-26 05:13:05,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:05,940 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2021-08-26 05:13:05,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 05:13:05,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-26 05:13:05,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:05,943 INFO L225 Difference]: With dead ends: 72 [2021-08-26 05:13:05,943 INFO L226 Difference]: Without dead ends: 70 [2021-08-26 05:13:05,943 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 72.7ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-08-26 05:13:05,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-08-26 05:13:05,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-08-26 05:13:05,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 64 states have (on average 1.203125) internal successors, (77), 69 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-26 05:13:05,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2021-08-26 05:13:05,960 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 20 [2021-08-26 05:13:05,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:05,961 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2021-08-26 05:13:05,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-26 05:13:05,961 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2021-08-26 05:13:05,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-26 05:13:05,962 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:05,962 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:13:05,980 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-26 05:13:06,167 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-26 05:13:06,168 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:13:06,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:06,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1552659725, now seen corresponding path program 1 times [2021-08-26 05:13:06,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:06,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496204668] [2021-08-26 05:13:06,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:06,169 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:06,180 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:06,180 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1413799908] [2021-08-26 05:13:06,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:06,180 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:06,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:06,181 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-26 05:13:06,193 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-26 05:13:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:13:06,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-26 05:13:06,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:06,513 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-26 05:13:06,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:06,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496204668] [2021-08-26 05:13:06,513 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:06,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413799908] [2021-08-26 05:13:06,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413799908] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:13:06,514 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:13:06,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-08-26 05:13:06,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971725867] [2021-08-26 05:13:06,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 05:13:06,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:06,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 05:13:06,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-26 05:13:06,515 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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-26 05:13:06,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:06,749 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2021-08-26 05:13:06,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 05:13:06,749 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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 25 [2021-08-26 05:13:06,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:06,750 INFO L225 Difference]: With dead ends: 123 [2021-08-26 05:13:06,750 INFO L226 Difference]: Without dead ends: 117 [2021-08-26 05:13:06,751 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 138.0ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-08-26 05:13:06,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-08-26 05:13:06,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 88. [2021-08-26 05:13:06,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 87 states have internal predecessors, (98), 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-26 05:13:06,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2021-08-26 05:13:06,759 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 25 [2021-08-26 05:13:06,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:06,759 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2021-08-26 05:13:06,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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-26 05:13:06,759 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2021-08-26 05:13:06,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-26 05:13:06,760 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:06,760 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:13:06,785 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-26 05:13:06,982 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-26 05:13:06,983 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:13:06,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:06,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1755069467, now seen corresponding path program 1 times [2021-08-26 05:13:06,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:06,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812762044] [2021-08-26 05:13:06,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:06,984 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:06,993 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:06,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1515743098] [2021-08-26 05:13:06,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:06,993 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:06,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:06,998 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-26 05:13:06,998 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-26 05:13:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:13:07,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-26 05:13:07,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:07,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:13:07,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:07,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812762044] [2021-08-26 05:13:07,358 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:07,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515743098] [2021-08-26 05:13:07,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515743098] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:13:07,360 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:13:07,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2021-08-26 05:13:07,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622899732] [2021-08-26 05:13:07,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 05:13:07,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:07,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 05:13:07,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 05:13:07,361 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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-26 05:13:07,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:07,489 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2021-08-26 05:13:07,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 05:13:07,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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 26 [2021-08-26 05:13:07,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:07,491 INFO L225 Difference]: With dead ends: 140 [2021-08-26 05:13:07,491 INFO L226 Difference]: Without dead ends: 132 [2021-08-26 05:13:07,493 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 44.1ms TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-08-26 05:13:07,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-08-26 05:13:07,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 101. [2021-08-26 05:13:07,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 95 states have (on average 1.1789473684210525) internal successors, (112), 100 states have internal predecessors, (112), 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-26 05:13:07,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2021-08-26 05:13:07,508 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 26 [2021-08-26 05:13:07,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:07,511 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2021-08-26 05:13:07,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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-26 05:13:07,511 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2021-08-26 05:13:07,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-26 05:13:07,512 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:07,512 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:13:07,537 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-26 05:13:07,728 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-26 05:13:07,729 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:13:07,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:07,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1828677220, now seen corresponding path program 2 times [2021-08-26 05:13:07,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:07,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272789392] [2021-08-26 05:13:07,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:07,730 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:07,739 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:07,739 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1593461312] [2021-08-26 05:13:07,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 05:13:07,739 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:07,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:07,741 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-26 05:13:07,742 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-26 05:13:07,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 05:13:07,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:13:07,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-26 05:13:07,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:08,220 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:13:08,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:08,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272789392] [2021-08-26 05:13:08,221 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:08,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593461312] [2021-08-26 05:13:08,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593461312] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:13:08,221 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:13:08,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2021-08-26 05:13:08,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464151160] [2021-08-26 05:13:08,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 05:13:08,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:08,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 05:13:08,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-26 05:13:08,223 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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-26 05:13:08,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:08,572 INFO L93 Difference]: Finished difference Result 168 states and 181 transitions. [2021-08-26 05:13:08,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-26 05:13:08,572 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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-26 05:13:08,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:08,578 INFO L225 Difference]: With dead ends: 168 [2021-08-26 05:13:08,578 INFO L226 Difference]: Without dead ends: 162 [2021-08-26 05:13:08,578 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 202.9ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-08-26 05:13:08,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-08-26 05:13:08,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 119. [2021-08-26 05:13:08,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 113 states have (on average 1.176991150442478) internal successors, (133), 118 states have internal predecessors, (133), 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-26 05:13:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 133 transitions. [2021-08-26 05:13:08,594 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 133 transitions. Word has length 34 [2021-08-26 05:13:08,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:08,595 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 133 transitions. [2021-08-26 05:13:08,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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-26 05:13:08,595 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2021-08-26 05:13:08,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-26 05:13:08,596 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:08,596 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:13:08,619 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-26 05:13:08,819 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-26 05:13:08,819 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:13:08,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:08,820 INFO L82 PathProgramCache]: Analyzing trace with hash -797667638, now seen corresponding path program 1 times [2021-08-26 05:13:08,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:08,821 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559716958] [2021-08-26 05:13:08,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:08,821 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:08,830 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:08,831 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1346556844] [2021-08-26 05:13:08,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:08,831 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:08,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:08,832 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-26 05:13:08,865 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-26 05:13:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:13:09,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-26 05:13:09,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:13:09,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:09,420 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559716958] [2021-08-26 05:13:09,421 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:09,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346556844] [2021-08-26 05:13:09,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346556844] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:13:09,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:13:09,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-08-26 05:13:09,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954408069] [2021-08-26 05:13:09,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 05:13:09,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:09,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 05:13:09,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-26 05:13:09,423 INFO L87 Difference]: Start difference. First operand 119 states and 133 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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-26 05:13:09,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:09,630 INFO L93 Difference]: Finished difference Result 208 states and 232 transitions. [2021-08-26 05:13:09,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 05:13:09,631 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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 35 [2021-08-26 05:13:09,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:09,632 INFO L225 Difference]: With dead ends: 208 [2021-08-26 05:13:09,632 INFO L226 Difference]: Without dead ends: 200 [2021-08-26 05:13:09,632 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 66.7ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-08-26 05:13:09,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-08-26 05:13:09,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 128. [2021-08-26 05:13:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 122 states have (on average 1.1721311475409837) internal successors, (143), 127 states have internal predecessors, (143), 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-26 05:13:09,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 143 transitions. [2021-08-26 05:13:09,641 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 143 transitions. Word has length 35 [2021-08-26 05:13:09,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:09,642 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 143 transitions. [2021-08-26 05:13:09,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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-26 05:13:09,642 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 143 transitions. [2021-08-26 05:13:09,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-26 05:13:09,643 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:09,643 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:13:09,671 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-26 05:13:09,867 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-26 05:13:09,867 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:13:09,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:09,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1158953764, now seen corresponding path program 2 times [2021-08-26 05:13:09,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:09,868 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084845272] [2021-08-26 05:13:09,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:09,868 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:09,885 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:09,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [775906351] [2021-08-26 05:13:09,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 05:13:09,885 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:09,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:09,891 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-26 05:13:09,891 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-26 05:13:10,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 05:13:10,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:13:10,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-26 05:13:10,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:10,241 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:13:10,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:10,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084845272] [2021-08-26 05:13:10,242 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:10,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775906351] [2021-08-26 05:13:10,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775906351] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:13:10,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:13:10,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 05:13:10,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983536450] [2021-08-26 05:13:10,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 05:13:10,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:10,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 05:13:10,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-26 05:13:10,244 INFO L87 Difference]: Start difference. First operand 128 states and 143 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-26 05:13:10,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:10,305 INFO L93 Difference]: Finished difference Result 241 states and 268 transitions. [2021-08-26 05:13:10,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 05:13:10,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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 39 [2021-08-26 05:13:10,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:10,307 INFO L225 Difference]: With dead ends: 241 [2021-08-26 05:13:10,307 INFO L226 Difference]: Without dead ends: 142 [2021-08-26 05:13:10,307 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 16.3ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-26 05:13:10,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-08-26 05:13:10,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2021-08-26 05:13:10,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 128 states have (on average 1.1640625) internal successors, (149), 133 states have internal predecessors, (149), 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-26 05:13:10,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 149 transitions. [2021-08-26 05:13:10,315 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 149 transitions. Word has length 39 [2021-08-26 05:13:10,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:10,316 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 149 transitions. [2021-08-26 05:13:10,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-26 05:13:10,316 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 149 transitions. [2021-08-26 05:13:10,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-08-26 05:13:10,317 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:10,317 INFO L512 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:13:10,337 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-26 05:13:10,524 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-26 05:13:10,525 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:13:10,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:10,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1020421613, now seen corresponding path program 3 times [2021-08-26 05:13:10,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:10,526 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079667120] [2021-08-26 05:13:10,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:10,526 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:10,543 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:10,543 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2140334040] [2021-08-26 05:13:10,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 05:13:10,544 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:10,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:10,545 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-26 05:13:10,557 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-26 05:13:10,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-08-26 05:13:10,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:13:10,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-26 05:13:10,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:10,986 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-26 05:13:10,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:10,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079667120] [2021-08-26 05:13:10,986 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:10,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140334040] [2021-08-26 05:13:10,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140334040] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:13:10,987 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:13:10,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2021-08-26 05:13:10,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860069835] [2021-08-26 05:13:10,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 05:13:10,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:10,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 05:13:10,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 05:13:10,988 INFO L87 Difference]: Start difference. First operand 134 states and 149 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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-26 05:13:22,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:22,717 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2021-08-26 05:13:22,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 05:13:22,718 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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-26 05:13:22,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:22,719 INFO L225 Difference]: With dead ends: 142 [2021-08-26 05:13:22,719 INFO L226 Difference]: Without dead ends: 136 [2021-08-26 05:13:22,719 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 6782.3ms TimeCoverageRelationStatistics Valid=21, Invalid=34, Unknown=1, NotChecked=0, Total=56 [2021-08-26 05:13:22,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-08-26 05:13:22,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 87. [2021-08-26 05:13:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 84 states have (on average 1.119047619047619) internal successors, (94), 86 states have internal predecessors, (94), 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-26 05:13:22,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2021-08-26 05:13:22,729 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 43 [2021-08-26 05:13:22,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:22,729 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2021-08-26 05:13:22,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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-26 05:13:22,729 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2021-08-26 05:13:22,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-26 05:13:22,730 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:22,730 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:13:22,766 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-26 05:13:22,931 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-26 05:13:22,931 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:13:22,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:22,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1074581755, now seen corresponding path program 2 times [2021-08-26 05:13:22,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:22,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835515717] [2021-08-26 05:13:22,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:22,932 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:22,938 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:22,938 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2036521186] [2021-08-26 05:13:22,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 05:13:22,938 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:22,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:22,939 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-26 05:13:22,940 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-26 05:13:23,219 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 05:13:23,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:13:23,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 28 conjunts are in the unsatisfiable core [2021-08-26 05:13:23,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:23,912 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:13:23,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:23,913 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835515717] [2021-08-26 05:13:23,913 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:23,913 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036521186] [2021-08-26 05:13:23,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036521186] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:13:23,913 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:13:23,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2021-08-26 05:13:23,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304251934] [2021-08-26 05:13:23,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 05:13:23,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:23,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 05:13:23,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-26 05:13:23,915 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 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-26 05:13:24,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:24,387 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2021-08-26 05:13:24,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-26 05:13:24,387 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 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 44 [2021-08-26 05:13:24,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:24,389 INFO L225 Difference]: With dead ends: 141 [2021-08-26 05:13:24,389 INFO L226 Difference]: Without dead ends: 133 [2021-08-26 05:13:24,389 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 336.1ms TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2021-08-26 05:13:24,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-08-26 05:13:24,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 96. [2021-08-26 05:13:24,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 93 states have (on average 1.118279569892473) internal successors, (104), 95 states have internal predecessors, (104), 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-26 05:13:24,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2021-08-26 05:13:24,399 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 44 [2021-08-26 05:13:24,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:24,400 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2021-08-26 05:13:24,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 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-26 05:13:24,400 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2021-08-26 05:13:24,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-26 05:13:24,401 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:24,401 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:13:24,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-08-26 05:13:24,616 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-26 05:13:24,617 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:13:24,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:24,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1128629901, now seen corresponding path program 3 times [2021-08-26 05:13:24,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:24,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089715608] [2021-08-26 05:13:24,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:24,618 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:24,625 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:24,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1465442218] [2021-08-26 05:13:24,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 05:13:24,626 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:24,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:24,632 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-26 05:13:24,637 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-26 05:13:24,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-08-26 05:13:24,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:13:24,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-26 05:13:24,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:25,176 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-08-26 05:13:25,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:25,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089715608] [2021-08-26 05:13:25,176 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:25,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465442218] [2021-08-26 05:13:25,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465442218] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:13:25,176 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:13:25,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-26 05:13:25,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504783140] [2021-08-26 05:13:25,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 05:13:25,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:25,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 05:13:25,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-08-26 05:13:25,178 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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-26 05:13:25,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:25,301 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2021-08-26 05:13:25,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 05:13:25,302 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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 48 [2021-08-26 05:13:25,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:25,302 INFO L225 Difference]: With dead ends: 110 [2021-08-26 05:13:25,302 INFO L226 Difference]: Without dead ends: 96 [2021-08-26 05:13:25,303 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 65.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-26 05:13:25,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-08-26 05:13:25,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2021-08-26 05:13:25,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 75 states have (on average 1.08) internal successors, (81), 77 states have internal predecessors, (81), 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-26 05:13:25,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2021-08-26 05:13:25,311 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 48 [2021-08-26 05:13:25,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:25,312 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2021-08-26 05:13:25,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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-26 05:13:25,312 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2021-08-26 05:13:25,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-08-26 05:13:25,313 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:25,313 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:13:25,335 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-26 05:13:25,529 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-26 05:13:25,529 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:13:25,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:25,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1934789142, now seen corresponding path program 4 times [2021-08-26 05:13:25,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:25,530 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821276809] [2021-08-26 05:13:25,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:25,530 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:25,538 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:25,538 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1581970435] [2021-08-26 05:13:25,538 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-26 05:13:25,538 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:25,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:25,545 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-26 05:13:25,546 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-26 05:13:25,849 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-26 05:13:25,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:13:25,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 38 conjunts are in the unsatisfiable core [2021-08-26 05:13:25,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:27,750 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:13:27,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:27,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821276809] [2021-08-26 05:13:27,751 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:27,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581970435] [2021-08-26 05:13:27,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581970435] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:13:27,751 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:13:27,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2021-08-26 05:13:27,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41500281] [2021-08-26 05:13:27,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-26 05:13:27,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:27,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-26 05:13:27,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-08-26 05:13:27,753 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 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-26 05:13:28,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:28,784 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2021-08-26 05:13:28,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-26 05:13:28,789 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 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 53 [2021-08-26 05:13:28,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:28,789 INFO L225 Difference]: With dead ends: 133 [2021-08-26 05:13:28,790 INFO L226 Difference]: Without dead ends: 125 [2021-08-26 05:13:28,790 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 633.7ms TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2021-08-26 05:13:28,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-08-26 05:13:28,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 87. [2021-08-26 05:13:28,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 84 states have (on average 1.0833333333333333) internal successors, (91), 86 states have internal predecessors, (91), 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-26 05:13:28,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2021-08-26 05:13:28,803 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 53 [2021-08-26 05:13:28,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:28,803 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2021-08-26 05:13:28,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 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-26 05:13:28,804 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2021-08-26 05:13:28,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-26 05:13:28,804 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:28,805 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:13:28,845 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-26 05:13:29,020 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-26 05:13:29,021 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:13:29,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:29,021 INFO L82 PathProgramCache]: Analyzing trace with hash -413997928, now seen corresponding path program 5 times [2021-08-26 05:13:29,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:29,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061513206] [2021-08-26 05:13:29,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:29,022 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:29,028 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:29,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [253943772] [2021-08-26 05:13:29,028 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-26 05:13:29,028 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:29,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:29,029 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-26 05:13:29,045 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-26 05:13:29,455 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-08-26 05:13:29,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:13:29,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-26 05:13:29,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:29,698 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 37 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:13:29,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:29,699 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061513206] [2021-08-26 05:13:29,699 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:29,699 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253943772] [2021-08-26 05:13:29,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253943772] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:13:29,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:13:29,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-08-26 05:13:29,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348181811] [2021-08-26 05:13:29,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 05:13:29,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:29,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 05:13:29,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-26 05:13:29,701 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 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-26 05:13:29,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:29,870 INFO L93 Difference]: Finished difference Result 159 states and 165 transitions. [2021-08-26 05:13:29,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 05:13:29,871 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 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) Word has length 57 [2021-08-26 05:13:29,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:29,871 INFO L225 Difference]: With dead ends: 159 [2021-08-26 05:13:29,871 INFO L226 Difference]: Without dead ends: 116 [2021-08-26 05:13:29,876 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 48.2ms TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-08-26 05:13:29,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-08-26 05:13:29,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2021-08-26 05:13:29,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 103 states have (on average 1.087378640776699) internal successors, (112), 105 states have internal predecessors, (112), 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-26 05:13:29,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2021-08-26 05:13:29,890 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 57 [2021-08-26 05:13:29,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:29,891 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2021-08-26 05:13:29,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 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-26 05:13:29,892 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2021-08-26 05:13:29,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-26 05:13:29,892 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:29,892 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:13:29,920 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-26 05:13:30,108 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-26 05:13:30,109 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:13:30,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:30,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1860833829, now seen corresponding path program 6 times [2021-08-26 05:13:30,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:30,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695959067] [2021-08-26 05:13:30,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:30,110 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:30,117 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:30,117 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [286955199] [2021-08-26 05:13:30,117 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-26 05:13:30,117 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:30,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:30,118 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-26 05:13:30,123 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-26 05:13:30,567 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-08-26 05:13:30,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:13:30,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-26 05:13:30,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:30,975 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-08-26 05:13:30,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:30,976 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695959067] [2021-08-26 05:13:30,976 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:30,976 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286955199] [2021-08-26 05:13:30,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286955199] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:13:30,976 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:13:30,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-08-26 05:13:30,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144284524] [2021-08-26 05:13:30,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 05:13:30,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:30,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 05:13:30,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-26 05:13:30,979 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-26 05:13:31,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:31,197 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2021-08-26 05:13:31,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 05:13:31,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 62 [2021-08-26 05:13:31,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:31,199 INFO L225 Difference]: With dead ends: 125 [2021-08-26 05:13:31,199 INFO L226 Difference]: Without dead ends: 110 [2021-08-26 05:13:31,199 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 131.9ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-08-26 05:13:31,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-08-26 05:13:31,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 81. [2021-08-26 05:13:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 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-26 05:13:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2021-08-26 05:13:31,212 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 62 [2021-08-26 05:13:31,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:31,212 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2021-08-26 05:13:31,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-26 05:13:31,212 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2021-08-26 05:13:31,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-26 05:13:31,213 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:31,213 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:13:31,235 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-26 05:13:31,425 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-26 05:13:31,425 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:13:31,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:31,425 INFO L82 PathProgramCache]: Analyzing trace with hash 300678153, now seen corresponding path program 7 times [2021-08-26 05:13:31,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:31,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004244900] [2021-08-26 05:13:31,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:31,426 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:31,431 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:31,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1823585330] [2021-08-26 05:13:31,432 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-26 05:13:31,432 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:31,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:31,433 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-26 05:13:31,444 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-26 05:13:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:13:31,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 48 conjunts are in the unsatisfiable core [2021-08-26 05:13:31,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:33,961 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:13:33,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:33,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004244900] [2021-08-26 05:13:33,961 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:33,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823585330] [2021-08-26 05:13:33,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823585330] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:13:33,962 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:13:33,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2021-08-26 05:13:33,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187562456] [2021-08-26 05:13:33,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-26 05:13:33,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:33,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-26 05:13:33,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-08-26 05:13:33,967 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 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-26 05:13:36,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:36,220 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2021-08-26 05:13:36,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-26 05:13:36,220 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 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 66 [2021-08-26 05:13:36,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:36,221 INFO L225 Difference]: With dead ends: 133 [2021-08-26 05:13:36,221 INFO L226 Difference]: Without dead ends: 126 [2021-08-26 05:13:36,222 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1860.1ms TimeCoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2021-08-26 05:13:36,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-08-26 05:13:36,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 112. [2021-08-26 05:13:36,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 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-26 05:13:36,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2021-08-26 05:13:36,242 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 66 [2021-08-26 05:13:36,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:36,242 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2021-08-26 05:13:36,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 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-26 05:13:36,242 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2021-08-26 05:13:36,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-26 05:13:36,243 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:36,243 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:13:36,284 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-26 05:13:36,459 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-26 05:13:36,459 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:13:36,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:36,460 INFO L82 PathProgramCache]: Analyzing trace with hash 397597340, now seen corresponding path program 8 times [2021-08-26 05:13:36,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:36,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212743899] [2021-08-26 05:13:36,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:36,460 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:36,470 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:36,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2867676] [2021-08-26 05:13:36,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 05:13:36,480 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:36,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:36,493 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-26 05:13:36,512 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-26 05:13:37,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 05:13:37,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:13:37,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-26 05:13:37,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:37,395 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 55 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:13:37,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:37,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212743899] [2021-08-26 05:13:37,396 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:37,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2867676] [2021-08-26 05:13:37,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2867676] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:13:37,396 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:13:37,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2021-08-26 05:13:37,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192527234] [2021-08-26 05:13:37,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 05:13:37,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:37,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 05:13:37,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-08-26 05:13:37,398 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 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-26 05:13:37,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:37,843 INFO L93 Difference]: Finished difference Result 196 states and 202 transitions. [2021-08-26 05:13:37,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-26 05:13:37,844 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 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 75 [2021-08-26 05:13:37,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:37,845 INFO L225 Difference]: With dead ends: 196 [2021-08-26 05:13:37,845 INFO L226 Difference]: Without dead ends: 136 [2021-08-26 05:13:37,846 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 120.7ms TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-08-26 05:13:37,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-08-26 05:13:37,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 121. [2021-08-26 05:13:37,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.05) internal successors, (126), 120 states have internal predecessors, (126), 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-26 05:13:37,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2021-08-26 05:13:37,868 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 75 [2021-08-26 05:13:37,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:37,868 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2021-08-26 05:13:37,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 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-26 05:13:37,868 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2021-08-26 05:13:37,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-26 05:13:37,869 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:37,869 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:13:37,899 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-26 05:13:38,088 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-26 05:13:38,089 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:13:38,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:38,089 INFO L82 PathProgramCache]: Analyzing trace with hash 822588344, now seen corresponding path program 9 times [2021-08-26 05:13:38,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:38,089 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611075087] [2021-08-26 05:13:38,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:38,090 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:38,098 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:38,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [606905856] [2021-08-26 05:13:38,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 05:13:38,098 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:38,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:38,099 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-26 05:13:38,101 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-26 05:13:38,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-08-26 05:13:38,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:13:38,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-26 05:13:38,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:38,951 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 72 proven. 1 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-08-26 05:13:38,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:38,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611075087] [2021-08-26 05:13:38,952 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:38,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606905856] [2021-08-26 05:13:38,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606905856] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:13:38,952 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:13:38,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2021-08-26 05:13:38,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616488469] [2021-08-26 05:13:38,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 05:13:38,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:38,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 05:13:38,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-26 05:13:38,954 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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-26 05:13:39,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:39,065 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2021-08-26 05:13:39,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 05:13:39,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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 75 [2021-08-26 05:13:39,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:39,066 INFO L225 Difference]: With dead ends: 121 [2021-08-26 05:13:39,066 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 05:13:39,067 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.4ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-08-26 05:13:39,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 05:13:39,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 05:13:39,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-26 05:13:39,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 05:13:39,068 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2021-08-26 05:13:39,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:39,068 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 05:13:39,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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-26 05:13:39,068 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 05:13:39,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 05:13:39,071 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 05:13:39,071 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 05:13:39,071 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 05:13:39,071 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 05:13:39,073 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 05:13:39,073 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 05:13:39,073 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 05:13:39,091 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-26 05:13:39,273 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-26 05:13:39,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 05:13:39,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:39,279 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:39,567 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:39,683 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:39,794 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:39,908 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:40,063 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:40,096 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:40,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:40,173 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:46,378 WARN L207 SmtUtils]: Spent 6.20 s on a formula simplification. DAG size of input: 195 DAG size of output: 36 [2021-08-26 05:13:52,178 WARN L207 SmtUtils]: Spent 5.80 s on a formula simplification. DAG size of input: 179 DAG size of output: 40 [2021-08-26 05:14:03,741 WARN L207 SmtUtils]: Spent 5.85 s on a formula simplification. DAG size of input: 182 DAG size of output: 82 [2021-08-26 05:14:10,248 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-08-26 05:14:10,248 INFO L857 garLoopResultBuilder]: For program point L11(lines 11 13) no Hoare annotation was computed. [2021-08-26 05:14:10,248 INFO L857 garLoopResultBuilder]: For program point L11-1(lines 11 13) no Hoare annotation was computed. [2021-08-26 05:14:10,248 INFO L857 garLoopResultBuilder]: For program point L11-2(lines 11 13) no Hoare annotation was computed. [2021-08-26 05:14:10,248 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-08-26 05:14:10,248 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 05:14:10,249 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 05:14:10,249 INFO L857 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2021-08-26 05:14:10,249 INFO L857 garLoopResultBuilder]: For program point L12-2(line 12) no Hoare annotation was computed. [2021-08-26 05:14:10,249 INFO L857 garLoopResultBuilder]: For program point L12-4(line 12) no Hoare annotation was computed. [2021-08-26 05:14:10,249 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-08-26 05:14:10,249 INFO L853 garLoopResultBuilder]: At program point L38-2(lines 38 62) the Hoare annotation is: (let ((.cse4 (= ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~y~0 (div (* ULTIMATE.start_main_~a~0 (- 1)) (- 2)))))) (.cse0 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse5 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse1 (<= 1 ULTIMATE.start_main_~y~0)) (.cse2 (<= ULTIMATE.start_main_~y~0 20)) (.cse3 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))))) (or (and .cse0 .cse1 (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~q~0) .cse2 .cse3 .cse4 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0)) (and .cse0 .cse5 .cse1 .cse2 .cse3 .cse4 (= (mod ULTIMATE.start_main_~a~0 (- 2)) 0)) (and .cse0 .cse5 (< ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) .cse1 (= ULTIMATE.start_main_~a~0 1) .cse2 .cse3 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))) [2021-08-26 05:14:10,249 INFO L857 garLoopResultBuilder]: For program point L38-3(lines 38 62) no Hoare annotation was computed. [2021-08-26 05:14:10,249 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-08-26 05:14:10,250 INFO L853 garLoopResultBuilder]: At program point L47-2(lines 47 59) the Hoare annotation is: (let ((.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse3 (<= 1 ULTIMATE.start_main_~y~0)) (.cse5 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0)))) (.cse6 (= ULTIMATE.start_main_~a~0 1)) (.cse0 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse2 (<= 0 ULTIMATE.start_main_~r~0)) (.cse4 (<= ULTIMATE.start_main_~y~0 20)) (.cse7 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~y~0 (div (* ULTIMATE.start_main_~a~0 (- 1)) (- 2))))) (= (mod ULTIMATE.start_main_~a~0 (- 2)) 0)) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse4 .cse5 .cse7) (and (< ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~b~0)) (let ((.cse9 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond))) (or (let ((.cse8 (div ULTIMATE.start_main_~q~0 2)) (.cse10 (* 8 ULTIMATE.start_main_~y~0))) (and .cse0 (= (mod (div (- .cse8) (- 2)) (- 2)) 0) (= ULTIMATE.start_main_~y~0 (* (div (* (div (* .cse8 (- 1)) (- 2)) (- 1)) (- 2)) ULTIMATE.start_main_~y~0)) .cse9 .cse6 .cse4 (= (mod ULTIMATE.start_main_~q~0 2) 0) (= (mod .cse8 (- 2)) 0) .cse7 (<= .cse10 ULTIMATE.start_main_~x~0) (= (+ ULTIMATE.start_main_~r~0 .cse10) ULTIMATE.start_main_~x~0))) (and (or (and (= ULTIMATE.start_main_~q~0 4) .cse0 .cse9 (= (+ ULTIMATE.start_main_~r~0 (* 4 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~x~0) .cse2 .cse6 .cse4) (and (or (and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) .cse0 .cse9 .cse2 .cse4 (= ULTIMATE.start_main_~q~0 1)) (and .cse0 .cse9 (= ULTIMATE.start_main_~q~0 2) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~y~0))) .cse2 .cse4)) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0)))) .cse7)))))) [2021-08-26 05:14:10,250 INFO L857 garLoopResultBuilder]: For program point L47-3(lines 47 59) no Hoare annotation was computed. [2021-08-26 05:14:10,250 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-08-26 05:14:10,250 INFO L857 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2021-08-26 05:14:10,250 INFO L853 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (let ((.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse4 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0)))) (.cse0 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse2 (<= 1 ULTIMATE.start_main_~y~0)) (.cse6 (= ULTIMATE.start_main_~a~0 1)) (.cse3 (<= ULTIMATE.start_main_~y~0 20)) (.cse7 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (.cse5 (< ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~y~0 (div (* ULTIMATE.start_main_~a~0 (- 1)) (- 2))))) (= (mod ULTIMATE.start_main_~a~0 (- 2)) 0)) (and .cse0 .cse5 .cse1 .cse2 .cse6 .cse3 .cse4 .cse7) (and (or (and .cse0 (= ULTIMATE.start_main_~q~0 2) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~y~0))) .cse2 .cse3) (and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) .cse0 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse2 .cse6 .cse3 (= ULTIMATE.start_main_~q~0 1) .cse7)) .cse5 (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))) [2021-08-26 05:14:10,250 INFO L857 garLoopResultBuilder]: For program point L15-3(lines 15 18) no Hoare annotation was computed. [2021-08-26 05:14:10,250 INFO L853 garLoopResultBuilder]: At program point L15-5(lines 42 43) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse9 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (<= 1 ULTIMATE.start_main_~y~0)) (.cse12 (= ULTIMATE.start_main_~a~0 1)) (.cse3 (<= ULTIMATE.start_main_~y~0 20)) (.cse13 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))) (let ((.cse5 (= ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~y~0 (div (* ULTIMATE.start_main_~a~0 (- 1)) (- 2)))))) (.cse6 (= (mod ULTIMATE.start_main_~a~0 (- 2)) 0)) (.cse7 (or (and .cse0 .cse9 (= ULTIMATE.start_main_~q~0 2) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~y~0))) .cse2 .cse3) (and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) .cse0 .cse9 .cse2 .cse12 .cse3 (= ULTIMATE.start_main_~q~0 1) .cse13))) (.cse11 (< ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse4 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (or (and .cse7 .cse5 .cse6) (let ((.cse8 (div ULTIMATE.start_main_~q~0 2)) (.cse10 (* 8 ULTIMATE.start_main_~y~0))) (and .cse0 (= (mod (div (- .cse8) (- 2)) (- 2)) 0) (= ULTIMATE.start_main_~y~0 (* (div (* (div (* .cse8 (- 1)) (- 2)) (- 1)) (- 2)) ULTIMATE.start_main_~y~0)) .cse9 .cse3 (= (mod ULTIMATE.start_main_~q~0 2) 0) (= (mod .cse8 (- 2)) 0) .cse5 .cse6 (<= .cse10 ULTIMATE.start_main_~x~0) (= (+ ULTIMATE.start_main_~r~0 .cse10) ULTIMATE.start_main_~x~0))) (and (= ULTIMATE.start_main_~q~0 4) .cse0 .cse9 (= (+ ULTIMATE.start_main_~r~0 (* 4 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~x~0) .cse2 .cse3 .cse5 .cse6)) (< (div (+ (- 1) (* ULTIMATE.start_main_~r~0 (- 1))) (- 2)) (+ ULTIMATE.start_main_~y~0 1)) (<= (div (* ULTIMATE.start_main_~b~0 (- 1)) (- 2)) ULTIMATE.start_main_~y~0)) (and .cse7 .cse11 (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (and .cse0 .cse11 .cse1 .cse2 .cse12 .cse3 .cse4 .cse13)))) [2021-08-26 05:14:10,250 INFO L857 garLoopResultBuilder]: For program point L15-6(lines 15 18) no Hoare annotation was computed. [2021-08-26 05:14:10,250 INFO L853 garLoopResultBuilder]: At program point L15-8(lines 14 20) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse5 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0)) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (<= 0 ULTIMATE.start_main_~r~0)) (.cse3 (<= 1 ULTIMATE.start_main_~y~0)) (.cse4 (<= ULTIMATE.start_main_~y~0 20))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_main_~a~0 1) .cse4 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse5)) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (and .cse0 (= (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~r~0 .cse5) (+ ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0))) .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~y~0 (div (* ULTIMATE.start_main_~a~0 (- 1)) (- 2))))) (= (mod ULTIMATE.start_main_~a~0 (- 2)) 0)))) [2021-08-26 05:14:10,250 INFO L857 garLoopResultBuilder]: For program point L15-9(lines 15 18) no Hoare annotation was computed. [2021-08-26 05:14:10,251 INFO L853 garLoopResultBuilder]: At program point L15-11(lines 14 20) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse5 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0)) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (<= 0 ULTIMATE.start_main_~r~0)) (.cse3 (<= 1 ULTIMATE.start_main_~y~0)) (.cse4 (<= ULTIMATE.start_main_~y~0 20))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_main_~a~0 1) .cse4 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse5)) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (and .cse0 (= (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~r~0 .cse5) (+ ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0))) .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~y~0 (div (* ULTIMATE.start_main_~a~0 (- 1)) (- 2))))) (= (mod ULTIMATE.start_main_~a~0 (- 2)) 0)))) [2021-08-26 05:14:10,251 INFO L857 garLoopResultBuilder]: For program point L15-12(lines 15 18) no Hoare annotation was computed. [2021-08-26 05:14:10,251 INFO L853 garLoopResultBuilder]: At program point L15-14(lines 52 53) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse1 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (<= 0 ULTIMATE.start_main_~r~0)) (.cse3 (<= 1 ULTIMATE.start_main_~y~0)) (.cse4 (<= ULTIMATE.start_main_~y~0 20)) (.cse5 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_main_~a~0 1) .cse4 .cse5 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~y~0 (div (* ULTIMATE.start_main_~a~0 (- 1)) (- 2))))) (= (mod ULTIMATE.start_main_~a~0 (- 2)) 0)))) [2021-08-26 05:14:10,251 INFO L860 garLoopResultBuilder]: At program point L65(lines 22 66) the Hoare annotation is: true [2021-08-26 05:14:10,251 INFO L857 garLoopResultBuilder]: For program point L15-15(lines 15 18) no Hoare annotation was computed. [2021-08-26 05:14:10,251 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 05:14:10,251 INFO L853 garLoopResultBuilder]: At program point L15-17(lines 14 20) the Hoare annotation is: (and (let ((.cse0 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (<= 0 ULTIMATE.start_main_~r~0)) (.cse3 (<= ULTIMATE.start_main_~y~0 20))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_main_~a~0 1) .cse3 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~y~0 (div (* ULTIMATE.start_main_~a~0 (- 1)) (- 2))))) (= (mod ULTIMATE.start_main_~a~0 (- 2)) 0)))) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0)))) [2021-08-26 05:14:10,251 INFO L857 garLoopResultBuilder]: For program point L15-18(lines 15 18) no Hoare annotation was computed. [2021-08-26 05:14:10,251 INFO L860 garLoopResultBuilder]: At program point L15-20(lines 14 20) the Hoare annotation is: true [2021-08-26 05:14:10,251 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-08-26 05:14:10,251 INFO L857 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2021-08-26 05:14:10,252 INFO L857 garLoopResultBuilder]: For program point L16-1(lines 16 17) no Hoare annotation was computed. [2021-08-26 05:14:10,252 INFO L857 garLoopResultBuilder]: For program point L16-2(lines 16 17) no Hoare annotation was computed. [2021-08-26 05:14:10,252 INFO L857 garLoopResultBuilder]: For program point L16-3(lines 16 17) no Hoare annotation was computed. [2021-08-26 05:14:10,252 INFO L857 garLoopResultBuilder]: For program point L16-4(lines 16 17) no Hoare annotation was computed. [2021-08-26 05:14:10,252 INFO L857 garLoopResultBuilder]: For program point L16-5(lines 16 17) no Hoare annotation was computed. [2021-08-26 05:14:10,252 INFO L857 garLoopResultBuilder]: For program point L16-6(lines 16 17) no Hoare annotation was computed. [2021-08-26 05:14:10,252 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 05:14:10,252 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-08-26 05:14:10,254 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 05:14:10,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 05:14:10 BoogieIcfgContainer [2021-08-26 05:14:10,283 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 05:14:10,283 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 05:14:10,283 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 05:14:10,284 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 05:14:10,284 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 05:13:02" (3/4) ... [2021-08-26 05:14:10,287 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 05:14:10,295 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2021-08-26 05:14:10,296 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-26 05:14:10,296 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 05:14:10,296 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 05:14:10,334 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 05:14:10,335 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 05:14:10,335 INFO L168 Benchmark]: Toolchain (without parser) took 68403.35 ms. Allocated memory was 56.6 MB in the beginning and 255.9 MB in the end (delta: 199.2 MB). Free memory was 34.7 MB in the beginning and 125.7 MB in the end (delta: -91.0 MB). Peak memory consumption was 110.3 MB. Max. memory is 16.1 GB. [2021-08-26 05:14:10,336 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 56.6 MB. Free memory was 38.0 MB in the beginning and 37.9 MB in the end (delta: 44.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 05:14:10,336 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.32 ms. Allocated memory is still 56.6 MB. Free memory was 34.5 MB in the beginning and 40.2 MB in the end (delta: -5.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-26 05:14:10,336 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.07 ms. Allocated memory is still 56.6 MB. Free memory was 40.0 MB in the beginning and 38.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 05:14:10,337 INFO L168 Benchmark]: Boogie Preprocessor took 17.66 ms. Allocated memory is still 56.6 MB. Free memory was 38.0 MB in the beginning and 36.9 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 05:14:10,337 INFO L168 Benchmark]: RCFGBuilder took 437.75 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 36.7 MB in the beginning and 47.7 MB in the end (delta: -10.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 16.1 GB. [2021-08-26 05:14:10,338 INFO L168 Benchmark]: TraceAbstraction took 67679.93 ms. Allocated memory was 69.2 MB in the beginning and 255.9 MB in the end (delta: 186.6 MB). Free memory was 47.1 MB in the beginning and 129.9 MB in the end (delta: -82.7 MB). Peak memory consumption was 185.6 MB. Max. memory is 16.1 GB. [2021-08-26 05:14:10,338 INFO L168 Benchmark]: Witness Printer took 51.46 ms. Allocated memory is still 255.9 MB. Free memory was 129.9 MB in the beginning and 125.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 05:14:10,339 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.17 ms. Allocated memory is still 56.6 MB. Free memory was 38.0 MB in the beginning and 37.9 MB in the end (delta: 44.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 163.32 ms. Allocated memory is still 56.6 MB. Free memory was 34.5 MB in the beginning and 40.2 MB in the end (delta: -5.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 46.07 ms. Allocated memory is still 56.6 MB. Free memory was 40.0 MB in the beginning and 38.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 17.66 ms. Allocated memory is still 56.6 MB. Free memory was 38.0 MB in the beginning and 36.9 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 437.75 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 36.7 MB in the beginning and 47.7 MB in the end (delta: -10.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 67679.93 ms. Allocated memory was 69.2 MB in the beginning and 255.9 MB in the end (delta: 186.6 MB). Free memory was 47.1 MB in the beginning and 129.9 MB in the end (delta: -82.7 MB). Peak memory consumption was 185.6 MB. Max. memory is 16.1 GB. * Witness Printer took 51.46 ms. Allocated memory is still 255.9 MB. Free memory was 129.9 MB in the beginning and 125.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 67596.0ms, OverallIterations: 19, TraceHistogramMax: 6, EmptinessCheckTime: 27.8ms, AutomataDifference: 18425.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 30973.9ms, InitialAbstractionConstructionTime: 9.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 556 SDtfs, 1376 SDslu, 1328 SDs, 0 SdLazy, 2732 SolverSat, 408 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7944.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 818 GetRequests, 627 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 11100.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=10, InterpolantAutomatonStates: 182, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 234.0ms AutomataMinimizationTime, 19 MinimizatonAttempts, 427 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 102 NumberOfFragments, 1049 HoareAnnotationTreeSize, 10 FomulaSimplifications, 2278298 FormulaSimplificationTreeSizeReduction, 896.7ms HoareSimplificationTime, 10 FomulaSimplificationsInter, 558121 FormulaSimplificationTreeSizeReductionInter, 30068.5ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 163.8ms SsaConstructionTime, 435.4ms SatisfiabilityAnalysisTime, 8669.7ms InterpolantComputationTime, 753 NumberOfCodeBlocks, 630 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 734 ConstructedInterpolants, 0 QuantifiedInterpolants, 6524 SizeOfPredicates, 132 NumberOfNonLiveVariables, 2320 ConjunctsInSsa, 329 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 392/694 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 - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (((((((cond == 1 && 1 == cond) && 0 <= r) && 1 <= y) && a == 1) && y <= 20) && x == r + q * y) && b == y) || (((((((cond == 1 && b + r + q * y == x + a * y) && 1 == cond) && 0 <= r) && 1 <= y) && y <= 20) && b == 2 * (y * (a * -1 / -2))) && a % -2 == 0) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (((((((cond == 1 && 1 == cond) && 0 <= r) && a == 1) && y <= 20) && b == y) || (((((cond == 1 && 1 == cond) && 0 <= r) && y <= 20) && b == 2 * (y * (a * -1 / -2))) && a % -2 == 0)) && 1 <= y) && x == r + q * y - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: (((((((cond == 1 && 1 <= cond) && 0 <= r) && 1 <= y) && a == 1) && y <= 20) && x == r + q * y) && b == y) || (((((((cond == 1 && 1 <= cond) && 0 <= r) && 1 <= y) && y <= 20) && x == r + q * y) && b == 2 * (y * (a * -1 / -2))) && a % -2 == 0) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (((((((cond == 1 && 1 == cond) && 0 <= r) && 1 <= y) && a == 1) && y <= 20) && x == r + q * y) && b == y) || (((((((cond == 1 && b + r + q * y == x + a * y) && 1 == cond) && 0 <= r) && 1 <= y) && y <= 20) && b == 2 * (y * (a * -1 / -2))) && a % -2 == 0) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: ((((((((cond == 1 && 1 == cond) && 1 <= y) && y <= 20) && x == r + q * y) && b == 2 * (y * (a * -1 / -2))) && a % -2 == 0) || ((((((((((((cond == 1 && 1 <= cond) && q == 2) && x == r + 2 * y) && 1 <= y) && y <= 20) || (((((((x == r + y && cond == 1) && 1 <= cond) && 1 <= y) && a == 1) && y <= 20) && q == 1) && b == y)) && b == 2 * (y * (a * -1 / -2))) && a % -2 == 0) || ((((((((((cond == 1 && -(q / 2) / -2 % -2 == 0) && y == q / 2 * -1 / -2 * -1 / -2 * y) && 1 <= cond) && y <= 20) && q % 2 == 0) && q / 2 % -2 == 0) && b == 2 * (y * (a * -1 / -2))) && a % -2 == 0) && 8 * y <= x) && r + 8 * y == x)) || (((((((q == 4 && cond == 1) && 1 <= cond) && r + 4 * y == x) && 1 <= y) && y <= 20) && b == 2 * (y * (a * -1 / -2))) && a % -2 == 0)) && (-1 + r * -1) / -2 < y + 1) && b * -1 / -2 <= y)) || ((((((((cond == 1 && 1 <= cond) && q == 2) && x == r + 2 * y) && 1 <= y) && y <= 20) || (((((((x == r + y && cond == 1) && 1 <= cond) && 1 <= y) && a == 1) && y <= 20) && q == 1) && b == y)) && r < y) && b <= y)) || (((((((cond == 1 && r < y) && 1 == cond) && 1 <= y) && a == 1) && y <= 20) && x == r + q * y) && b == y) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((((cond == 1 && 1 == cond) && 0 <= r) && 1 <= y) && y <= 20) && x == r + q * y) && b == 2 * (y * (a * -1 / -2))) && a % -2 == 0) || (((((((cond == 1 && 1 == cond) && 0 <= r) && 1 <= y) && a == 1) && y <= 20) && x == r + q * y) && b == y)) || (r < 2 * b && (((((((((((cond == 1 && -(q / 2) / -2 % -2 == 0) && y == q / 2 * -1 / -2 * -1 / -2 * y) && 1 <= cond) && a == 1) && y <= 20) && q % 2 == 0) && q / 2 % -2 == 0) && b == y) && 8 * y <= x) && r + 8 * y == x) || ((((((((q == 4 && cond == 1) && 1 <= cond) && r + 4 * y == x) && 0 <= r) && a == 1) && y <= 20) || (((((((x == r + y && cond == 1) && 1 <= cond) && 0 <= r) && y <= 20) && q == 1) || (((((cond == 1 && 1 <= cond) && q == 2) && x == r + 2 * y) && 0 <= r) && y <= 20)) && b == a * y)) && b == y))) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((((cond == 1 && 1 <= y) && a == q) && y <= 20) && x == r + q * y) && b == 2 * (y * (a * -1 / -2))) && r == x) || ((((((cond == 1 && 1 <= cond) && 1 <= y) && y <= 20) && x == r + q * y) && b == 2 * (y * (a * -1 / -2))) && a % -2 == 0)) || (((((((cond == 1 && 1 <= cond) && r < y) && 1 <= y) && a == 1) && y <= 20) && x == r + q * y) && b == y) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (((((((cond == 1 && 1 == cond) && 1 <= y) && y <= 20) && x == r + q * y) && b == 2 * (y * (a * -1 / -2))) && a % -2 == 0) || (((((((cond == 1 && r < y) && 1 == cond) && 1 <= y) && a == 1) && y <= 20) && x == r + q * y) && b == y)) || (((((((cond == 1 && q == 2) && x == r + 2 * y) && 1 <= y) && y <= 20) || (((((((x == r + y && cond == 1) && 1 <= cond) && 1 <= y) && a == 1) && y <= 20) && q == 1) && b == y)) && r < y) && b <= y) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-08-26 05:14:10,412 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...